Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r276-smll-171654416100159.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is Peterson-PT-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654416100159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 19K Apr 12 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 262K Apr 12 02:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 12 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 224K Apr 12 02:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 100K May 18 16:43 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 1716820269032

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 14:31:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-27 14:31:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 14:31:11] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-27 14:31:11] [INFO ] Transformed 102 places.
[2024-05-27 14:31:11] [INFO ] Transformed 126 transitions.
[2024-05-27 14:31:11] [INFO ] Found NUPN structural information;
[2024-05-27 14:31:11] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 274 ms.
Built sparse matrix representations for Structural reductions in 7 ms.15291KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 102/102 places, 126/126 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 29 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 53 ms. Remains : 102/102 places, 126/126 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 102/102 places, 126/126 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 8 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-27 14:31:11] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-27 14:31:11] [INFO ] Computed 11 invariants in 9 ms
[2024-05-27 14:31:11] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-27 14:31:11] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-27 14:31:11] [INFO ] Invariant cache hit.
[2024-05-27 14:31:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 14:31:12] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2024-05-27 14:31:12] [INFO ] Redundant transitions in 4 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-27 14:31:12] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-27 14:31:12] [INFO ] Invariant cache hit.
[2024-05-27 14:31:12] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-27 14:31:13] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 18 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 4 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 2 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 2 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-27 14:31:14] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
[2024-05-27 14:31:15] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-27 14:31:15] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-27 14:31:15] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 256 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9320 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 120/222 variables, 102/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 123/379 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-27 14:31:24] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 380 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7073 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints]
After SMT, in 16510ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 16530ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 17267 ms. Remains : 102/102 places, 126/126 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1146 ms (no deadlock found). (steps per millisecond=1090 )
Random directed walk for 1250003 steps, including 0 resets, run took 956 ms (no deadlock found). (steps per millisecond=1307 )
[2024-05-27 14:31:30] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-27 14:31:30] [INFO ] Invariant cache hit.
[2024-05-27 14:31:30] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 14:31:30] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 31 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
[2024-05-27 14:31:30] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 42 cols
[2024-05-27 14:31:30] [INFO ] Computed 11 invariants in 2 ms
[2024-05-27 14:31:30] [INFO ] Implicit Places using invariants in 89 ms returned [31, 33, 34]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 39/102 places, 66/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 126 ms. Remains : 39/102 places, 66/126 transitions.
Discarding 3 transitions out of 66. Remains 63
RANDOM walk for 40000 steps (8 resets) in 2469 ms. (16 steps per ms) remains 10/63 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
[2024-05-27 14:31:32] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 39 cols
[2024-05-27 14:31:32] [INFO ] Computed 8 invariants in 1 ms
[2024-05-27 14:31:32] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 25/38 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-27 14:31:32] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-27 14:31:32] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
[2024-05-27 14:31:32] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-27 14:31:32] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-27 14:31:32] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-27 14:31:32] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
[2024-05-27 14:31:32] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-27 14:31:32] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-27 14:31:32] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 60/99 variables, 39/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 117 constraints, problems are : Problem set: 0 solved, 7 unsolved in 585 ms.
Refiners :[Domain max(s): 39/39 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 25/38 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/39 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 60/99 variables, 39/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/99 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 124 constraints, problems are : Problem set: 0 solved, 7 unsolved in 225 ms.
Refiners :[Domain max(s): 39/39 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 39/39 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 9/9 constraints]
After SMT, in 820ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 976 ms.
Support contains 12 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 66/66 transitions.
Applied a total of 0 rules in 4 ms. Remains 39 /39 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 39/39 places, 66/66 transitions.
RANDOM walk for 4000000 steps (8 resets) in 10358 ms. (386 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2782 ms. (1437 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2701 ms. (1480 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3071 ms. (1302 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2868 ms. (1394 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2858 ms. (1399 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2821 ms. (1417 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 3004 steps, run visited all 6 properties in 29 ms. (steps per millisecond=103 )
Probabilistic random walk after 3004 steps, saw 803 distinct states, run finished after 35 ms. (steps per millisecond=85 ) properties seen :6
Able to resolve query QuasiLiveness after proving 63 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 6 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
[2024-05-27 14:31:42] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 42 cols
[2024-05-27 14:31:42] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 14:31:42] [INFO ] Implicit Places using invariants in 80 ms returned [31, 33, 34]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 81 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 39/102 places, 66/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 88 ms. Remains : 39/102 places, 66/126 transitions.
Discarding 3 transitions out of 66. Remains 63
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 :63 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 63 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 31394 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Peterson-PT-2

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 102
TRANSITIONS: 126
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 384
NUPN UNITS: 10
LOADING TIME: 0.385

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.032
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.707
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: 661
MODEL NAME: /home/mcc/execution/model
102 places, 126 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 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716820305787

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-2"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is Peterson-PT-2, 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 r276-smll-171654416100159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-2.tgz
mv Peterson-PT-2 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;