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.r472-tajo-171620399800593.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 ltsminxred
Input is BusinessProcesses-PT-19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800593
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 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 189K 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-19-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717226106160

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:15:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:15:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:15:07] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-01 07:15:07] [INFO ] Transformed 772 places.
[2024-06-01 07:15:07] [INFO ] Transformed 685 transitions.
[2024-06-01 07:15:07] [INFO ] Found NUPN structural information;
[2024-06-01 07:15:07] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
Support contains 110 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 750 transition count 670
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 92 place count 665 transition count 585
Iterating global reduction 1 with 85 rules applied. Total rules applied 177 place count 665 transition count 585
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 214 place count 628 transition count 548
Iterating global reduction 1 with 37 rules applied. Total rules applied 251 place count 628 transition count 548
Applied a total of 251 rules in 158 ms. Remains 628 /757 variables (removed 129) and now considering 548/670 (removed 122) transitions.
// Phase 1: matrix 548 rows 628 cols
[2024-06-01 07:15:08] [INFO ] Computed 118 invariants in 58 ms
[2024-06-01 07:15:08] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-06-01 07:15:08] [INFO ] Invariant cache hit.
[2024-06-01 07:15:09] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
Running 547 sub problems to find dead transitions.
[2024-06-01 07:15:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 2 (OVERLAPS) 2/628 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 125 places in 193 ms of which 28 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 124 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 123 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 143 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 127 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 127 places in 161 ms of which 6 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 4 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 123 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 136 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 133 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 5 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 107 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 120 places in 194 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 124 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 143 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 150 places in 168 ms of which 4 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 118 places in 176 ms of which 4 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 114 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 4 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 4 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 121 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 136 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 116 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 127 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 132 places in 175 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 547 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1176 variables, and 178 constraints, problems are : Problem set: 0 solved, 547 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/628 constraints, PredecessorRefiner: 547/547 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 547 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 2 (OVERLAPS) 2/628 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 60/178 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 122 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 122 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 123 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 120 places in 174 ms of which 4 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 126 places in 227 ms of which 5 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 133 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 124 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 125 places in 205 ms of which 5 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 4 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 117 places in 160 ms of which 6 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 121 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 128 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 134 places in 208 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 130 places in 213 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 119 places in 233 ms of which 4 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 127 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 130 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 123 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 123 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 124 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 123 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 141 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 134 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 4 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 122 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 127 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 133 places in 277 ms of which 7 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 124 places in 175 ms of which 4 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 7 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 135 places in 143 ms of which 5 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 124 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 118 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 124 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 119 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 144 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 117 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 123 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 123 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 139 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 114 places in 180 ms of which 4 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 119 places in 205 ms of which 4 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 115 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 136 places in 159 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 121 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 124 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 122 places in 131 ms of which 4 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 124 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 127 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 119 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 115 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 124 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 123 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 4 ms to minimize.
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/628 variables, 20/258 constraints. Problems are: Problem set: 6 solved, 541 unsolved
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 120 places in 166 ms of which 4 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 115 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 119 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 121 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 110 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 112 places in 181 ms of which 5 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 112 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 113 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 20/278 constraints. Problems are: Problem set: 6 solved, 541 unsolved
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 123 places in 208 ms of which 4 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 123 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 122 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 117 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 4 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 120 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 128 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 4 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 3 ms to minimize.
SMT process timed out in 60339ms, After SMT, problems are : Problem set: 6 solved, 541 unsolved
Search for dead transitions found 6 dead transitions in 60359ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 628/757 places, 542/670 transitions.
Applied a total of 0 rules in 11 ms. Remains 628 /628 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61956 ms. Remains : 628/757 places, 542/670 transitions.
Support contains 110 out of 628 places after structural reductions.
[2024-06-01 07:16:10] [INFO ] Flatten gal took : 97 ms
[2024-06-01 07:16:10] [INFO ] Flatten gal took : 32 ms
[2024-06-01 07:16:10] [INFO ] Input system was already deterministic with 542 transitions.
Support contains 90 out of 628 places (down from 110) after GAL structural reductions.
RANDOM walk for 40000 steps (221 resets) in 2394 ms. (16 steps per ms) remains 32/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
// Phase 1: matrix 542 rows 628 cols
[2024-06-01 07:16:11] [INFO ] Computed 118 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 275/325 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 188/513 variables, 50/74 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 100/613 variables, 43/118 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 532/1145 variables, 613/731 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1145 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 21/1166 variables, 11/742 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1166 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 4/1170 variables, 4/746 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1170 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/1170 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 746 constraints, problems are : Problem set: 0 solved, 32 unsolved in 3690 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 628/628 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 1 (OVERLAPS) 275/325 variables, 24/24 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 119 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 137 places in 115 ms of which 4 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 120 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 118 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 119 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 12/36 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 188/513 variables, 50/86 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 1/87 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
SMT process timed out in 8750ms, After SMT, problems are : Problem set: 2 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 542/542 transitions.
Graph (complete) has 1354 edges and 628 vertex of which 626 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 626 transition count 481
Reduce places removed 60 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 67 rules applied. Total rules applied 128 place count 566 transition count 474
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 135 place count 559 transition count 474
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 135 place count 559 transition count 362
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 376 place count 430 transition count 362
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 388 place count 418 transition count 350
Iterating global reduction 3 with 12 rules applied. Total rules applied 400 place count 418 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 400 place count 418 transition count 349
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 402 place count 417 transition count 349
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 403 place count 416 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 404 place count 416 transition count 348
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 716 place count 259 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 718 place count 258 transition count 195
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 720 place count 258 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 721 place count 257 transition count 194
Applied a total of 721 rules in 162 ms. Remains 257 /628 variables (removed 371) and now considering 194/542 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 257/628 places, 194/542 transitions.
RANDOM walk for 40000 steps (2710 resets) in 790 ms. (50 steps per ms) remains 20/30 properties
BEST_FIRST walk for 4003 steps (74 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (70 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (61 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (70 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (66 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (73 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (69 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (69 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (75 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (83 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (70 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (59 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (75 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (69 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (73 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (77 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (66 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (68 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (78 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (72 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
// Phase 1: matrix 194 rows 257 cols
[2024-06-01 07:16:21] [INFO ] Computed 98 invariants in 2 ms
[2024-06-01 07:16:21] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 76/106 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 31/137 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 9/146 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 45/191 variables, 26/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 7/198 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 192/390 variables, 198/269 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 60/450 variables, 58/329 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 26/355 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 1/451 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/451 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/451 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (OVERLAPS) 0/451 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 357 constraints, problems are : Problem set: 0 solved, 20 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 257/257 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 76/106 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 31/137 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 1 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 68 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 68 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 9/146 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 45/191 variables, 26/82 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/191 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 7/198 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/198 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 192/390 variables, 198/292 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/390 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/390 variables, 8/302 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/390 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/390 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (OVERLAPS) 60/450 variables, 58/361 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/450 variables, 26/387 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/450 variables, 12/399 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/450 variables, 8/407 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/450 variables, 5/412 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/450 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 29 (OVERLAPS) 1/451 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/451 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/451 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 32 (OVERLAPS) 0/451 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 414 constraints, problems are : Problem set: 0 solved, 20 unsolved in 6363 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 257/257 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 37/37 constraints]
After SMT, in 7346ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Finished Parikh walk after 113 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=113 )
Parikh walk visited 20 properties in 1271 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-01 07:16:29] [INFO ] Flatten gal took : 64 ms
[2024-06-01 07:16:29] [INFO ] Flatten gal took : 71 ms
[2024-06-01 07:16:29] [INFO ] Input system was already deterministic with 542 transitions.
Computed a total of 568 stabilizing places and 492 stable transitions
Graph (complete) has 1354 edges and 628 vertex of which 626 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.25 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Graph (trivial) has 315 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1347 edges and 622 vertex of which 620 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 620 transition count 452
Reduce places removed 82 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 83 rules applied. Total rules applied 167 place count 538 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 537 transition count 451
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 168 place count 537 transition count 325
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 277 rules applied. Total rules applied 445 place count 386 transition count 325
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 474 place count 357 transition count 296
Iterating global reduction 3 with 29 rules applied. Total rules applied 503 place count 357 transition count 296
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 503 place count 357 transition count 292
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 513 place count 351 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 514 place count 350 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 350 transition count 291
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 295 rules applied. Total rules applied 810 place count 201 transition count 145
Applied a total of 810 rules in 179 ms. Remains 201 /628 variables (removed 427) and now considering 145/542 (removed 397) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 179 ms. Remains : 201/628 places, 145/542 transitions.
[2024-06-01 07:16:30] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:16:30] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:16:30] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Graph (trivial) has 313 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1347 edges and 622 vertex of which 620 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 619 transition count 450
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 169 place count 536 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 535 transition count 449
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 123 Pre rules applied. Total rules applied 170 place count 535 transition count 326
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 440 place count 388 transition count 326
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 468 place count 360 transition count 298
Iterating global reduction 3 with 28 rules applied. Total rules applied 496 place count 360 transition count 298
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 496 place count 360 transition count 295
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 504 place count 355 transition count 295
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 505 place count 354 transition count 294
Iterating global reduction 3 with 1 rules applied. Total rules applied 506 place count 354 transition count 294
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 804 place count 204 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 806 place count 203 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 807 place count 202 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 808 place count 201 transition count 144
Applied a total of 808 rules in 153 ms. Remains 201 /628 variables (removed 427) and now considering 144/542 (removed 398) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 153 ms. Remains : 201/628 places, 144/542 transitions.
[2024-06-01 07:16:30] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:16:30] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:16:30] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Graph (trivial) has 315 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1347 edges and 622 vertex of which 620 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 619 transition count 449
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 170 place count 535 transition count 449
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 170 place count 535 transition count 325
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 442 place count 387 transition count 325
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 472 place count 357 transition count 295
Iterating global reduction 2 with 30 rules applied. Total rules applied 502 place count 357 transition count 295
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 502 place count 357 transition count 291
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 512 place count 351 transition count 291
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 513 place count 350 transition count 290
Iterating global reduction 2 with 1 rules applied. Total rules applied 514 place count 350 transition count 290
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 809 place count 201 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 811 place count 200 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 812 place count 199 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 813 place count 198 transition count 142
Applied a total of 813 rules in 134 ms. Remains 198 /628 variables (removed 430) and now considering 142/542 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 135 ms. Remains : 198/628 places, 142/542 transitions.
[2024-06-01 07:16:30] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:16:30] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:16:30] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 542
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 509
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 509
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 584 transition count 499
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 584 transition count 499
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 583 transition count 498
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 583 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 496
Applied a total of 93 rules in 220 ms. Remains 581 /628 variables (removed 47) and now considering 496/542 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 581/628 places, 496/542 transitions.
[2024-06-01 07:16:30] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:16:30] [INFO ] Flatten gal took : 26 ms
[2024-06-01 07:16:31] [INFO ] Input system was already deterministic with 496 transitions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 542
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 509
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 509
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 583 transition count 498
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 583 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 496
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 580 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 580 transition count 495
Applied a total of 95 rules in 124 ms. Remains 580 /628 variables (removed 48) and now considering 495/542 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 580/628 places, 495/542 transitions.
[2024-06-01 07:16:31] [INFO ] Flatten gal took : 31 ms
[2024-06-01 07:16:31] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:16:31] [INFO ] Input system was already deterministic with 495 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Graph (trivial) has 305 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1347 edges and 622 vertex of which 620 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 619 transition count 452
Reduce places removed 81 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 538 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 537 transition count 451
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 166 place count 537 transition count 331
Deduced a syphon composed of 120 places in 13 ms
Ensure Unique test removed 24 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 430 place count 393 transition count 331
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 456 place count 367 transition count 305
Iterating global reduction 3 with 26 rules applied. Total rules applied 482 place count 367 transition count 305
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 482 place count 367 transition count 301
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 492 place count 361 transition count 301
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 493 place count 360 transition count 300
Iterating global reduction 3 with 1 rules applied. Total rules applied 494 place count 360 transition count 300
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 293 rules applied. Total rules applied 787 place count 212 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 789 place count 211 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 790 place count 210 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 791 place count 209 transition count 153
Applied a total of 791 rules in 143 ms. Remains 209 /628 variables (removed 419) and now considering 153/542 (removed 389) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 143 ms. Remains : 209/628 places, 153/542 transitions.
[2024-06-01 07:16:31] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:16:31] [INFO ] Flatten gal took : 21 ms
[2024-06-01 07:16:31] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 542
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 595 transition count 510
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 595 transition count 510
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 75 place count 585 transition count 500
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 585 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 584 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 584 transition count 499
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 583 transition count 498
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 583 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 497
Applied a total of 91 rules in 126 ms. Remains 582 /628 variables (removed 46) and now considering 497/542 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 582/628 places, 497/542 transitions.
[2024-06-01 07:16:31] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:16:31] [INFO ] Flatten gal took : 41 ms
[2024-06-01 07:16:31] [INFO ] Input system was already deterministic with 497 transitions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 542
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 509
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 509
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 584 transition count 499
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 584 transition count 499
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 583 transition count 498
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 583 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 496
Applied a total of 93 rules in 117 ms. Remains 581 /628 variables (removed 47) and now considering 496/542 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 581/628 places, 496/542 transitions.
[2024-06-01 07:16:31] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:16:31] [INFO ] Flatten gal took : 29 ms
[2024-06-01 07:16:31] [INFO ] Input system was already deterministic with 496 transitions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 542
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 509
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 509
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 583 transition count 498
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 583 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 496
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 580 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 580 transition count 495
Applied a total of 95 rules in 102 ms. Remains 580 /628 variables (removed 48) and now considering 495/542 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 580/628 places, 495/542 transitions.
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:16:32] [INFO ] Input system was already deterministic with 495 transitions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 542
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 509
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 509
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 583 transition count 498
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 583 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 496
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 580 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 580 transition count 495
Applied a total of 95 rules in 115 ms. Remains 580 /628 variables (removed 48) and now considering 495/542 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 580/628 places, 495/542 transitions.
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:16:32] [INFO ] Input system was already deterministic with 495 transitions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 542
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 509
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 509
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 585 transition count 500
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 585 transition count 500
Applied a total of 85 rules in 45 ms. Remains 585 /628 variables (removed 43) and now considering 500/542 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 585/628 places, 500/542 transitions.
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 44 ms
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:16:32] [INFO ] Input system was already deterministic with 500 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Graph (trivial) has 315 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1347 edges and 622 vertex of which 621 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 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 620 transition count 451
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 538 transition count 451
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 166 place count 538 transition count 326
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 274 rules applied. Total rules applied 440 place count 389 transition count 326
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 470 place count 359 transition count 296
Iterating global reduction 2 with 30 rules applied. Total rules applied 500 place count 359 transition count 296
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 500 place count 359 transition count 292
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 510 place count 353 transition count 292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 511 place count 352 transition count 291
Iterating global reduction 2 with 1 rules applied. Total rules applied 512 place count 352 transition count 291
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 297 rules applied. Total rules applied 809 place count 202 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 811 place count 201 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 812 place count 200 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 813 place count 199 transition count 142
Applied a total of 813 rules in 48 ms. Remains 199 /628 variables (removed 429) and now considering 142/542 (removed 400) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 199/628 places, 142/542 transitions.
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:16:32] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 542
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 597 transition count 512
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 597 transition count 512
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 586 transition count 501
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 586 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 585 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 585 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 584 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 584 transition count 499
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 583 transition count 498
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 583 transition count 498
Applied a total of 89 rules in 67 ms. Remains 583 /628 variables (removed 45) and now considering 498/542 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 583/628 places, 498/542 transitions.
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:16:32] [INFO ] Input system was already deterministic with 498 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Graph (trivial) has 315 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1347 edges and 622 vertex of which 620 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 619 transition count 449
Reduce places removed 84 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 171 place count 535 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 534 transition count 448
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 172 place count 534 transition count 324
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 444 place count 386 transition count 324
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 474 place count 356 transition count 294
Iterating global reduction 3 with 30 rules applied. Total rules applied 504 place count 356 transition count 294
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 504 place count 356 transition count 290
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 514 place count 350 transition count 290
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 515 place count 349 transition count 289
Iterating global reduction 3 with 1 rules applied. Total rules applied 516 place count 349 transition count 289
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 291 rules applied. Total rules applied 807 place count 202 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 809 place count 201 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 810 place count 200 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 811 place count 199 transition count 143
Applied a total of 811 rules in 56 ms. Remains 199 /628 variables (removed 429) and now considering 143/542 (removed 399) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 199/628 places, 143/542 transitions.
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:16:32] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:16:32] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 542
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 597 transition count 512
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 597 transition count 512
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 588 transition count 503
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 588 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 587 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 587 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 586 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 586 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 585 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 585 transition count 500
Applied a total of 85 rules in 80 ms. Remains 585 /628 variables (removed 43) and now considering 500/542 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 585/628 places, 500/542 transitions.
[2024-06-01 07:16:33] [INFO ] Flatten gal took : 29 ms
[2024-06-01 07:16:33] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:16:33] [INFO ] Input system was already deterministic with 500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 542/542 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 542
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 593 transition count 508
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 593 transition count 508
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 80 place count 582 transition count 497
Iterating global reduction 1 with 11 rules applied. Total rules applied 91 place count 582 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 496
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 580 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 580 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 579 transition count 494
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 579 transition count 494
Applied a total of 97 rules in 103 ms. Remains 579 /628 variables (removed 49) and now considering 494/542 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 579/628 places, 494/542 transitions.
[2024-06-01 07:16:33] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:16:33] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:16:33] [INFO ] Input system was already deterministic with 494 transitions.
[2024-06-01 07:16:33] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:16:33] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:16:33] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 07:16:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 628 places, 542 transitions and 1664 arcs took 4 ms.
Total runtime 85742 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-01
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-02
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-05
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-06
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-07
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-08
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2024-11
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2023-12
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2023-13
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2023-14
Could not compute solution for formula : BusinessProcesses-PT-19-CTLCardinality-2023-15

BK_STOP 1717226193699

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1259/ctl_0_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1259/ctl_1_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1259/ctl_2_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1259/ctl_3_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1259/ctl_4_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1259/ctl_5_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1259/ctl_6_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1259/ctl_7_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1259/ctl_8_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1259/ctl_9_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1259/ctl_10_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1259/ctl_11_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1259/ctl_12_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1259/ctl_13_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1259/ctl_14_
ctl formula name BusinessProcesses-PT-19-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1259/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-19"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-19, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800593"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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