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-171620399800572.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-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 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 159K 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-16-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717225978367

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:13:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:13:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:13:00] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-06-01 07:13:00] [INFO ] Transformed 638 places.
[2024-06-01 07:13:00] [INFO ] Transformed 578 transitions.
[2024-06-01 07:13:00] [INFO ] Found NUPN structural information;
[2024-06-01 07:13:00] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 381 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 8 places in 30 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 99 place count 531 transition count 476
Iterating global reduction 1 with 94 rules applied. Total rules applied 193 place count 531 transition count 476
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 243 place count 481 transition count 426
Iterating global reduction 1 with 50 rules applied. Total rules applied 293 place count 481 transition count 426
Applied a total of 293 rules in 225 ms. Remains 481 /630 variables (removed 149) and now considering 426/570 (removed 144) transitions.
// Phase 1: matrix 426 rows 481 cols
[2024-06-01 07:13:01] [INFO ] Computed 95 invariants in 42 ms
[2024-06-01 07:13:01] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-06-01 07:13:01] [INFO ] Invariant cache hit.
[2024-06-01 07:13:02] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 07:13:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 1/481 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 86 places in 579 ms of which 51 ms to minimize.
[2024-06-01 07:13:13] [INFO ] Deduced a trap composed of 98 places in 288 ms of which 4 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 91 places in 280 ms of which 2 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 101 places in 281 ms of which 21 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 93 places in 273 ms of which 2 ms to minimize.
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 89 places in 169 ms of which 27 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 15 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 87 places in 247 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:13:15] [INFO ] Deduced a trap composed of 92 places in 222 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 85 places in 332 ms of which 3 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 91 places in 246 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 91 places in 214 ms of which 2 ms to minimize.
[2024-06-01 07:13:16] [INFO ] Deduced a trap composed of 89 places in 169 ms of which 5 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 89 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 86 places in 251 ms of which 3 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:13:17] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:13:18] [INFO ] Deduced a trap composed of 104 places in 212 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 97 places in 267 ms of which 4 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 15 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 86 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 85 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 84 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 6 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 80 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 103 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 97 places in 191 ms of which 2 ms to minimize.
[2024-06-01 07:13:23] [INFO ] Deduced a trap composed of 103 places in 176 ms of which 2 ms to minimize.
[2024-06-01 07:13:24] [INFO ] Deduced a trap composed of 92 places in 517 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 78 places in 1248 ms of which 3 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 101 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:13:25] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 11 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 100 places in 212 ms of which 5 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 84 places in 166 ms of which 4 ms to minimize.
[2024-06-01 07:13:26] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 89 places in 180 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 102 places in 193 ms of which 2 ms to minimize.
[2024-06-01 07:13:27] [INFO ] Deduced a trap composed of 89 places in 289 ms of which 6 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 87 places in 219 ms of which 5 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 86 places in 255 ms of which 6 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:13:28] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:29] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 93 places in 192 ms of which 5 ms to minimize.
[2024-06-01 07:13:30] [INFO ] Deduced a trap composed of 88 places in 218 ms of which 5 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 94 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:13:31] [INFO ] Deduced a trap composed of 91 places in 186 ms of which 9 ms to minimize.
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/155 constraints. Problems are: Problem set: 4 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/907 variables, and 155 constraints, problems are : Problem set: 4 solved, 421 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/481 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 4 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 37/37 constraints. Problems are: Problem set: 4 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/37 constraints. Problems are: Problem set: 4 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 1/481 variables, 56/93 constraints. Problems are: Problem set: 4 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/95 constraints. Problems are: Problem set: 4 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 60/155 constraints. Problems are: Problem set: 4 solved, 421 unsolved
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 84 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 103 places in 174 ms of which 5 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 99 places in 180 ms of which 6 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 4 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 80 places in 180 ms of which 5 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 4 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 4 ms to minimize.
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/175 constraints. Problems are: Problem set: 13 solved, 412 unsolved
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 98 places in 178 ms of which 5 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 95 places in 198 ms of which 4 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 87 places in 174 ms of which 5 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:13:42] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 99 places in 204 ms of which 4 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:13:43] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 5 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 5 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 5 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/195 constraints. Problems are: Problem set: 13 solved, 412 unsolved
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 134 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 20/215 constraints. Problems are: Problem set: 16 solved, 409 unsolved
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 7 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 108 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 105 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 20/235 constraints. Problems are: Problem set: 16 solved, 409 unsolved
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 105 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 99 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 87 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 88 places in 252 ms of which 7 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 89 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 101 places in 186 ms of which 3 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 20/255 constraints. Problems are: Problem set: 20 solved, 405 unsolved
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 92 places in 202 ms of which 6 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 89 places in 170 ms of which 7 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 84 places in 194 ms of which 5 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 90 places in 197 ms of which 6 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 81 places in 224 ms of which 5 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 82 places in 256 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 81 places in 212 ms of which 6 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 66 places in 245 ms of which 6 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 6 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 62 places in 379 ms of which 4 ms to minimize.
SMT process timed out in 60612ms, After SMT, problems are : Problem set: 20 solved, 405 unsolved
Search for dead transitions found 20 dead transitions in 60644ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 481/630 places, 406/570 transitions.
Applied a total of 0 rules in 19 ms. Remains 481 /481 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62372 ms. Remains : 481/630 places, 406/570 transitions.
Support contains 36 out of 481 places after structural reductions.
[2024-06-01 07:14:03] [INFO ] Flatten gal took : 85 ms
[2024-06-01 07:14:03] [INFO ] Flatten gal took : 36 ms
[2024-06-01 07:14:03] [INFO ] Input system was already deterministic with 406 transitions.
Support contains 33 out of 481 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (269 resets) in 1720 ms. (23 steps per ms) remains 12/26 properties
BEST_FIRST walk for 40003 steps (46 resets) in 263 ms. (151 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (57 resets) in 226 ms. (176 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (48 resets) in 259 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (46 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (48 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (33 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 96 ms. (412 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 54 ms. (727 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 59 ms. (666 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (46 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 106 ms. (373 steps per ms) remains 10/11 properties
// Phase 1: matrix 406 rows 481 cols
[2024-06-01 07:14:05] [INFO ] Computed 95 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 256/273 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 75 places in 186 ms of which 1 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 84/357 variables, 23/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 112/469 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 87 places in 193 ms of which 12 ms to minimize.
SMT process timed out in 5055ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 406/406 transitions.
Graph (complete) has 1051 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 480 transition count 358
Reduce places removed 47 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 52 rules applied. Total rules applied 100 place count 433 transition count 353
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 105 place count 428 transition count 353
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 105 place count 428 transition count 259
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 308 place count 319 transition count 259
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 312 place count 315 transition count 255
Iterating global reduction 3 with 4 rules applied. Total rules applied 316 place count 315 transition count 255
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 316 place count 315 transition count 254
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 318 place count 314 transition count 254
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 571 place count 185 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 572 place count 185 transition count 129
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 573 place count 185 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 574 place count 184 transition count 128
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 582 place count 184 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 583 place count 183 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 584 place count 182 transition count 127
Applied a total of 584 rules in 153 ms. Remains 182 /481 variables (removed 299) and now considering 127/406 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 182/481 places, 127/406 transitions.
RANDOM walk for 40000 steps (3431 resets) in 1428 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1041 resets) in 171 ms. (232 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (1285 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1038 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (963 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1030 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1027 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1021 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1002 resets) in 104 ms. (380 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (1049 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
// Phase 1: matrix 127 rows 182 cols
[2024-06-01 07:14:11] [INFO ] Computed 74 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 59/74 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/76 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 70/146 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
Problem AtomicPropp24 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 10/75 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 24/170 variables, 22/97 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 7/177 variables, 6/103 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 127/304 variables, 177/280 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 5/309 variables, 5/285 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 1/286 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/309 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 286 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3596 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 60/72 variables, 30/30 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/74 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 71/145 variables, 13/44 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 28/72 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 3 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 3 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 20/92 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 5/97 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 24/169 variables, 22/120 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 8/177 variables, 7/127 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 2/129 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 127/304 variables, 177/306 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/304 variables, 5/311 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/304 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 5/309 variables, 5/316 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 1/317 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/309 variables, 2/319 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/309 variables, 2/321 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/309 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 0/309 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 321 constraints, problems are : Problem set: 1 solved, 7 unsolved in 3624 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 58/58 constraints]
After SMT, in 7234ms problems are : Problem set: 1 solved, 7 unsolved
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 623 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 130 stabilizing places and 123 stable transitions
Graph (complete) has 1051 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Graph (trivial) has 225 edges and 481 vertex of which 6 / 481 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 474 transition count 347
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 423 transition count 347
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 104 place count 423 transition count 246
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 323 place count 305 transition count 246
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 330 place count 298 transition count 239
Iterating global reduction 2 with 7 rules applied. Total rules applied 337 place count 298 transition count 239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 337 place count 298 transition count 238
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 339 place count 297 transition count 238
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 588 place count 170 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 590 place count 169 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 591 place count 168 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 592 place count 167 transition count 119
Applied a total of 592 rules in 114 ms. Remains 167 /481 variables (removed 314) and now considering 119/406 (removed 287) transitions.
// Phase 1: matrix 119 rows 167 cols
[2024-06-01 07:14:19] [INFO ] Computed 72 invariants in 2 ms
[2024-06-01 07:14:24] [INFO ] Implicit Places using invariants in 4843 ms returned []
[2024-06-01 07:14:24] [INFO ] Invariant cache hit.
[2024-06-01 07:14:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:14:24] [INFO ] Implicit Places using invariants and state equation in 314 ms returned [38, 42, 46, 55, 57, 59, 61, 62, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 87, 89, 91, 93, 95, 97, 99, 101, 109, 111, 113, 115, 117, 138, 149, 151, 153, 157]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 5165 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/481 places, 119/406 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 130 transition count 110
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 121 transition count 110
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 115 transition count 102
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 115 transition count 102
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 115 transition count 99
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 36 place count 112 transition count 99
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 56 place count 101 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 99 transition count 88
Applied a total of 60 rules in 35 ms. Remains 99 /130 variables (removed 31) and now considering 88/119 (removed 31) transitions.
// Phase 1: matrix 88 rows 99 cols
[2024-06-01 07:14:24] [INFO ] Computed 35 invariants in 1 ms
[2024-06-01 07:14:24] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 07:14:24] [INFO ] Invariant cache hit.
[2024-06-01 07:14:25] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-01 07:14:25] [INFO ] Implicit Places using invariants and state equation in 243 ms returned [4, 5, 6, 7, 9, 10, 11, 13, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 45, 46, 47]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 337 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/481 places, 88/406 transitions.
Graph (complete) has 269 edges and 78 vertex of which 69 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 67 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 67 transition count 78
Applied a total of 5 rules in 7 ms. Remains 67 /78 variables (removed 11) and now considering 78/88 (removed 10) transitions.
// Phase 1: matrix 78 rows 67 cols
[2024-06-01 07:14:25] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 07:14:25] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 07:14:25] [INFO ] Invariant cache hit.
[2024-06-01 07:14:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:14:25] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 230 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 66/481 places, 78/406 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 5894 ms. Remains : 66/481 places, 78/406 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-00
Stuttering criterion allowed to conclude after 60 steps with 10 reset in 3 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-00 finished in 6271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&(p1 U p2)))||G(p3)))'
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 474 transition count 399
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 474 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 473 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 473 transition count 398
Applied a total of 16 rules in 53 ms. Remains 473 /481 variables (removed 8) and now considering 398/406 (removed 8) transitions.
// Phase 1: matrix 398 rows 473 cols
[2024-06-01 07:14:25] [INFO ] Computed 95 invariants in 5 ms
[2024-06-01 07:14:26] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-06-01 07:14:26] [INFO ] Invariant cache hit.
[2024-06-01 07:14:26] [INFO ] Implicit Places using invariants and state equation in 553 ms returned [426]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 845 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 472/481 places, 398/406 transitions.
Applied a total of 0 rules in 11 ms. Remains 472 /472 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 909 ms. Remains : 472/481 places, 398/406 transitions.
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p2), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-02
Entered a terminal (fully accepting) state of product in 98 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-02 finished in 1241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Graph (trivial) has 225 edges and 481 vertex of which 6 / 481 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 474 transition count 346
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 422 transition count 345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 421 transition count 345
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 108 place count 421 transition count 246
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 322 place count 306 transition count 246
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 329 place count 299 transition count 239
Iterating global reduction 3 with 7 rules applied. Total rules applied 336 place count 299 transition count 239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 336 place count 299 transition count 238
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 338 place count 298 transition count 238
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 589 place count 170 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 591 place count 169 transition count 119
Applied a total of 591 rules in 67 ms. Remains 169 /481 variables (removed 312) and now considering 119/406 (removed 287) transitions.
// Phase 1: matrix 119 rows 169 cols
[2024-06-01 07:14:27] [INFO ] Computed 74 invariants in 1 ms
[2024-06-01 07:14:27] [INFO ] Implicit Places using invariants in 207 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 21, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 132]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 210 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/481 places, 119/406 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 284 ms. Remains : 148/481 places, 119/406 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-03 finished in 368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U (p1||(p0&&G(p2))))))'
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Graph (trivial) has 222 edges and 481 vertex of which 6 / 481 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 474 transition count 348
Reduce places removed 50 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 424 transition count 346
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 422 transition count 346
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 106 place count 422 transition count 248
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 318 place count 308 transition count 248
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 324 place count 302 transition count 242
Iterating global reduction 3 with 6 rules applied. Total rules applied 330 place count 302 transition count 242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 330 place count 302 transition count 241
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 332 place count 301 transition count 241
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 587 place count 171 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 589 place count 170 transition count 120
Applied a total of 589 rules in 74 ms. Remains 170 /481 variables (removed 311) and now considering 120/406 (removed 286) transitions.
// Phase 1: matrix 120 rows 170 cols
[2024-06-01 07:14:27] [INFO ] Computed 74 invariants in 2 ms
[2024-06-01 07:14:27] [INFO ] Implicit Places using invariants in 152 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 25, 48, 51, 52, 53, 54, 143]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 156 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/481 places, 120/406 transitions.
Applied a total of 0 rules in 23 ms. Remains 150 /150 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 256 ms. Remains : 150/481 places, 120/406 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-04 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 473 transition count 398
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 473 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 471 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 471 transition count 396
Applied a total of 20 rules in 20 ms. Remains 471 /481 variables (removed 10) and now considering 396/406 (removed 10) transitions.
// Phase 1: matrix 396 rows 471 cols
[2024-06-01 07:14:27] [INFO ] Computed 95 invariants in 11 ms
[2024-06-01 07:14:28] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-01 07:14:28] [INFO ] Invariant cache hit.
[2024-06-01 07:14:28] [INFO ] Implicit Places using invariants and state equation in 672 ms returned [424]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 943 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 470/481 places, 396/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 470 /470 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 973 ms. Remains : 470/481 places, 396/406 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-05 finished in 1133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0))) U G(p1))))'
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 474 transition count 399
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 474 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 472 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 472 transition count 397
Applied a total of 18 rules in 40 ms. Remains 472 /481 variables (removed 9) and now considering 397/406 (removed 9) transitions.
// Phase 1: matrix 397 rows 472 cols
[2024-06-01 07:14:29] [INFO ] Computed 95 invariants in 3 ms
[2024-06-01 07:14:29] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-01 07:14:29] [INFO ] Invariant cache hit.
[2024-06-01 07:14:30] [INFO ] Implicit Places using invariants and state equation in 966 ms returned [425]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1217 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 471/481 places, 397/406 transitions.
Applied a total of 0 rules in 17 ms. Remains 471 /471 variables (removed 0) and now considering 397/397 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1274 ms. Remains : 471/481 places, 397/406 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-06
Product exploration explored 100000 steps with 832 reset in 360 ms.
Stack based approach found an accepted trace after 1344 steps with 11 reset with depth 10 and stack size 10 in 25 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-06 finished in 1988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))&&G(p1))))))'
Support contains 4 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 473 transition count 398
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 473 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 471 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 471 transition count 396
Applied a total of 20 rules in 51 ms. Remains 471 /481 variables (removed 10) and now considering 396/406 (removed 10) transitions.
// Phase 1: matrix 396 rows 471 cols
[2024-06-01 07:14:31] [INFO ] Computed 95 invariants in 4 ms
[2024-06-01 07:14:31] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-06-01 07:14:31] [INFO ] Invariant cache hit.
[2024-06-01 07:14:31] [INFO ] Implicit Places using invariants and state equation in 500 ms returned [424]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 816 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 470/481 places, 396/406 transitions.
Applied a total of 0 rules in 8 ms. Remains 470 /470 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 889 ms. Remains : 470/481 places, 396/406 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-07
Product exploration explored 100000 steps with 665 reset in 327 ms.
Product exploration explored 100000 steps with 664 reset in 278 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1036 edges and 470 vertex of which 469 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 40000 steps (266 resets) in 453 ms. (88 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
// Phase 1: matrix 396 rows 470 cols
[2024-06-01 07:14:33] [INFO ] Computed 94 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 263/312 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 133/445 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/461 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 390/851 variables, 461/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/851 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/864 variables, 7/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/864 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/866 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/866 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/866 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 866/866 variables, and 570 constraints, problems are : Problem set: 0 solved, 1 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 263/312 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 133/445 variables, 28/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/461 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/461 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 390/851 variables, 461/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/851 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/851 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 13/864 variables, 7/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/864 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/864 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/864 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/866 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/866 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/866 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 866/866 variables, and 587 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2350 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 3333ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 123 ms.
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 396/396 transitions.
Graph (complete) has 1036 edges and 470 vertex of which 469 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 469 transition count 348
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 422 transition count 346
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 420 transition count 346
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 99 place count 420 transition count 245
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 318 place count 302 transition count 245
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 267 rules applied. Total rules applied 585 place count 166 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 586 place count 166 transition count 113
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 587 place count 166 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 588 place count 165 transition count 112
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 594 place count 165 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 595 place count 164 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 596 place count 163 transition count 111
Applied a total of 596 rules in 67 ms. Remains 163 /470 variables (removed 307) and now considering 111/396 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 163/470 places, 111/396 transitions.
RANDOM walk for 40000 steps (4456 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1941 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 831 steps, run visited all 1 properties in 12 ms. (steps per millisecond=69 )
Probabilistic random walk after 831 steps, saw 425 distinct states, run finished after 29 ms. (steps per millisecond=28 ) properties seen :1
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 396/396 transitions.
Applied a total of 0 rules in 10 ms. Remains 470 /470 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2024-06-01 07:14:38] [INFO ] Invariant cache hit.
[2024-06-01 07:14:38] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 07:14:38] [INFO ] Invariant cache hit.
[2024-06-01 07:14:38] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-06-01 07:14:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 55/91 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 85 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 5 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 5 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 92 places in 185 ms of which 6 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 7 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/114 constraints. Problems are: Problem set: 5 solved, 390 unsolved
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 5 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 6 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 5 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 6 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 5 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD339 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/134 constraints. Problems are: Problem set: 8 solved, 387 unsolved
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 5 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 5 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 5 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 5 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 12 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 5 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 5 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 86 places in 188 ms of which 3 ms to minimize.
Problem TDEAD311 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/154 constraints. Problems are: Problem set: 10 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/866 variables, and 154 constraints, problems are : Problem set: 10 solved, 385 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 10 solved, 385 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 36/36 constraints. Problems are: Problem set: 10 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/36 constraints. Problems are: Problem set: 10 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 55/91 constraints. Problems are: Problem set: 10 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 3/94 constraints. Problems are: Problem set: 10 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 60/154 constraints. Problems are: Problem set: 10 solved, 385 unsolved
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 81 places in 221 ms of which 5 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 88 places in 184 ms of which 7 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 5 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/174 constraints. Problems are: Problem set: 10 solved, 385 unsolved
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 84 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 99 places in 164 ms of which 6 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 6 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 99 places in 167 ms of which 8 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 62 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 5 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 4 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 2 ms to minimize.
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/194 constraints. Problems are: Problem set: 13 solved, 382 unsolved
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 5 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 4 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 5 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:15:22] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/214 constraints. Problems are: Problem set: 13 solved, 382 unsolved
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 80 places in 175 ms of which 6 ms to minimize.
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:15:23] [INFO ] Deduced a trap composed of 80 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 77 places in 181 ms of which 2 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 4 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:15:24] [INFO ] Deduced a trap composed of 81 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 80 places in 169 ms of which 13 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 78 places in 226 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 80 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:15:25] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:15:26] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 20/234 constraints. Problems are: Problem set: 13 solved, 382 unsolved
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:15:27] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:15:28] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 20/254 constraints. Problems are: Problem set: 13 solved, 382 unsolved
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 20/274 constraints. Problems are: Problem set: 13 solved, 382 unsolved
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 20/294 constraints. Problems are: Problem set: 13 solved, 382 unsolved
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 123 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/866 variables, and 297 constraints, problems are : Problem set: 13 solved, 382 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 0/395 constraints, Known Traps: 203/203 constraints]
After SMT, in 60218ms problems are : Problem set: 13 solved, 382 unsolved
Search for dead transitions found 13 dead transitions in 60228ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in LTL mode, iteration 1 : 470/470 places, 383/396 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 383
Applied a total of 2 rules in 8 ms. Remains 468 /470 variables (removed 2) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 468 cols
[2024-06-01 07:15:39] [INFO ] Computed 98 invariants in 8 ms
[2024-06-01 07:15:39] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 07:15:39] [INFO ] Invariant cache hit.
[2024-06-01 07:15:39] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 468/470 places, 383/396 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61762 ms. Remains : 468/470 places, 383/396 transitions.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1000 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 40000 steps (266 resets) in 223 ms. (178 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (34 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-06-01 07:15:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 260/309 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 121/430 variables, 29/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/459 variables, 15/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 377/836 variables, 459/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/836 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/836 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/849 variables, 7/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/849 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/849 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/851 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/851 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/851 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 570 constraints, problems are : Problem set: 0 solved, 1 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 468/468 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 260/309 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 121/430 variables, 29/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 29/459 variables, 15/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 377/836 variables, 459/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/836 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/836 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/849 variables, 7/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/849 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/849 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/849 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/849 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/851 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/851 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/851 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 583 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 468/468 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 2087ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14759 steps, including 99 resets, run visited all 1 properties in 84 ms. (steps per millisecond=175 )
Parikh walk visited 1 properties in 85 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Product exploration explored 100000 steps with 664 reset in 249 ms.
Product exploration explored 100000 steps with 669 reset in 324 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 383/383 transitions.
Graph (complete) has 1000 edges and 468 vertex of which 467 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
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 467 transition count 382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 48 place count 467 transition count 435
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 120 place count 467 transition count 435
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 134 place count 453 transition count 409
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 148 place count 453 transition count 409
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 262 places in 0 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 305 place count 453 transition count 409
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 342 place count 416 transition count 372
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 379 place count 416 transition count 372
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 381 place count 416 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 382 place count 416 transition count 375
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 384 place count 414 transition count 371
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 386 place count 414 transition count 371
Deduced a syphon composed of 225 places in 0 ms
Applied a total of 386 rules in 163 ms. Remains 414 /468 variables (removed 54) and now considering 371/383 (removed 12) transitions.
[2024-06-01 07:15:44] [INFO ] Redundant transitions in 24 ms returned []
Running 370 sub problems to find dead transitions.
// Phase 1: matrix 371 rows 414 cols
[2024-06-01 07:15:44] [INFO ] Computed 98 invariants in 5 ms
[2024-06-01 07:15:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/414 variables, 55/95 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 6 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 6 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 22 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 2 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 18 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 39 places in 6215 ms of which 29 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 20/118 constraints. Problems are: Problem set: 129 solved, 241 unsolved
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 20/138 constraints. Problems are: Problem set: 199 solved, 171 unsolved
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD313 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 20/158 constraints. Problems are: Problem set: 243 solved, 127 unsolved
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 2 ms to minimize.
Problem TDEAD127 is UNSAT
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 2 ms to minimize.
Problem TDEAD133 is UNSAT
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD282 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 20/178 constraints. Problems are: Problem set: 256 solved, 114 unsolved
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
Problem TDEAD141 is UNSAT
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD201 is UNSAT
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD210 is UNSAT
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD212 is UNSAT
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 6 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 2 ms to minimize.
Problem TDEAD299 is UNSAT
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 11/189 constraints. Problems are: Problem set: 261 solved, 109 unsolved
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 41 places in 2674 ms of which 4 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 5 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 5 ms to minimize.
SMT process timed out in 30359ms, After SMT, problems are : Problem set: 261 solved, 109 unsolved
Search for dead transitions found 261 dead transitions in 30369ms
Found 261 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 261 transitions
Dead transitions reduction (with SMT) removed 261 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 414/468 places, 110/383 transitions.
Graph (complete) has 739 edges and 414 vertex of which 196 are kept as prefixes of interest. Removing 218 places using SCC suffix rule.3 ms
Discarding 218 places :
Also discarding 0 output transitions
Ensure Unique test removed 28 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 116
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 2 rules in 20 ms. Remains 168 /414 variables (removed 246) and now considering 116/110 (removed -6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 168/468 places, 116/383 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30613 ms. Remains : 168/468 places, 116/383 transitions.
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 383/383 transitions.
Applied a total of 0 rules in 18 ms. Remains 468 /468 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 468 cols
[2024-06-01 07:16:14] [INFO ] Computed 98 invariants in 3 ms
[2024-06-01 07:16:15] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-01 07:16:15] [INFO ] Invariant cache hit.
[2024-06-01 07:16:15] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-06-01 07:16:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 54/94 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 94 places in 178 ms of which 5 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 5 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 101 places in 194 ms of which 5 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 83 places in 196 ms of which 5 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 4 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 4 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 5 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 83 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 94 places in 260 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 81 places in 201 ms of which 5 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 5 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 4 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 101 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 12 places in 5128 ms of which 4 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 84 places in 186 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/851 variables, and 164 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 54/94 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 66/164 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 79 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 89 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 82 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 7 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 96 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 6 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 5 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 81 places in 220 ms of which 3 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 4 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 92 places in 182 ms of which 6 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 5 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 63 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 7 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 4 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 6 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
SMT process timed out in 60205ms, After SMT, problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Finished structural reductions in LTL mode , in 1 iterations and 60946 ms. Remains : 468/468 places, 383/383 transitions.
Treatment of property BusinessProcesses-PT-16-LTLFireability-07 finished in 164817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Graph (trivial) has 223 edges and 481 vertex of which 6 / 481 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 476 vertex of which 475 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 474 transition count 346
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 422 transition count 346
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 106 place count 422 transition count 247
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 321 place count 306 transition count 247
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 326 place count 301 transition count 242
Iterating global reduction 2 with 5 rules applied. Total rules applied 331 place count 301 transition count 242
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 590 place count 169 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 592 place count 168 transition count 119
Applied a total of 592 rules in 44 ms. Remains 168 /481 variables (removed 313) and now considering 119/406 (removed 287) transitions.
// Phase 1: matrix 119 rows 168 cols
[2024-06-01 07:17:15] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 07:17:16] [INFO ] Implicit Places using invariants in 130 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 133 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/481 places, 119/406 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 148/481 places, 119/406 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-08 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 473 transition count 398
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 473 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 471 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 471 transition count 396
Applied a total of 20 rules in 24 ms. Remains 471 /481 variables (removed 10) and now considering 396/406 (removed 10) transitions.
// Phase 1: matrix 396 rows 471 cols
[2024-06-01 07:17:16] [INFO ] Computed 95 invariants in 3 ms
[2024-06-01 07:17:16] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 07:17:16] [INFO ] Invariant cache hit.
[2024-06-01 07:17:16] [INFO ] Implicit Places using invariants and state equation in 463 ms returned [424]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 644 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 470/481 places, 396/406 transitions.
Applied a total of 0 rules in 7 ms. Remains 470 /470 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 675 ms. Remains : 470/481 places, 396/406 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-09 finished in 811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Graph (trivial) has 225 edges and 481 vertex of which 6 / 481 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1045 edges and 476 vertex of which 475 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 474 transition count 346
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 422 transition count 346
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 106 place count 422 transition count 246
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 323 place count 305 transition count 246
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 330 place count 298 transition count 239
Iterating global reduction 2 with 7 rules applied. Total rules applied 337 place count 298 transition count 239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 337 place count 298 transition count 238
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 339 place count 297 transition count 238
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 594 place count 167 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 596 place count 166 transition count 117
Applied a total of 596 rules in 47 ms. Remains 166 /481 variables (removed 315) and now considering 117/406 (removed 289) transitions.
// Phase 1: matrix 117 rows 166 cols
[2024-06-01 07:17:17] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 07:17:17] [INFO ] Implicit Places using invariants in 150 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 151 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/481 places, 117/406 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 201 ms. Remains : 146/481 places, 117/406 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-11 finished in 311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))&&((p1&&X(F(p2))) U ((X(F(p2))&&p3)||G((p1&&F(p2))))))))'
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 474 transition count 399
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 474 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 473 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 473 transition count 398
Applied a total of 16 rules in 55 ms. Remains 473 /481 variables (removed 8) and now considering 398/406 (removed 8) transitions.
// Phase 1: matrix 398 rows 473 cols
[2024-06-01 07:17:17] [INFO ] Computed 95 invariants in 3 ms
[2024-06-01 07:17:17] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 07:17:17] [INFO ] Invariant cache hit.
[2024-06-01 07:17:18] [INFO ] Implicit Places using invariants and state equation in 505 ms returned [424]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 743 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 472/481 places, 398/406 transitions.
Applied a total of 0 rules in 10 ms. Remains 472 /472 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 809 ms. Remains : 472/481 places, 398/406 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p2), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 105 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-13 finished in 1191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 474 transition count 399
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 474 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 472 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 472 transition count 397
Applied a total of 18 rules in 42 ms. Remains 472 /481 variables (removed 9) and now considering 397/406 (removed 9) transitions.
// Phase 1: matrix 397 rows 472 cols
[2024-06-01 07:17:18] [INFO ] Computed 95 invariants in 5 ms
[2024-06-01 07:17:18] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-01 07:17:18] [INFO ] Invariant cache hit.
[2024-06-01 07:17:19] [INFO ] Implicit Places using invariants and state equation in 671 ms returned [425]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 920 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 471/481 places, 397/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 471 /471 variables (removed 0) and now considering 397/397 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 973 ms. Remains : 471/481 places, 397/406 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-14 finished in 1087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))&&G(p1))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-16-LTLFireability-07
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 481 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 481/481 places, 406/406 transitions.
Graph (complete) has 1051 edges and 481 vertex of which 480 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 479 transition count 353
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 428 transition count 351
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 426 transition count 351
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 107 place count 426 transition count 250
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 326 place count 308 transition count 250
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 333 place count 301 transition count 243
Iterating global reduction 3 with 7 rules applied. Total rules applied 340 place count 301 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 340 place count 301 transition count 242
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 342 place count 300 transition count 242
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 599 place count 169 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 600 place count 169 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 601 place count 168 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 602 place count 167 transition count 114
Applied a total of 602 rules in 52 ms. Remains 167 /481 variables (removed 314) and now considering 114/406 (removed 292) transitions.
// Phase 1: matrix 114 rows 167 cols
[2024-06-01 07:17:19] [INFO ] Computed 72 invariants in 1 ms
[2024-06-01 07:17:20] [INFO ] Implicit Places using invariants in 118 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 23, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 120 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 149/481 places, 114/406 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 175 ms. Remains : 149/481 places, 114/406 transitions.
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-07
Product exploration explored 100000 steps with 13081 reset in 309 ms.
Product exploration explored 100000 steps with 13077 reset in 302 ms.
Computed a total of 11 stabilizing places and 8 stable transitions
Computed a total of 11 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 40000 steps (5203 resets) in 266 ms. (149 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40000 steps (1815 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
// Phase 1: matrix 114 rows 149 cols
[2024-06-01 07:17:21] [INFO ] Computed 54 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/49 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/85 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/90 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/94 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 114/208 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/263 variables, 55/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 26/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/49 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/85 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/90 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/94 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 114/208 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/263 variables, 55/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 26/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/263 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 134 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 231 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 149 /149 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 07:17:22] [INFO ] Invariant cache hit.
[2024-06-01 07:17:22] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 07:17:22] [INFO ] Invariant cache hit.
[2024-06-01 07:17:22] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [0, 2, 7, 13, 23, 27, 31, 36, 38, 40, 42, 43, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 68, 70, 72, 74, 76, 78, 80, 82, 90, 92, 94, 96, 98, 120, 131, 133, 135, 139]
Discarding 41 places :
Implicit Place search using SMT with State Equation took 291 ms to find 41 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/149 places, 114/114 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 103 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 103 transition count 109
Applied a total of 10 rules in 3 ms. Remains 103 /108 variables (removed 5) and now considering 109/114 (removed 5) transitions.
// Phase 1: matrix 109 rows 103 cols
[2024-06-01 07:17:22] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 07:17:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 07:17:22] [INFO ] Invariant cache hit.
[2024-06-01 07:17:22] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/149 places, 109/114 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 453 ms. Remains : 103/149 places, 109/114 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Graph (complete) has 281 edges and 103 vertex of which 92 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 40000 steps (5185 resets) in 125 ms. (317 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (1805 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-06-01 07:17:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/57 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/75 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 109/184 variables, 75/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/212 variables, 28/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/212 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/57 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/75 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 109/184 variables, 75/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/212 variables, 28/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/212 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Product exploration explored 100000 steps with 13051 reset in 96 ms.
Product exploration explored 100000 steps with 13122 reset in 124 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 109/109 transitions.
Graph (complete) has 281 edges and 103 vertex of which 92 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 92 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 90 transition count 98
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 90 transition count 98
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 25 place count 90 transition count 104
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 25 rules in 3 ms. Remains 90 /103 variables (removed 13) and now considering 104/109 (removed 5) transitions.
[2024-06-01 07:17:25] [INFO ] Redundant transitions in 30 ms returned []
Running 101 sub problems to find dead transitions.
// Phase 1: matrix 104 rows 90 cols
[2024-06-01 07:17:25] [INFO ] Computed 10 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/193 variables, 89/99 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 1/194 variables, 1/100 constraints. Problems are: Problem set: 36 solved, 65 unsolved
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 6 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 2/102 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/102 constraints. Problems are: Problem set: 36 solved, 65 unsolved
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/194 variables, 1/103 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/103 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 12 (OVERLAPS) 0/194 variables, 0/103 constraints. Problems are: Problem set: 36 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 103 constraints, problems are : Problem set: 36 solved, 65 unsolved in 2684 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 36 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 4/4 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 2/6 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 2/8 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 4/74 variables, 2/10 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 102/176 variables, 74/84 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 1/85 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/85 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 18/194 variables, 16/101 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 64/165 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 3/168 constraints. Problems are: Problem set: 36 solved, 65 unsolved
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 3/171 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 0/171 constraints. Problems are: Problem set: 36 solved, 65 unsolved
At refinement iteration 15 (OVERLAPS) 0/194 variables, 0/171 constraints. Problems are: Problem set: 36 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 171 constraints, problems are : Problem set: 36 solved, 65 unsolved in 2957 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 65/101 constraints, Known Traps: 6/6 constraints]
After SMT, in 5692ms problems are : Problem set: 36 solved, 65 unsolved
Search for dead transitions found 36 dead transitions in 5694ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 90/103 places, 68/109 transitions.
Graph (complete) has 210 edges and 90 vertex of which 70 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 68
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 17 ms. Remains 68 /90 variables (removed 22) and now considering 68/68 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/103 places, 68/109 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5750 ms. Remains : 68/103 places, 68/109 transitions.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 109/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 103 cols
[2024-06-01 07:17:30] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 07:17:30] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 07:17:30] [INFO ] Invariant cache hit.
[2024-06-01 07:17:31] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 07:17:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 7 (OVERLAPS) 109/212 variables, 103/118 constraints. Problems are: Problem set: 16 solved, 90 unsolved
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 5/123 constraints. Problems are: Problem set: 16 solved, 90 unsolved
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 2/125 constraints. Problems are: Problem set: 16 solved, 90 unsolved
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/127 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/127 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/127 constraints. Problems are: Problem set: 16 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 127 constraints, problems are : Problem set: 16 solved, 90 unsolved in 10234 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 16 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/12 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/13 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/13 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 2/15 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 9/24 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/24 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 109/212 variables, 103/127 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 90/217 constraints. Problems are: Problem set: 16 solved, 90 unsolved
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 1/218 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/218 constraints. Problems are: Problem set: 16 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/218 constraints. Problems are: Problem set: 16 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 218 constraints, problems are : Problem set: 16 solved, 90 unsolved in 4025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 90/106 constraints, Known Traps: 10/10 constraints]
After SMT, in 14314ms problems are : Problem set: 16 solved, 90 unsolved
Search for dead transitions found 16 dead transitions in 14317ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/103 places, 93/109 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 93
Applied a total of 4 rules in 3 ms. Remains 99 /103 variables (removed 4) and now considering 93/93 (removed 0) transitions.
// Phase 1: matrix 93 rows 99 cols
[2024-06-01 07:17:45] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 07:17:45] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 07:17:45] [INFO ] Invariant cache hit.
[2024-06-01 07:17:45] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [45, 47, 49]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 253 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 96/103 places, 93/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14784 ms. Remains : 96/103 places, 93/109 transitions.
Treatment of property BusinessProcesses-PT-16-LTLFireability-07 finished in 26021 ms.
[2024-06-01 07:17:45] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:17:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:17:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 481 places, 406 transitions and 1265 arcs took 5 ms.
Total runtime 285531 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-16-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717226266435

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-16-LTLFireability-07
ltl formula formula --ltl=/tmp/3909/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 481 places, 406 transitions and 1265 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3909/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3909/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3909/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3909/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 482 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 482, there are 435 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~595!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1008
pnml2lts-mc( 0/ 4): unique states count: 2391
pnml2lts-mc( 0/ 4): unique transitions count: 22121
pnml2lts-mc( 0/ 4): - self-loop count: 73
pnml2lts-mc( 0/ 4): - claim dead count: 7468
pnml2lts-mc( 0/ 4): - claim found count: 389
pnml2lts-mc( 0/ 4): - claim success count: 2399
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1343
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2399 states 22140 transitions, fanout: 9.229
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.100 sec minimum, 0.108 sec on average)
pnml2lts-mc( 0/ 4): States per second: 21809, Transitions per second: 201273
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 21.1 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 409 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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-16"
export BK_EXAMINATION="LTLFireability"
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-16, examination is LTLFireability"
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-171620399800572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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