Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398500562.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-15, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500562
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 157K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716306953122

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:55:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:55:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:55:54] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-21 15:55:54] [INFO ] Transformed 630 places.
[2024-05-21 15:55:54] [INFO ] Transformed 566 transitions.
[2024-05-21 15:55:54] [INFO ] Found NUPN structural information;
[2024-05-21 15:55:54] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
Support contains 121 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 74 place count 552 transition count 491
Iterating global reduction 1 with 71 rules applied. Total rules applied 145 place count 552 transition count 491
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 182 place count 515 transition count 454
Iterating global reduction 1 with 37 rules applied. Total rules applied 219 place count 515 transition count 454
Applied a total of 219 rules in 111 ms. Remains 515 /626 variables (removed 111) and now considering 454/562 (removed 108) transitions.
// Phase 1: matrix 454 rows 515 cols
[2024-05-21 15:55:54] [INFO ] Computed 99 invariants in 29 ms
[2024-05-21 15:55:54] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-21 15:55:54] [INFO ] Invariant cache hit.
[2024-05-21 15:55:55] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2024-05-21 15:55:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/515 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:05] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 38 ms to minimize.
[2024-05-21 15:56:05] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:56:05] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 4 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 3 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 105 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 101 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:08] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:56:08] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 3 ms to minimize.
[2024-05-21 15:56:08] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 3 ms to minimize.
[2024-05-21 15:56:08] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 3 ms to minimize.
[2024-05-21 15:56:08] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:56:08] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:56:08] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:56:08] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:56:08] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:56:09] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 3 ms to minimize.
[2024-05-21 15:56:09] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:56:09] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:56:09] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 3 ms to minimize.
[2024-05-21 15:56:09] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 3 ms to minimize.
[2024-05-21 15:56:09] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 5 ms to minimize.
[2024-05-21 15:56:09] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:56:09] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:56:10] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:56:10] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:56:10] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:10] [INFO ] Deduced a trap composed of 70 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:56:10] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:56:10] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:56:11] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:56:11] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:56:11] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:56:11] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:56:11] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:56:11] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:56:12] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:56:12] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 4 ms to minimize.
[2024-05-21 15:56:12] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:56:12] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:56:12] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:56:12] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:56:12] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:56:13] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:56:13] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:56:13] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:56:13] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:16] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:56:17] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:56:17] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:56:17] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 4 ms to minimize.
[2024-05-21 15:56:17] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:56:17] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 97 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 101 places in 147 ms of which 4 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:56:19] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:56:19] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:56:19] [INFO ] Deduced a trap composed of 109 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:56:19] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:56:19] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:56:19] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:56:19] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:20] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:56:20] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:56:20] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:56:20] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 4 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 5 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 5 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 110 places in 115 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/969 variables, and 213 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/515 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 114/114 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/515 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 114/213 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:29] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:56:29] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:56:29] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:56:29] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:56:29] [INFO ] Deduced a trap composed of 121 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:56:30] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:56:30] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:56:30] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:56:30] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 4 ms to minimize.
[2024-05-21 15:56:30] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:56:30] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:56:30] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:56:31] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:56:31] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:56:31] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:56:31] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:56:31] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:56:31] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:56:31] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:56:32] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:32] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:56:32] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:56:32] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:56:33] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:56:33] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:56:33] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:56:33] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:56:33] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 4 ms to minimize.
[2024-05-21 15:56:33] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:56:33] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:56:34] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 5 ms to minimize.
[2024-05-21 15:56:34] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:56:34] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:56:34] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:56:34] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:56:34] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:56:34] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:56:35] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:56:35] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:56:35] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 20/253 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:36] [INFO ] Deduced a trap composed of 101 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:56:36] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:56:36] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:56:36] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:56:36] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:56:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 15:56:37] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:56:37] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:56:37] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:56:37] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:56:37] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:56:37] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:56:38] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:56:38] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:56:38] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 3 ms to minimize.
[2024-05-21 15:56:38] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:56:38] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:56:38] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:56:38] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:56:38] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 20/273 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:39] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:56:39] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:56:40] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 5 ms to minimize.
[2024-05-21 15:56:40] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:56:40] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:56:40] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:56:40] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:56:40] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:56:40] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:56:41] [INFO ] Deduced a trap composed of 111 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:56:41] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:56:41] [INFO ] Deduced a trap composed of 73 places in 150 ms of which 2 ms to minimize.
[2024-05-21 15:56:41] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:56:41] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:56:41] [INFO ] Deduced a trap composed of 107 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:56:41] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:56:41] [INFO ] Deduced a trap composed of 118 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:56:42] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 3 ms to minimize.
[2024-05-21 15:56:42] [INFO ] Deduced a trap composed of 119 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:56:42] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:42] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:56:42] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:56:43] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:56:43] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:56:43] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:56:43] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:56:43] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:56:43] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:56:44] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:56:44] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:56:44] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:56:44] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:56:44] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-21 15:56:44] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:56:44] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:56:44] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:56:45] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:56:45] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:56:45] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:56:45] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:46] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:56:46] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:56:46] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:56:46] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:56:46] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:56:46] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:56:46] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:56:47] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:56:47] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:56:47] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:56:47] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:56:47] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 2 ms to minimize.
[2024-05-21 15:56:47] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:56:47] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:56:48] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:56:48] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:56:48] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:56:48] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:56:48] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:56:48] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:49] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:56:50] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:56:50] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:56:50] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:56:50] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:56:50] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:56:50] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:56:50] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:56:51] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 5 ms to minimize.
[2024-05-21 15:56:51] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:56:51] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:56:51] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:56:51] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:56:51] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
[2024-05-21 15:56:51] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:56:52] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:56:52] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:56:52] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:56:52] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:56:52] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-21 15:56:53] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:56:53] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:56:54] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:56:54] [INFO ] Deduced a trap composed of 102 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:56:54] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:56:54] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:56:54] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:56:54] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:56:54] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:56:54] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:56:54] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:56:55] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:56:55] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:56:55] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:56:55] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:56:55] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-21 15:56:55] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:56:55] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:56:55] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 60218ms, After SMT, problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Starting structural reductions in LTL mode, iteration 1 : 515/626 places, 454/562 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61151 ms. Remains : 515/626 places, 454/562 transitions.
Support contains 121 out of 515 places after structural reductions.
[2024-05-21 15:56:55] [INFO ] Flatten gal took : 65 ms
[2024-05-21 15:56:55] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:56:55] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 116 out of 515 places (down from 121) after GAL structural reductions.
RANDOM walk for 40000 steps (270 resets) in 2227 ms. (17 steps per ms) remains 42/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
[2024-05-21 15:56:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 207/281 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 124/405 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp65 is UNSAT
At refinement iteration 6 (OVERLAPS) 103/508 variables, 39/98 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/509 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 450/959 variables, 509/608 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/959 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 41 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 12 (OVERLAPS) 9/968 variables, 5/613 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/968 variables, 0/613 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 14 (OVERLAPS) 1/969 variables, 1/614 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/969 variables, 0/614 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 16 (OVERLAPS) 0/969 variables, 0/614 constraints. Problems are: Problem set: 3 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 969/969 variables, and 614 constraints, problems are : Problem set: 3 solved, 39 unsolved in 3631 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 515/515 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 206/273 variables, 26/26 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-21 15:57:00] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:57:01] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:57:01] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:57:01] [INFO ] Deduced a trap composed of 93 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:57:01] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:57:01] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:57:01] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:57:01] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:57:01] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 9/35 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-21 15:57:02] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:57:02] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:57:02] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:57:02] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:57:02] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:57:02] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:57:02] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 7/42 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-21 15:57:02] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-21 15:57:02] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 1 ms to minimize.
[2024-05-21 15:57:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:57:02] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 4/46 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-21 15:57:03] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:57:03] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 2/48 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/48 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 128/401 variables, 32/80 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-21 15:57:03] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:57:03] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:57:03] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:57:03] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:57:04] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:57:04] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:57:04] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:57:04] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:57:04] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:57:04] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:57:04] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:57:04] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:57:04] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:57:04] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:57:05] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:57:05] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:57:05] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 17/97 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-21 15:57:05] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
SMT process timed out in 8741ms, After SMT, problems are : Problem set: 3 solved, 39 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 454/454 transitions.
Graph (complete) has 1148 edges and 515 vertex of which 514 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 514 transition count 408
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 469 transition count 406
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 467 transition count 406
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 95 place count 467 transition count 328
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 263 place count 377 transition count 328
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 273 place count 367 transition count 318
Iterating global reduction 3 with 10 rules applied. Total rules applied 283 place count 367 transition count 318
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 283 place count 367 transition count 317
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 366 transition count 317
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 510 place count 253 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 511 place count 253 transition count 204
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 512 place count 253 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 513 place count 252 transition count 203
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 518 place count 252 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 519 place count 251 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 520 place count 250 transition count 202
Applied a total of 520 rules in 139 ms. Remains 250 /515 variables (removed 265) and now considering 202/454 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 250/515 places, 202/454 transitions.
RANDOM walk for 40000 steps (1975 resets) in 1199 ms. (33 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (26 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (29 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (23 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (27 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (27 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (27 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (30 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (30 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (24 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 25 ms. (154 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (29 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (30 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (26 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (30 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (29 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (29 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (27 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (30 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (24 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (30 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
Interrupted probabilistic random walk after 416180 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :34 out of 39
Probabilistic random walk after 416180 steps, saw 71978 distinct states, run finished after 3004 ms. (steps per millisecond=138 ) properties seen :34
// Phase 1: matrix 202 rows 250 cols
[2024-05-21 15:57:09] [INFO ] Computed 85 invariants in 4 ms
[2024-05-21 15:57:09] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 68/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 35/115 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 71/186 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/191 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/193 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 197/390 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 62/452 variables, 57/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 25/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/452 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/452 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 336 constraints, problems are : Problem set: 0 solved, 5 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 250/250 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 68/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 35/115 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 71/186 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 15:57:10] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
Problem AtomicPropp59 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 5/191 variables, 5/59 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/193 variables, 2/61 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 197/390 variables, 193/254 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 1/255 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 2/257 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 15:57:10] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:57:10] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:57:10] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 3/260 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/390 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 17 (OVERLAPS) 62/452 variables, 57/317 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/452 variables, 25/342 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/452 variables, 1/343 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 15:57:10] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:57:10] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:57:10] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:57:10] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/452 variables, 4/347 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/452 variables, 0/347 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/452 variables, 0/347 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 347 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1063 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 250/250 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 1432ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 487 ms.
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 202/202 transitions.
Graph (trivial) has 63 edges and 250 vertex of which 2 / 250 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 249 transition count 185
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 234 transition count 185
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 31 place count 234 transition count 156
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 65 rules applied. Total rules applied 96 place count 198 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 100 place count 194 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 194 transition count 152
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 141 place count 174 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 173 transition count 146
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 173 transition count 143
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 149 place count 170 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 169 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 151 place count 168 transition count 142
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 168 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 153 place count 167 transition count 141
Applied a total of 153 rules in 45 ms. Remains 167 /250 variables (removed 83) and now considering 141/202 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 167/250 places, 141/202 transitions.
RANDOM walk for 33252 steps (2550 resets) in 401 ms. (82 steps per ms) remains 0/3 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:57:11] [INFO ] Flatten gal took : 44 ms
[2024-05-21 15:57:11] [INFO ] Flatten gal took : 35 ms
[2024-05-21 15:57:11] [INFO ] Input system was already deterministic with 454 transitions.
Computed a total of 218 stabilizing places and 190 stable transitions
Graph (complete) has 1148 edges and 515 vertex of which 514 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 494 transition count 433
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 494 transition count 433
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 488 transition count 427
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 488 transition count 427
Applied a total of 54 rules in 25 ms. Remains 488 /515 variables (removed 27) and now considering 427/454 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 488/515 places, 427/454 transitions.
[2024-05-21 15:57:11] [INFO ] Flatten gal took : 18 ms
[2024-05-21 15:57:11] [INFO ] Flatten gal took : 19 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 493 transition count 432
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 493 transition count 432
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 486 transition count 425
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 486 transition count 425
Applied a total of 58 rules in 25 ms. Remains 486 /515 variables (removed 29) and now considering 425/454 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 486/515 places, 425/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 18 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 16 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 425 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Graph (trivial) has 246 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1142 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 508 transition count 380
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 442 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 441 transition count 379
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 136 place count 441 transition count 279
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 356 place count 321 transition count 279
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 373 place count 304 transition count 262
Iterating global reduction 3 with 17 rules applied. Total rules applied 390 place count 304 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 390 place count 304 transition count 261
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 392 place count 303 transition count 261
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 638 place count 178 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 639 place count 177 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 640 place count 176 transition count 139
Applied a total of 640 rules in 52 ms. Remains 176 /515 variables (removed 339) and now considering 139/454 (removed 315) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 176/515 places, 139/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Graph (trivial) has 252 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1142 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 508 transition count 378
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 440 transition count 378
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 138 place count 440 transition count 274
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 366 place count 316 transition count 274
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 387 place count 295 transition count 253
Iterating global reduction 2 with 21 rules applied. Total rules applied 408 place count 295 transition count 253
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 408 place count 295 transition count 251
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 412 place count 293 transition count 251
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 650 place count 172 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 651 place count 171 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 652 place count 170 transition count 133
Applied a total of 652 rules in 43 ms. Remains 170 /515 variables (removed 345) and now considering 133/454 (removed 321) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 170/515 places, 133/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 491 transition count 430
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 491 transition count 430
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 484 transition count 423
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 484 transition count 423
Applied a total of 62 rules in 23 ms. Remains 484 /515 variables (removed 31) and now considering 423/454 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 484/515 places, 423/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 495 transition count 434
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 495 transition count 434
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 491 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 491 transition count 430
Applied a total of 48 rules in 27 ms. Remains 491 /515 variables (removed 24) and now considering 430/454 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 491/515 places, 430/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Graph (trivial) has 251 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1142 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 508 transition count 377
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 439 transition count 377
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 140 place count 439 transition count 276
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 361 place count 319 transition count 276
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 382 place count 298 transition count 255
Iterating global reduction 2 with 21 rules applied. Total rules applied 403 place count 298 transition count 255
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 403 place count 298 transition count 253
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 407 place count 296 transition count 253
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 647 place count 174 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 648 place count 173 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 649 place count 172 transition count 134
Applied a total of 649 rules in 37 ms. Remains 172 /515 variables (removed 343) and now considering 134/454 (removed 320) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 172/515 places, 134/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Graph (trivial) has 252 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1142 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 508 transition count 378
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 440 transition count 378
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 138 place count 440 transition count 274
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 366 place count 316 transition count 274
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 387 place count 295 transition count 253
Iterating global reduction 2 with 21 rules applied. Total rules applied 408 place count 295 transition count 253
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 408 place count 295 transition count 251
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 412 place count 293 transition count 251
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 650 place count 172 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 651 place count 171 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 652 place count 170 transition count 133
Applied a total of 652 rules in 34 ms. Remains 170 /515 variables (removed 345) and now considering 133/454 (removed 321) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 170/515 places, 133/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Graph (trivial) has 238 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1142 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 508 transition count 383
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 445 transition count 383
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 128 place count 445 transition count 287
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 337 place count 332 transition count 287
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 355 place count 314 transition count 269
Iterating global reduction 2 with 18 rules applied. Total rules applied 373 place count 314 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 373 place count 314 transition count 268
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 375 place count 313 transition count 268
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 613 place count 192 transition count 151
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 619 place count 192 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 620 place count 191 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 621 place count 190 transition count 150
Applied a total of 621 rules in 39 ms. Remains 190 /515 variables (removed 325) and now considering 150/454 (removed 304) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 190/515 places, 150/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Graph (trivial) has 248 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1142 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 508 transition count 379
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 441 transition count 379
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 136 place count 441 transition count 277
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 359 place count 320 transition count 277
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 379 place count 300 transition count 257
Iterating global reduction 2 with 20 rules applied. Total rules applied 399 place count 300 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 399 place count 300 transition count 255
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 403 place count 298 transition count 255
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 635 place count 180 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 636 place count 179 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 637 place count 178 transition count 140
Applied a total of 637 rules in 39 ms. Remains 178 /515 variables (removed 337) and now considering 140/454 (removed 314) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 178/515 places, 140/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 493 transition count 432
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 493 transition count 432
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 486 transition count 425
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 486 transition count 425
Applied a total of 58 rules in 23 ms. Remains 486 /515 variables (removed 29) and now considering 425/454 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 486/515 places, 425/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 425 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 494 transition count 433
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 494 transition count 433
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 488 transition count 427
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 488 transition count 427
Applied a total of 54 rules in 28 ms. Remains 488 /515 variables (removed 27) and now considering 427/454 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 488/515 places, 427/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 491 transition count 430
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 491 transition count 430
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 484 transition count 423
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 484 transition count 423
Applied a total of 62 rules in 23 ms. Remains 484 /515 variables (removed 31) and now considering 423/454 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 484/515 places, 423/454 transitions.
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:57:12] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:57:12] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 454/454 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 491 transition count 430
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 491 transition count 430
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 484 transition count 423
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 484 transition count 423
Applied a total of 62 rules in 23 ms. Remains 484 /515 variables (removed 31) and now considering 423/454 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 484/515 places, 423/454 transitions.
[2024-05-21 15:57:13] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:57:13] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:57:13] [INFO ] Input system was already deterministic with 423 transitions.
[2024-05-21 15:57:13] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:57:13] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:57:13] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-21 15:57:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 515 places, 454 transitions and 1439 arcs took 3 ms.
Total runtime 78959 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-15

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 515
TRANSITIONS: 454
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.006s]


SAVING FILE /home/mcc/execution/419/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: 1557
MODEL NAME: /home/mcc/execution/419/model
515 places, 454 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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//
++ 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 CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="BusinessProcesses-PT-15"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 BusinessProcesses-PT-15, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398500562"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;