Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 192K 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-20-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716309367197

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:36:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:36:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:36:08] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-21 16:36:08] [INFO ] Transformed 782 places.
[2024-05-21 16:36:08] [INFO ] Transformed 697 transitions.
[2024-05-21 16:36:08] [INFO ] Found NUPN structural information;
[2024-05-21 16:36:08] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 63 places in 12 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 115 place count 604 transition count 537
Iterating global reduction 1 with 101 rules applied. Total rules applied 216 place count 604 transition count 537
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 269 place count 551 transition count 484
Iterating global reduction 1 with 53 rules applied. Total rules applied 322 place count 551 transition count 484
Applied a total of 322 rules in 159 ms. Remains 551 /719 variables (removed 168) and now considering 484/638 (removed 154) transitions.
// Phase 1: matrix 484 rows 551 cols
[2024-05-21 16:36:09] [INFO ] Computed 107 invariants in 31 ms
[2024-05-21 16:36:09] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-21 16:36:09] [INFO ] Invariant cache hit.
[2024-05-21 16:36:10] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Running 483 sub problems to find dead transitions.
[2024-05-21 16:36:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (OVERLAPS) 1/551 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-05-21 16:36:22] [INFO ] Deduced a trap composed of 93 places in 188 ms of which 28 ms to minimize.
[2024-05-21 16:36:22] [INFO ] Deduced a trap composed of 100 places in 214 ms of which 4 ms to minimize.
[2024-05-21 16:36:23] [INFO ] Deduced a trap composed of 94 places in 246 ms of which 3 ms to minimize.
[2024-05-21 16:36:24] [INFO ] Deduced a trap composed of 78 places in 824 ms of which 15 ms to minimize.
[2024-05-21 16:36:24] [INFO ] Deduced a trap composed of 80 places in 208 ms of which 6 ms to minimize.
[2024-05-21 16:36:24] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:36:24] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 81 places in 612 ms of which 4 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 83 places in 191 ms of which 4 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 3 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 4 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:36:26] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:36:27] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:36:28] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:36:28] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:36:28] [INFO ] Deduced a trap composed of 101 places in 179 ms of which 4 ms to minimize.
[2024-05-21 16:36:28] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:36:28] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 4 ms to minimize.
[2024-05-21 16:36:28] [INFO ] Deduced a trap composed of 92 places in 174 ms of which 3 ms to minimize.
[2024-05-21 16:36:29] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:36:29] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:36:29] [INFO ] Deduced a trap composed of 99 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:36:29] [INFO ] Deduced a trap composed of 96 places in 177 ms of which 3 ms to minimize.
[2024-05-21 16:36:29] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 4 ms to minimize.
[2024-05-21 16:36:29] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 4 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 93 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 96 places in 180 ms of which 3 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:36:30] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 3 ms to minimize.
Problem TDEAD430 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/147 constraints. Problems are: Problem set: 3 solved, 480 unsolved
[2024-05-21 16:36:31] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:36:31] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:36:31] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:36:31] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:36:31] [INFO ] Deduced a trap composed of 98 places in 163 ms of which 7 ms to minimize.
[2024-05-21 16:36:32] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:36:32] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:36:32] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:36:32] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:36:32] [INFO ] Deduced a trap composed of 99 places in 182 ms of which 3 ms to minimize.
[2024-05-21 16:36:32] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 4 ms to minimize.
[2024-05-21 16:36:33] [INFO ] Deduced a trap composed of 99 places in 157 ms of which 4 ms to minimize.
[2024-05-21 16:36:33] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:36:33] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:36:33] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:36:33] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:36:33] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:36:34] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:36:34] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 4 ms to minimize.
[2024-05-21 16:36:34] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/167 constraints. Problems are: Problem set: 3 solved, 480 unsolved
[2024-05-21 16:36:38] [INFO ] Deduced a trap composed of 91 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:36:38] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:36:38] [INFO ] Deduced a trap composed of 105 places in 158 ms of which 4 ms to minimize.
[2024-05-21 16:36:39] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 5 ms to minimize.
[2024-05-21 16:36:39] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 4 ms to minimize.
[2024-05-21 16:36:39] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:36:39] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 4 ms to minimize.
[2024-05-21 16:36:39] [INFO ] Deduced a trap composed of 102 places in 188 ms of which 4 ms to minimize.
[2024-05-21 16:36:40] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:36:40] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:36:40] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1035 variables, and 178 constraints, problems are : Problem set: 3 solved, 480 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/551 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 3 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 41/41 constraints. Problems are: Problem set: 3 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/551 variables, 65/106 constraints. Problems are: Problem set: 3 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 1/107 constraints. Problems are: Problem set: 3 solved, 480 unsolved
Problem TDEAD435 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 71/178 constraints. Problems are: Problem set: 4 solved, 479 unsolved
[2024-05-21 16:36:44] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:36:44] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:36:45] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:36:46] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:36:46] [INFO ] Deduced a trap composed of 97 places in 177 ms of which 4 ms to minimize.
[2024-05-21 16:36:46] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:36:46] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 4 ms to minimize.
[2024-05-21 16:36:46] [INFO ] Deduced a trap composed of 89 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:36:46] [INFO ] Deduced a trap composed of 129 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:36:47] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:36:47] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:36:47] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:36:47] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:36:47] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:36:47] [INFO ] Deduced a trap composed of 133 places in 126 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/198 constraints. Problems are: Problem set: 4 solved, 479 unsolved
[2024-05-21 16:36:48] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:36:48] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:36:48] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:36:48] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:36:48] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:36:49] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:36:49] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:36:49] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:36:49] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:36:49] [INFO ] Deduced a trap composed of 107 places in 181 ms of which 3 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 118 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:36:50] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:36:51] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:36:51] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:36:51] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 3 ms to minimize.
Problem TDEAD442 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD473 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/218 constraints. Problems are: Problem set: 7 solved, 476 unsolved
[2024-05-21 16:36:51] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:36:52] [INFO ] Deduced a trap composed of 99 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:36:52] [INFO ] Deduced a trap composed of 121 places in 178 ms of which 3 ms to minimize.
[2024-05-21 16:36:52] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:36:52] [INFO ] Deduced a trap composed of 112 places in 178 ms of which 3 ms to minimize.
[2024-05-21 16:36:52] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:36:52] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:36:53] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 4 ms to minimize.
[2024-05-21 16:36:53] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:36:53] [INFO ] Deduced a trap composed of 104 places in 169 ms of which 3 ms to minimize.
[2024-05-21 16:36:53] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:36:53] [INFO ] Deduced a trap composed of 126 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:36:53] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:36:54] [INFO ] Deduced a trap composed of 105 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:36:55] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 20/238 constraints. Problems are: Problem set: 7 solved, 476 unsolved
[2024-05-21 16:36:55] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:36:55] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:36:55] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:36:56] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:36:56] [INFO ] Deduced a trap composed of 109 places in 173 ms of which 4 ms to minimize.
[2024-05-21 16:36:56] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:36:56] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:36:56] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 4 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 102 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 124 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 4 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 111 places in 178 ms of which 3 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 4 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 103 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 109 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 101 places in 175 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 103 places in 163 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 20/258 constraints. Problems are: Problem set: 7 solved, 476 unsolved
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 99 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 107 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 104 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 4 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 4 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 110 places in 145 ms of which 3 ms to minimize.
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 20/278 constraints. Problems are: Problem set: 18 solved, 465 unsolved
[2024-05-21 16:37:03] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:37:03] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:37:03] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:37:03] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:37:03] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:37:06] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:37:06] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 20/298 constraints. Problems are: Problem set: 18 solved, 465 unsolved
[2024-05-21 16:37:07] [INFO ] Deduced a trap composed of 103 places in 178 ms of which 4 ms to minimize.
[2024-05-21 16:37:07] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 4 ms to minimize.
[2024-05-21 16:37:07] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 4 ms to minimize.
[2024-05-21 16:37:07] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:37:07] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:37:07] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:37:07] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:37:08] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:37:08] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:37:08] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:37:08] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:37:08] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:37:08] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:37:09] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:37:09] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:37:09] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:37:09] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:37:09] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:37:09] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:37:09] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/551 variables, 20/318 constraints. Problems are: Problem set: 21 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1035 variables, and 318 constraints, problems are : Problem set: 21 solved, 462 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/551 constraints, PredecessorRefiner: 0/483 constraints, Known Traps: 211/211 constraints]
After SMT, in 60237ms problems are : Problem set: 21 solved, 462 unsolved
Search for dead transitions found 21 dead transitions in 60260ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 551/719 places, 463/638 transitions.
Applied a total of 0 rules in 16 ms. Remains 551 /551 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61470 ms. Remains : 551/719 places, 463/638 transitions.
Support contains 40 out of 551 places after structural reductions.
[2024-05-21 16:37:10] [INFO ] Flatten gal took : 67 ms
[2024-05-21 16:37:10] [INFO ] Flatten gal took : 44 ms
[2024-05-21 16:37:10] [INFO ] Input system was already deterministic with 463 transitions.
RANDOM walk for 40000 steps (199 resets) in 2361 ms. (16 steps per ms) remains 16/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
// Phase 1: matrix 463 rows 551 cols
[2024-05-21 16:37:11] [INFO ] Computed 108 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 201/225 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 198/423 variables, 50/65 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 119/542 variables, 41/106 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/544 variables, 2/108 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 458/1002 variables, 544/652 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1002 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 11/1013 variables, 6/658 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1013 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 1/1014 variables, 1/659 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 0/659 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/1014 variables, 0/659 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 659 constraints, problems are : Problem set: 1 solved, 15 unsolved in 1534 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 191/209 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 213/422 variables, 53/65 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-21 16:37:13] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:37:13] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:37:13] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 3 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 3 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 20/85 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 3 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 4 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 3 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:37:17] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 20/105 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-21 16:37:18] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:37:18] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:37:18] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:37:18] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
SMT process timed out in 6654ms, After SMT, problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 463/463 transitions.
Graph (trivial) has 249 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1181 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 544 transition count 387
Reduce places removed 67 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 477 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 140 place count 475 transition count 385
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 140 place count 475 transition count 278
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 372 place count 350 transition count 278
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 379 place count 343 transition count 271
Iterating global reduction 3 with 7 rules applied. Total rules applied 386 place count 343 transition count 271
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 648 place count 211 transition count 141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 652 place count 209 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 654 place count 209 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 656 place count 207 transition count 146
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 661 place count 207 transition count 146
Applied a total of 661 rules in 137 ms. Remains 207 /551 variables (removed 344) and now considering 146/463 (removed 317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 207/551 places, 146/463 transitions.
RANDOM walk for 40000 steps (1566 resets) in 1548 ms. (25 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40003 steps (382 resets) in 175 ms. (227 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (534 resets) in 220 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (512 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (542 resets) in 156 ms. (254 steps per ms) remains 3/3 properties
[2024-05-21 16:37:19] [INFO ] Flow matrix only has 145 transitions (discarded 1 similar events)
// Phase 1: matrix 145 rows 207 cols
[2024-05-21 16:37:19] [INFO ] Computed 88 invariants in 4 ms
[2024-05-21 16:37:19] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 128/140 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 54/194 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/205 variables, 11/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 145/350 variables, 205/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 14/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/352 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/352 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 309 constraints, problems are : Problem set: 0 solved, 3 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 207/207 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 128/140 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 54/194 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 4 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:37:19] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 2 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:37:20] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
[2024-05-21 16:37:21] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:37:22] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:37:22] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:37:22] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:37:22] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 11 (OVERLAPS) 11/205 variables, 11/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 145/350 variables, 205/341 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 14/355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/350 variables, 2/357 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/350 variables, 0/357 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/352 variables, 2/359 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/352 variables, 0/359 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/352 variables, 0/359 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 359 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2986 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 207/207 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 48/48 constraints]
After SMT, in 3187ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 1372 steps, including 77 resets, run visited all 2 properties in 40 ms. (steps per millisecond=34 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 50 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 483 stabilizing places and 405 stable transitions
Graph (complete) has 1188 edges and 551 vertex of which 549 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.29 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(F(p0))))'
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 542 transition count 454
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 542 transition count 454
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 538 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 538 transition count 450
Applied a total of 26 rules in 34 ms. Remains 538 /551 variables (removed 13) and now considering 450/463 (removed 13) transitions.
// Phase 1: matrix 450 rows 538 cols
[2024-05-21 16:37:23] [INFO ] Computed 108 invariants in 8 ms
[2024-05-21 16:37:23] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-21 16:37:23] [INFO ] Invariant cache hit.
[2024-05-21 16:37:24] [INFO ] Implicit Places using invariants and state equation in 579 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 825 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 537/551 places, 450/463 transitions.
Applied a total of 0 rules in 9 ms. Remains 537 /537 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 868 ms. Remains : 537/551 places, 450/463 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-00
Stuttering criterion allowed to conclude after 180 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-00 finished in 1129 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((G((X(F(p0))&&(X(p1) U p2)))||p3))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 542 transition count 454
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 542 transition count 454
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 538 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 538 transition count 450
Applied a total of 26 rules in 24 ms. Remains 538 /551 variables (removed 13) and now considering 450/463 (removed 13) transitions.
[2024-05-21 16:37:24] [INFO ] Invariant cache hit.
[2024-05-21 16:37:24] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-21 16:37:24] [INFO ] Invariant cache hit.
[2024-05-21 16:37:25] [INFO ] Implicit Places using invariants and state equation in 474 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 750 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 537/551 places, 450/463 transitions.
Applied a total of 0 rules in 8 ms. Remains 537 /537 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 782 ms. Remains : 537/551 places, 450/463 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 285 ms.
Product exploration explored 100000 steps with 33333 reset in 248 ms.
Computed a total of 469 stabilizing places and 392 stable transitions
Graph (complete) has 1162 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Computed a total of 469 stabilizing places and 392 stable transitions
Detected a total of 469/537 stabilizing places and 392/450 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 32 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLFireability-01 finished in 1740 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(G(p0))))'
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 455
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 455
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 540 transition count 452
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 540 transition count 452
Applied a total of 22 rules in 28 ms. Remains 540 /551 variables (removed 11) and now considering 452/463 (removed 11) transitions.
// Phase 1: matrix 452 rows 540 cols
[2024-05-21 16:37:26] [INFO ] Computed 108 invariants in 8 ms
[2024-05-21 16:37:26] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-21 16:37:26] [INFO ] Invariant cache hit.
[2024-05-21 16:37:26] [INFO ] Implicit Places using invariants and state equation in 563 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 812 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 452/463 transitions.
Applied a total of 0 rules in 8 ms. Remains 539 /539 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 850 ms. Remains : 539/551 places, 452/463 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-02 finished in 1045 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((X(p0)||F((p1&&X((p1 U (p2||G(p1)))))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 542 transition count 454
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 542 transition count 454
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 538 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 538 transition count 450
Applied a total of 26 rules in 25 ms. Remains 538 /551 variables (removed 13) and now considering 450/463 (removed 13) transitions.
// Phase 1: matrix 450 rows 538 cols
[2024-05-21 16:37:27] [INFO ] Computed 108 invariants in 9 ms
[2024-05-21 16:37:27] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 16:37:27] [INFO ] Invariant cache hit.
[2024-05-21 16:37:27] [INFO ] Implicit Places using invariants and state equation in 549 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 803 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 537/551 places, 450/463 transitions.
Applied a total of 0 rules in 9 ms. Remains 537 /537 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 838 ms. Remains : 537/551 places, 450/463 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-03
Product exploration explored 100000 steps with 33275 reset in 163 ms.
Product exploration explored 100000 steps with 33282 reset in 295 ms.
Computed a total of 469 stabilizing places and 392 stable transitions
Graph (complete) has 1162 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 469 stabilizing places and 392 stable transitions
Detected a total of 469/537 stabilizing places and 392/450 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 761 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (198 resets) in 465 ms. (85 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (36 resets) in 108 ms. (366 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (35 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (35 resets) in 202 ms. (197 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (29 resets) in 77 ms. (512 steps per ms) remains 3/6 properties
// Phase 1: matrix 450 rows 537 cols
[2024-05-21 16:37:30] [INFO ] Computed 107 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 396/405 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 5 (OVERLAPS) 122/527 variables, 41/106 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/530 variables, 1/107 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/107 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 445/975 variables, 530/637 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 0/637 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/986 variables, 6/643 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/986 variables, 0/643 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/987 variables, 1/644 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/987 variables, 0/644 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/987 variables, 0/644 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 987/987 variables, and 644 constraints, problems are : Problem set: 2 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 8/987 variables, and 1 constraints, problems are : Problem set: 3 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/65 constraints, Generalized P Invariants (flows): 0/42 constraints, State Equation: 0/537 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 481ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p0 (NOT p1))), (G (OR p2 p0 p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 18 factoid took 1861 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 450/450 transitions.
Applied a total of 0 rules in 13 ms. Remains 537 /537 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2024-05-21 16:37:32] [INFO ] Invariant cache hit.
[2024-05-21 16:37:33] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-21 16:37:33] [INFO ] Invariant cache hit.
[2024-05-21 16:37:33] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-05-21 16:37:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (OVERLAPS) 1/537 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 16:37:43] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:37:43] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:37:43] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:37:44] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:37:45] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 3 ms to minimize.
[2024-05-21 16:37:45] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:37:45] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:37:45] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:37:45] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:37:45] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:37:45] [INFO ] Deduced a trap composed of 88 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:37:46] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 3 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:37:47] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:37:48] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:37:49] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:37:50] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 75 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:37:51] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 4 ms to minimize.
[2024-05-21 16:37:52] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 16:37:55] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 4 ms to minimize.
[2024-05-21 16:37:56] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:37:56] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:37:56] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:37:56] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:37:56] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:37:56] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:37:56] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 4 ms to minimize.
[2024-05-21 16:37:57] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:37:58] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:37:58] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:37:58] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:37:58] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:37:58] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 16:37:59] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:37:59] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:37:59] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:37:59] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:37:59] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:37:59] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:37:59] [INFO ] Deduced a trap composed of 89 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:38:00] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:38:00] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:38:00] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:38:00] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:38:00] [INFO ] Deduced a trap composed of 78 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:38:01] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:38:01] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:38:01] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 4 ms to minimize.
[2024-05-21 16:38:01] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:38:02] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:38:02] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:38:02] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:38:02] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 20/207 constraints. Problems are: Problem set: 2 solved, 447 unsolved
[2024-05-21 16:38:02] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:38:03] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:38:03] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:38:03] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:38:03] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:38:03] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:38:03] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 30198ms, After SMT, problems are : Problem set: 2 solved, 447 unsolved
Search for dead transitions found 2 dead transitions in 30210ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 537/537 places, 448/450 transitions.
Applied a total of 0 rules in 10 ms. Remains 537 /537 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31083 ms. Remains : 537/537 places, 448/450 transitions.
Computed a total of 469 stabilizing places and 390 stable transitions
Graph (complete) has 1158 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 469 stabilizing places and 390 stable transitions
Detected a total of 469/537 stabilizing places and 390/448 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 346 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (196 resets) in 246 ms. (161 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (35 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (49 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (31 resets) in 68 ms. (579 steps per ms) remains 1/4 properties
// Phase 1: matrix 448 rows 537 cols
[2024-05-21 16:38:04] [INFO ] Computed 109 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 396/404 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/530 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 443/973 variables, 530/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/984 variables, 6/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/984 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/985 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/985 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 985/985 variables, and 646 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 537/537 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 396/404 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 126/530 variables, 44/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:38:05] [INFO ] Deduced a trap composed of 90 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:38:06] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:38:06] [INFO ] Deduced a trap composed of 99 places in 193 ms of which 3 ms to minimize.
[2024-05-21 16:38:06] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:38:06] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:38:06] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:38:07] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:38:07] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:38:07] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:38:07] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:38:07] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:38:07] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:38:07] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:38:07] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 101 places in 174 ms of which 4 ms to minimize.
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:38:08] [INFO ] Deduced a trap composed of 96 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:38:09] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 443/973 variables, 530/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/973 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:38:10] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 3 ms to minimize.
SMT process timed out in 5361ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 537/537 places, 448/448 transitions.
Graph (trivial) has 250 edges and 537 vertex of which 6 / 537 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1151 edges and 532 vertex of which 530 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 530 transition count 371
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 462 transition count 371
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 138 place count 462 transition count 260
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 382 place count 329 transition count 260
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 671 place count 181 transition count 119
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 675 place count 179 transition count 126
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 677 place count 179 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 679 place count 177 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 680 place count 177 transition count 124
Applied a total of 680 rules in 69 ms. Remains 177 /537 variables (removed 360) and now considering 124/448 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 177/537 places, 124/448 transitions.
RANDOM walk for 40000 steps (1939 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3322 steps (43 resets) in 19 ms. (166 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 803 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2298 reset in 244 ms.
Product exploration explored 100000 steps with 2302 reset in 279 ms.
Support contains 3 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 448/448 transitions.
Applied a total of 0 rules in 15 ms. Remains 537 /537 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2024-05-21 16:38:12] [INFO ] Invariant cache hit.
[2024-05-21 16:38:12] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-21 16:38:12] [INFO ] Invariant cache hit.
[2024-05-21 16:38:13] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2024-05-21 16:38:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (OVERLAPS) 1/537 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 16:38:22] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:38:23] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:38:24] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:38:25] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:38:25] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:38:25] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:38:25] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:38:25] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 16:38:25] [INFO ] Deduced a trap composed of 87 places in 181 ms of which 3 ms to minimize.
[2024-05-21 16:38:26] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 2 ms to minimize.
[2024-05-21 16:38:26] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:38:26] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:38:26] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:38:26] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:38:26] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:38:26] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:38:27] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:38:27] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:38:27] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:38:27] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:38:27] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:38:27] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:38:27] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:38:27] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:38:28] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:38:28] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:38:28] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:38:28] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 16:38:28] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:38:28] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:38:28] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 112 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:38:29] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:38:30] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:38:31] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:38:31] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:38:31] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 16:38:35] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:38:35] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:38:35] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:38:35] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:38:35] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:38:35] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 5 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 87 places in 170 ms of which 4 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:38:36] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:38:37] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:38:37] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:38:37] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:38:37] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:38:37] [INFO ] Deduced a trap composed of 88 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:38:38] [INFO ] Deduced a trap composed of 90 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:38:38] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:38:38] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 16:38:38] [INFO ] Deduced a trap composed of 87 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:38:38] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 4 ms to minimize.
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:38:39] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 133 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:38:40] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:38:41] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 2 ms to minimize.
Problem TDEAD435 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 20/209 constraints. Problems are: Problem set: 1 solved, 446 unsolved
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:38:42] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:38:43] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 1 solved, 446 unsolved
Search for dead transitions found 1 dead transitions in 30182ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 537/537 places, 447/448 transitions.
Applied a total of 0 rules in 14 ms. Remains 537 /537 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31052 ms. Remains : 537/537 places, 447/448 transitions.
Treatment of property BusinessProcesses-PT-20-LTLFireability-03 finished in 76509 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((p0||X((p1||(p2&&G(p3)))))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 455
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 455
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 451
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 451
Applied a total of 24 rules in 65 ms. Remains 539 /551 variables (removed 12) and now considering 451/463 (removed 12) transitions.
// Phase 1: matrix 451 rows 539 cols
[2024-05-21 16:38:43] [INFO ] Computed 108 invariants in 8 ms
[2024-05-21 16:38:44] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-21 16:38:44] [INFO ] Invariant cache hit.
[2024-05-21 16:38:44] [INFO ] Implicit Places using invariants and state equation in 632 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1085 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 451/463 transitions.
Applied a total of 0 rules in 15 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1167 ms. Remains : 538/551 places, 451/463 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-04
Product exploration explored 100000 steps with 528 reset in 233 ms.
Product exploration explored 100000 steps with 527 reset in 210 ms.
Computed a total of 470 stabilizing places and 393 stable transitions
Graph (complete) has 1163 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 470 stabilizing places and 393 stable transitions
Detected a total of 470/538 stabilizing places and 393/451 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 489 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
RANDOM walk for 40000 steps (196 resets) in 304 ms. (131 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (35 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (37 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 402 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
// Phase 1: matrix 451 rows 538 cols
[2024-05-21 16:38:46] [INFO ] Computed 107 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 111/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 288/402 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 125/527 variables, 41/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/531 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 446/977 variables, 531/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 11/988 variables, 6/644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/988 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/989 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/989 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 989/989 variables, and 645 constraints, problems are : Problem set: 0 solved, 4 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 111/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 288/402 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:38:47] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:38:47] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:38:47] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:38:47] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:38:47] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:38:47] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:38:47] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:38:48] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:38:48] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:38:48] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:38:48] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:38:48] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:38:48] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:38:48] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:38:48] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:38:48] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:38:49] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 125/527 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 4/531 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 446/977 variables, 531/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 4/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:38:50] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:38:51] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:38:52] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 3 ms to minimize.
SMT process timed out in 5577ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 451/451 transitions.
Graph (trivial) has 249 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1156 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 531 transition count 377
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 466 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 465 transition count 376
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 134 place count 465 transition count 265
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 376 place count 334 transition count 265
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 377 place count 333 transition count 264
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 333 transition count 264
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 289 rules applied. Total rules applied 667 place count 186 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 671 place count 184 transition count 129
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 673 place count 184 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 675 place count 182 transition count 127
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 676 place count 182 transition count 127
Applied a total of 676 rules in 61 ms. Remains 182 /538 variables (removed 356) and now considering 127/451 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 182/538 places, 127/451 transitions.
RANDOM walk for 22790 steps (1185 resets) in 162 ms. (139 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p1 p2) (OR p1 p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 10 factoid took 1145 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 451/451 transitions.
Applied a total of 0 rules in 19 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-21 16:38:53] [INFO ] Invariant cache hit.
[2024-05-21 16:38:54] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-21 16:38:54] [INFO ] Invariant cache hit.
[2024-05-21 16:38:54] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
Running 450 sub problems to find dead transitions.
[2024-05-21 16:38:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:39:04] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:39:05] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:39:05] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:39:05] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:39:05] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:39:05] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:39:05] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:39:06] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:39:07] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 16:39:07] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:39:07] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:39:07] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 2 ms to minimize.
[2024-05-21 16:39:07] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:39:08] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:39:09] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:39:09] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:39:09] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:39:09] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:39:09] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:39:09] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:39:09] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:39:10] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:39:10] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 16:39:10] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:39:10] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:39:10] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:39:10] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:39:11] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:39:11] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:39:11] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:39:11] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:39:11] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:39:11] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:39:11] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:39:12] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:39:12] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:39:12] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:39:12] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:39:12] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:39:12] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:39:13] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:39:13] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:39:13] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 16:39:17] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:39:17] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:39:17] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:39:17] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:39:17] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:39:18] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:39:19] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:39:19] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:39:19] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:39:19] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:39:20] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:39:20] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:39:20] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:39:20] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:39:20] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD438 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 3 solved, 447 unsolved
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:39:21] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:39:22] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:39:22] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:39:22] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:39:22] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:39:22] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 4 ms to minimize.
[2024-05-21 16:39:22] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:39:23] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:39:23] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:39:23] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:39:23] [INFO ] Deduced a trap composed of 87 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:39:23] [INFO ] Deduced a trap composed of 86 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:39:24] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:39:24] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:39:24] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 3 solved, 447 unsolved
[2024-05-21 16:39:24] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 3 ms to minimize.
SMT process timed out in 30149ms, After SMT, problems are : Problem set: 3 solved, 447 unsolved
Search for dead transitions found 3 dead transitions in 30156ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/538 places, 448/451 transitions.
Applied a total of 0 rules in 8 ms. Remains 538 /538 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30970 ms. Remains : 538/538 places, 448/451 transitions.
Computed a total of 470 stabilizing places and 390 stable transitions
Graph (complete) has 1157 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 470 stabilizing places and 390 stable transitions
Detected a total of 470/538 stabilizing places and 390/448 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 461 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
RANDOM walk for 40000 steps (193 resets) in 272 ms. (146 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (35 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (35 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (36 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
// Phase 1: matrix 448 rows 538 cols
[2024-05-21 16:39:25] [INFO ] Computed 107 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 288/401 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 128/529 variables, 41/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/531 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 443/974 variables, 531/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/974 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 11/985 variables, 6/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/986 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/986 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/986 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 986/986 variables, and 645 constraints, problems are : Problem set: 0 solved, 3 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 288/401 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:39:26] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:39:26] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:39:26] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:39:26] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:39:26] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:39:27] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:39:28] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:39:28] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:39:28] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:39:28] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:39:28] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:39:28] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:39:28] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:39:28] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:39:29] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:39:29] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:39:29] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:39:29] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:39:29] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:39:29] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:39:29] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:39:29] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:39:30] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:39:31] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:39:31] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
SMT process timed out in 5537ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 448/448 transitions.
Graph (trivial) has 249 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1150 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 531 transition count 374
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 466 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 465 transition count 373
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 134 place count 465 transition count 262
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 376 place count 334 transition count 262
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 377 place count 333 transition count 261
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 333 transition count 261
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 289 rules applied. Total rules applied 667 place count 186 transition count 119
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 671 place count 184 transition count 126
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 673 place count 184 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 675 place count 182 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 676 place count 182 transition count 124
Applied a total of 676 rules in 56 ms. Remains 182 /538 variables (removed 356) and now considering 124/448 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 182/538 places, 124/448 transitions.
RANDOM walk for 30218 steps (1592 resets) in 186 ms. (161 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p1 p2) (OR p1 p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 10 factoid took 1181 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Product exploration explored 100000 steps with 527 reset in 233 ms.
Product exploration explored 100000 steps with 526 reset in 246 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 448/448 transitions.
Graph (trivial) has 248 edges and 538 vertex of which 6 / 538 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 1151 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 531 transition count 440
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 85 Pre rules applied. Total rules applied 62 place count 531 transition count 498
Deduced a syphon composed of 145 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 147 place count 531 transition count 498
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 173 place count 505 transition count 455
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 199 place count 505 transition count 455
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 292 places in 1 ms
Iterating global reduction 1 with 173 rules applied. Total rules applied 372 place count 505 transition count 455
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 417 place count 460 transition count 410
Deduced a syphon composed of 247 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 462 place count 460 transition count 410
Deduced a syphon composed of 247 places in 0 ms
Applied a total of 462 rules in 116 ms. Remains 460 /538 variables (removed 78) and now considering 410/448 (removed 38) transitions.
[2024-05-21 16:39:34] [INFO ] Redundant transitions in 26 ms returned []
Running 409 sub problems to find dead transitions.
// Phase 1: matrix 410 rows 460 cols
[2024-05-21 16:39:34] [INFO ] Computed 107 invariants in 15 ms
[2024-05-21 16:39:34] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 1/460 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-21 16:39:42] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 2 ms to minimize.
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 TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 3 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 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 TDEAD14 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 TDEAD25 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 TDEAD35 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 TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD184 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 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 TDEAD201 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 TDEAD208 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 20/127 constraints. Problems are: Problem set: 162 solved, 247 unsolved
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 16:39:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
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 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 TDEAD65 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 20/147 constraints. Problems are: Problem set: 226 solved, 183 unsolved
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-21 16:39:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-21 16:39:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD295 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 20/167 constraints. Problems are: Problem set: 252 solved, 157 unsolved
[2024-05-21 16:39:46] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-21 16:39:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-21 16:39:46] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-21 16:39:46] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
[2024-05-21 16:39:46] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:39:46] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:39:46] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:39:47] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:39:47] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:39:47] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:39:47] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-21 16:39:47] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 3 ms to minimize.
Problem TDEAD128 is UNSAT
[2024-05-21 16:39:48] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:39:48] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:39:48] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 4 ms to minimize.
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
[2024-05-21 16:39:48] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:39:48] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:39:48] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:39:48] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-05-21 16:39:49] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 3 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 20/187 constraints. Problems are: Problem set: 279 solved, 130 unsolved
[2024-05-21 16:39:49] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:39:49] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:39:49] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:39:50] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:39:50] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 4 ms to minimize.
[2024-05-21 16:39:50] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:39:50] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:39:50] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
Problem TDEAD146 is UNSAT
[2024-05-21 16:39:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-21 16:39:50] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
[2024-05-21 16:39:51] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 2 ms to minimize.
[2024-05-21 16:39:51] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:39:51] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:39:51] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:39:51] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:39:51] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:39:52] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:39:52] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD216 is UNSAT
[2024-05-21 16:39:52] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD218 is UNSAT
[2024-05-21 16:39:52] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 20/207 constraints. Problems are: Problem set: 285 solved, 124 unsolved
[2024-05-21 16:39:52] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:39:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
[2024-05-21 16:39:53] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:39:53] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:39:53] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:39:53] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:39:53] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 2 ms to minimize.
Problem TDEAD254 is UNSAT
[2024-05-21 16:39:53] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:39:54] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:39:54] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 3 ms to minimize.
Problem TDEAD273 is UNSAT
[2024-05-21 16:39:54] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:39:54] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:39:54] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:39:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD301 is UNSAT
[2024-05-21 16:39:54] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:39:55] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:39:55] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:39:55] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:39:55] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:39:55] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 3 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD301 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 20/227 constraints. Problems are: Problem set: 289 solved, 120 unsolved
[2024-05-21 16:39:57] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:39:57] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:39:57] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:39:57] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:39:57] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:39:57] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:39:57] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:39:58] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:39:58] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 2 ms to minimize.
[2024-05-21 16:39:58] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-05-21 16:39:58] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 2 ms to minimize.
[2024-05-21 16:39:59] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:39:59] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:39:59] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:39:59] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:39:59] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:40:00] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 17/244 constraints. Problems are: Problem set: 289 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/244 constraints. Problems are: Problem set: 289 solved, 120 unsolved
Problem TDEAD101 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 12 (OVERLAPS) 409/869 variables, 460/704 constraints. Problems are: Problem set: 300 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/869 variables, 11/715 constraints. Problems are: Problem set: 300 solved, 109 unsolved
[2024-05-21 16:40:03] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:40:03] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:40:04] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 7 ms to minimize.
[2024-05-21 16:40:04] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 3 ms to minimize.
SMT process timed out in 30476ms, After SMT, problems are : Problem set: 300 solved, 109 unsolved
Search for dead transitions found 300 dead transitions in 30485ms
Found 300 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 300 transitions
Dead transitions reduction (with SMT) removed 300 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 460/538 places, 110/448 transitions.
Graph (complete) has 814 edges and 460 vertex of which 213 are kept as prefixes of interest. Removing 247 places using SCC suffix rule.1 ms
Discarding 247 places :
Also discarding 0 output transitions
Ensure Unique test removed 35 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 178 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 20 ms. Remains 178 /460 variables (removed 282) and now considering 127/110 (removed -17) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 178/538 places, 127/448 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30657 ms. Remains : 178/538 places, 127/448 transitions.
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 538 /538 variables (removed 0) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 538 cols
[2024-05-21 16:40:04] [INFO ] Computed 107 invariants in 10 ms
[2024-05-21 16:40:04] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-21 16:40:04] [INFO ] Invariant cache hit.
[2024-05-21 16:40:05] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2024-05-21 16:40:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 16:40:15] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:40:15] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:40:15] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:40:15] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:40:15] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:40:15] [INFO ] Deduced a trap composed of 85 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:40:16] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:40:16] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 4 ms to minimize.
[2024-05-21 16:40:16] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:40:16] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:40:16] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:40:16] [INFO ] Deduced a trap composed of 87 places in 169 ms of which 3 ms to minimize.
[2024-05-21 16:40:17] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:40:17] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:40:17] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 4 ms to minimize.
[2024-05-21 16:40:17] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:40:17] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:40:17] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:40:17] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:40:18] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
Problem TDEAD408 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 1 solved, 446 unsolved
[2024-05-21 16:40:18] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:40:18] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:40:18] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:40:18] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:40:19] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:40:19] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:40:19] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:40:19] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:40:19] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:40:19] [INFO ] Deduced a trap composed of 85 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:40:20] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:40:20] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:40:20] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:40:20] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 3 ms to minimize.
[2024-05-21 16:40:20] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:40:20] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:40:21] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:40:21] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:40:21] [INFO ] Deduced a trap composed of 86 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:40:21] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 1 solved, 446 unsolved
[2024-05-21 16:40:22] [INFO ] Deduced a trap composed of 83 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:40:22] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 2 ms to minimize.
[2024-05-21 16:40:22] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:40:22] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:40:22] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:40:22] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:40:23] [INFO ] Deduced a trap composed of 84 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:40:23] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:40:23] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:40:23] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:40:23] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:40:24] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:40:24] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:40:24] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:40:24] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:40:24] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:40:24] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:40:24] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:40:24] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:40:25] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 1 solved, 446 unsolved
[2024-05-21 16:40:28] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:40:29] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:40:29] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:40:29] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:40:29] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:40:29] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:40:29] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:40:29] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:40:30] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 4 ms to minimize.
[2024-05-21 16:40:30] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:40:30] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:40:30] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:40:30] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:40:30] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:40:31] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:40:31] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:40:31] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:40:31] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:40:31] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:40:31] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
Problem TDEAD414 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 2 solved, 445 unsolved
[2024-05-21 16:40:32] [INFO ] Deduced a trap composed of 96 places in 169 ms of which 3 ms to minimize.
[2024-05-21 16:40:32] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:40:32] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:40:32] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 4 ms to minimize.
[2024-05-21 16:40:33] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:40:33] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:40:33] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 4 ms to minimize.
[2024-05-21 16:40:33] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:40:33] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:40:33] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:40:33] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:40:34] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:40:34] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:40:34] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:40:34] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:40:34] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:40:34] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:40:35] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:40:35] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 4 ms to minimize.
[2024-05-21 16:40:35] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 2 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/986 variables, and 207 constraints, problems are : Problem set: 2 solved, 445 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 2 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 2 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 445 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 2 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 2 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 100/207 constraints. Problems are: Problem set: 2 solved, 445 unsolved
[2024-05-21 16:40:39] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:40:39] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:40:40] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:40:40] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:40:40] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:40:40] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:40:40] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 4 ms to minimize.
[2024-05-21 16:40:40] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:40:41] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:40:41] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:40:41] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:40:41] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:40:41] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:40:41] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:40:41] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:40:42] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:40:42] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:40:42] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:40:42] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 2 ms to minimize.
[2024-05-21 16:40:42] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/227 constraints. Problems are: Problem set: 2 solved, 445 unsolved
[2024-05-21 16:40:43] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:40:43] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:40:43] [INFO ] Deduced a trap composed of 115 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:40:43] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:40:43] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:40:43] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:40:44] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:40:44] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:40:44] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:40:44] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:40:44] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:40:44] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:40:45] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:40:45] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:40:45] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:40:45] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:40:45] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 2 ms to minimize.
[2024-05-21 16:40:46] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:40:46] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:40:46] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/247 constraints. Problems are: Problem set: 2 solved, 445 unsolved
[2024-05-21 16:40:46] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:40:47] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 4 ms to minimize.
[2024-05-21 16:40:47] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:40:47] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:40:47] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:40:47] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:40:47] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:40:47] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:40:47] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:40:48] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:40:48] [INFO ] Deduced a trap composed of 129 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:40:48] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:40:48] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:40:48] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:40:49] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 3 ms to minimize.
[2024-05-21 16:40:49] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 4 ms to minimize.
[2024-05-21 16:40:49] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:40:49] [INFO ] Deduced a trap composed of 90 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:40:49] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:40:50] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/267 constraints. Problems are: Problem set: 2 solved, 445 unsolved
[2024-05-21 16:40:50] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:40:50] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:40:51] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:40:51] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:40:51] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:40:51] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:40:51] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:40:51] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:40:52] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:40:52] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:40:52] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:40:52] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:40:52] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:40:52] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:40:52] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:40:52] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:40:53] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:40:53] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:40:53] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:40:53] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/287 constraints. Problems are: Problem set: 2 solved, 445 unsolved
[2024-05-21 16:40:54] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:40:54] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:40:54] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:40:54] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:40:55] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:40:55] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:40:55] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:40:55] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:40:55] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:40:55] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:40:55] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:40:55] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:40:56] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 2 ms to minimize.
[2024-05-21 16:40:56] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:40:56] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:40:56] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:40:56] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:40:56] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:40:57] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:40:57] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/307 constraints. Problems are: Problem set: 2 solved, 445 unsolved
[2024-05-21 16:40:57] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-21 16:40:57] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:40:58] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:40:58] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:40:58] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:40:58] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:40:58] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:40:59] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:40:59] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:40:59] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:40:59] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:40:59] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:40:59] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:40:59] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:41:00] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:41:00] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:41:00] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:41:00] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:41:00] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:41:01] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 20/327 constraints. Problems are: Problem set: 2 solved, 445 unsolved
[2024-05-21 16:41:02] [INFO ] Deduced a trap composed of 88 places in 180 ms of which 3 ms to minimize.
[2024-05-21 16:41:02] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 2 ms to minimize.
[2024-05-21 16:41:02] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:41:02] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:41:02] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:41:02] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:41:03] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:41:03] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:41:03] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:41:03] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:41:03] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:41:03] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:41:04] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:41:04] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:41:04] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:41:04] [INFO ] Deduced a trap composed of 96 places in 180 ms of which 3 ms to minimize.
[2024-05-21 16:41:04] [INFO ] Deduced a trap composed of 132 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:41:05] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:41:05] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/986 variables, and 346 constraints, problems are : Problem set: 2 solved, 445 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 0/447 constraints, Known Traps: 239/239 constraints]
After SMT, in 60150ms problems are : Problem set: 2 solved, 445 unsolved
Search for dead transitions found 2 dead transitions in 60157ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/538 places, 446/448 transitions.
Applied a total of 0 rules in 22 ms. Remains 538 /538 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60991 ms. Remains : 538/538 places, 446/448 transitions.
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 142001 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)||(X((p1||X(p1))) U ((p2&&X((p1||X(p1))))||X(G((p1||X(p1))))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 455
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 455
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 451
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 451
Applied a total of 24 rules in 56 ms. Remains 539 /551 variables (removed 12) and now considering 451/463 (removed 12) transitions.
// Phase 1: matrix 451 rows 539 cols
[2024-05-21 16:41:05] [INFO ] Computed 108 invariants in 5 ms
[2024-05-21 16:41:05] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-21 16:41:05] [INFO ] Invariant cache hit.
[2024-05-21 16:41:06] [INFO ] Implicit Places using invariants and state equation in 679 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 913 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 451/463 transitions.
Applied a total of 0 rules in 19 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 990 ms. Remains : 538/551 places, 451/463 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-05
Product exploration explored 100000 steps with 33375 reset in 215 ms.
Product exploration explored 100000 steps with 33508 reset in 223 ms.
Computed a total of 470 stabilizing places and 393 stable transitions
Graph (complete) has 1163 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 470 stabilizing places and 393 stable transitions
Detected a total of 470/538 stabilizing places and 393/451 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 851 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (194 resets) in 296 ms. (134 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (34 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (37 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
// Phase 1: matrix 451 rows 538 cols
[2024-05-21 16:41:08] [INFO ] Computed 107 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 196/199 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/401 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:41:08] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 127/528 variables, 42/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:41:09] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:41:10] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:41:10] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:41:10] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:41:10] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:41:10] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/531 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 446/977 variables, 531/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 11/988 variables, 6/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/988 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/989 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/989 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/989 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 989/989 variables, and 664 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2501 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 196/199 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/401 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:41:11] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:41:11] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:41:11] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:41:11] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:41:12] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 127/528 variables, 42/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/531 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 446/977 variables, 531/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 3/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 11/988 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/988 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/989 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/989 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/989 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 989/989 variables, and 672 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1416 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 24/24 constraints]
After SMT, in 3932ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 370 ms.
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 451/451 transitions.
Graph (trivial) has 250 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1156 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 531 transition count 375
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 464 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 463 transition count 374
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 138 place count 463 transition count 263
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 382 place count 330 transition count 263
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 283 rules applied. Total rules applied 665 place count 187 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 669 place count 185 transition count 130
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 671 place count 185 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 673 place count 183 transition count 128
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 674 place count 183 transition count 128
Applied a total of 674 rules in 45 ms. Remains 183 /538 variables (removed 355) and now considering 128/451 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 183/538 places, 128/451 transitions.
RANDOM walk for 947 steps (40 resets) in 12 ms. (72 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 16 factoid took 1995 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 451/451 transitions.
Applied a total of 0 rules in 17 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-21 16:41:15] [INFO ] Invariant cache hit.
[2024-05-21 16:41:15] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-21 16:41:15] [INFO ] Invariant cache hit.
[2024-05-21 16:41:16] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
Running 450 sub problems to find dead transitions.
[2024-05-21 16:41:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 16:41:26] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:41:26] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:41:26] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:41:26] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:41:26] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:41:27] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 4 ms to minimize.
[2024-05-21 16:41:27] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:41:27] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:41:27] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:41:27] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:41:27] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:41:28] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:41:28] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:41:28] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:41:28] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:41:28] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:41:28] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:41:28] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:41:28] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:41:29] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-05-21 16:41:29] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 4 ms to minimize.
[2024-05-21 16:41:29] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:41:29] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:41:29] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:41:30] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:41:30] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:41:30] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:41:30] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:41:30] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 5 ms to minimize.
[2024-05-21 16:41:30] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:41:30] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:41:31] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:41:31] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:41:31] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:41:31] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:41:31] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:41:31] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:41:32] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:41:32] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 2 ms to minimize.
[2024-05-21 16:41:32] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
Problem TDEAD428 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 1 solved, 449 unsolved
[2024-05-21 16:41:33] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:41:33] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:41:33] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:41:33] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 2 ms to minimize.
[2024-05-21 16:41:33] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:41:33] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:41:34] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:41:34] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:41:34] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:41:34] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:41:34] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-21 16:41:34] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:41:34] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:41:35] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:41:35] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:41:35] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:41:35] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:41:35] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:41:35] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:41:35] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 1 solved, 449 unsolved
[2024-05-21 16:41:39] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:41:39] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:41:39] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:41:39] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:41:39] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:41:40] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:41:40] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 6 ms to minimize.
[2024-05-21 16:41:40] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:41:40] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:41:40] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:41:40] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:41:40] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:41:41] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:41:41] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:41:41] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:41:41] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:41:41] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:41:42] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:41:42] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:41:42] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 1 solved, 449 unsolved
[2024-05-21 16:41:42] [INFO ] Deduced a trap composed of 90 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:41:43] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:41:43] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:41:43] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:41:43] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:41:43] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:41:43] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:41:43] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:41:44] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:41:44] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
[2024-05-21 16:41:44] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:41:44] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:41:44] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:41:44] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:41:44] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:41:44] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:41:45] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:41:45] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:41:45] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:41:45] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 1 solved, 449 unsolved
[2024-05-21 16:41:46] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:41:46] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:41:46] [INFO ] Deduced a trap composed of 71 places in 148 ms of which 3 ms to minimize.
SMT process timed out in 30120ms, After SMT, problems are : Problem set: 1 solved, 449 unsolved
Search for dead transitions found 1 dead transitions in 30126ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/538 places, 450/451 transitions.
Applied a total of 0 rules in 13 ms. Remains 538 /538 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31074 ms. Remains : 538/538 places, 450/451 transitions.
Computed a total of 470 stabilizing places and 392 stable transitions
Graph (complete) has 1161 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 470 stabilizing places and 392 stable transitions
Detected a total of 470/538 stabilizing places and 392/450 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 795 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40002 steps (200 resets) in 209 ms. (190 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (36 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (34 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (34 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
// Phase 1: matrix 450 rows 538 cols
[2024-05-21 16:41:47] [INFO ] Computed 107 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 196/199 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/401 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 2 ms to minimize.
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 127/528 variables, 42/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:41:48] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:41:49] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:41:49] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:41:49] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:41:49] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:41:49] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:41:49] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:41:49] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/531 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 445/976 variables, 531/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/976 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 11/987 variables, 6/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/987 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/988 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/988 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/988 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 988/988 variables, and 664 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2163 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 196/199 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/401 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:41:50] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:41:50] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:41:50] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:41:50] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:41:50] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 127/528 variables, 42/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/531 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 445/976 variables, 531/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/976 variables, 3/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:41:51] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/976 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/976 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 11/987 variables, 6/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/987 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/988 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/988 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/988 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 988/988 variables, and 673 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1469 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 25/25 constraints]
After SMT, in 3645ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 287 ms.
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 450/450 transitions.
Graph (trivial) has 250 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1154 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 531 transition count 374
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 464 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 463 transition count 373
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 138 place count 463 transition count 262
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 382 place count 330 transition count 262
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 283 rules applied. Total rules applied 665 place count 187 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 669 place count 185 transition count 129
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 671 place count 185 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 673 place count 183 transition count 127
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 674 place count 183 transition count 127
Applied a total of 674 rules in 48 ms. Remains 183 /538 variables (removed 355) and now considering 127/450 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 183/538 places, 127/450 transitions.
RANDOM walk for 1062 steps (47 resets) in 12 ms. (81 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 16 factoid took 1872 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 33406 reset in 232 ms.
Product exploration explored 100000 steps with 33350 reset in 218 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 450/450 transitions.
Graph (trivial) has 250 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1155 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 531 transition count 442
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 85 Pre rules applied. Total rules applied 64 place count 531 transition count 501
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 149 place count 531 transition count 501
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 176 place count 504 transition count 456
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 203 place count 504 transition count 456
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 1 with 171 rules applied. Total rules applied 374 place count 504 transition count 456
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 419 place count 459 transition count 411
Deduced a syphon composed of 246 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 464 place count 459 transition count 411
Deduced a syphon composed of 246 places in 1 ms
Applied a total of 464 rules in 97 ms. Remains 459 /538 variables (removed 79) and now considering 411/450 (removed 39) transitions.
[2024-05-21 16:41:55] [INFO ] Redundant transitions in 8 ms returned []
Running 410 sub problems to find dead transitions.
// Phase 1: matrix 411 rows 459 cols
[2024-05-21 16:41:55] [INFO ] Computed 107 invariants in 10 ms
[2024-05-21 16:41:55] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 410 unsolved
[2024-05-21 16:42:04] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:42:04] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:42:04] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:42:05] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-21 16:42:05] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:42:05] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:42:05] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-21 16:42:05] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:42:05] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:42:05] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-21 16:42:06] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-05-21 16:42:06] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:42:06] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-21 16:42:06] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:42:06] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:42:06] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 2 ms to minimize.
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 TDEAD25 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
[2024-05-21 16:42:06] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 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 TDEAD14 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 TDEAD25 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 TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 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 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 TDEAD201 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 TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 20/127 constraints. Problems are: Problem set: 157 solved, 253 unsolved
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
[2024-05-21 16:42:07] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
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 TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/147 constraints. Problems are: Problem set: 217 solved, 193 unsolved
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-21 16:42:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-21 16:42:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-21 16:42:09] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-21 16:42:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-21 16:42:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 16:42:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 16:42:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-21 16:42:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/167 constraints. Problems are: Problem set: 255 solved, 155 unsolved
[2024-05-21 16:42:10] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
[2024-05-21 16:42:10] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 16:42:10] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-21 16:42:10] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 16:42:10] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-21 16:42:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-21 16:42:10] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-21 16:42:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-21 16:42:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-21 16:42:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-21 16:42:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-21 16:42:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-21 16:42:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-21 16:42:11] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:42:11] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:42:11] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:42:11] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:42:11] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-05-21 16:42:11] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-21 16:42:12] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/187 constraints. Problems are: Problem set: 278 solved, 132 unsolved
[2024-05-21 16:42:12] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:42:12] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:42:12] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:42:12] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:42:12] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:42:13] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:42:13] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 4 ms to minimize.
[2024-05-21 16:42:13] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-05-21 16:42:13] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-21 16:42:13] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:42:13] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-05-21 16:42:13] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:42:14] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-05-21 16:42:14] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-21 16:42:14] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:42:14] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:42:14] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:42:14] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD216 is UNSAT
[2024-05-21 16:42:14] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
Problem TDEAD218 is UNSAT
[2024-05-21 16:42:14] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 20/207 constraints. Problems are: Problem set: 289 solved, 121 unsolved
[2024-05-21 16:42:15] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:42:15] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:42:15] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:42:15] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:42:16] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:42:16] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 2 ms to minimize.
Problem TDEAD226 is UNSAT
[2024-05-21 16:42:16] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:42:16] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:42:16] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:42:17] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:42:17] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:42:17] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-05-21 16:42:17] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:42:17] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:42:17] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:42:18] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:42:18] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:42:18] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:42:18] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 19/226 constraints. Problems are: Problem set: 290 solved, 120 unsolved
[2024-05-21 16:42:20] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:42:20] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:42:20] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:42:21] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:42:21] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:42:21] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:42:21] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:42:21] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:42:21] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 9/235 constraints. Problems are: Problem set: 290 solved, 120 unsolved
[2024-05-21 16:42:22] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:42:22] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:42:23] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2024-05-21 16:42:23] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:42:23] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:42:23] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:42:23] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:42:24] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:42:24] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:42:24] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 10/245 constraints. Problems are: Problem set: 290 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/870 variables, and 245 constraints, problems are : Problem set: 290 solved, 120 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/459 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 138/138 constraints]
Escalating to Integer solving :Problem set: 290 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 290 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 196/414 variables, 65/65 constraints. Problems are: Problem set: 290 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 1/66 constraints. Problems are: Problem set: 290 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 138/204 constraints. Problems are: Problem set: 290 solved, 120 unsolved
[2024-05-21 16:42:26] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:42:27] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:42:27] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:42:27] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:42:27] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:42:27] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:42:27] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:42:27] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:42:27] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:42:27] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:42:27] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:42:28] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:42:28] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:42:28] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:42:28] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:42:28] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:42:28] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:42:29] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:42:29] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:42:29] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 20/224 constraints. Problems are: Problem set: 290 solved, 120 unsolved
[2024-05-21 16:42:29] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:42:29] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:42:30] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:42:30] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:42:30] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:42:30] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:42:30] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:42:30] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 8/232 constraints. Problems are: Problem set: 290 solved, 120 unsolved
[2024-05-21 16:42:31] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:42:32] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:42:32] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:42:32] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:42:32] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 5/237 constraints. Problems are: Problem set: 290 solved, 120 unsolved
[2024-05-21 16:42:33] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 1/238 constraints. Problems are: Problem set: 290 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/238 constraints. Problems are: Problem set: 290 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 45/459 variables, 41/279 constraints. Problems are: Problem set: 290 solved, 120 unsolved
[2024-05-21 16:42:35] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:42:35] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:42:35] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:42:35] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:42:36] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 5/284 constraints. Problems are: Problem set: 290 solved, 120 unsolved
[2024-05-21 16:42:37] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 1/285 constraints. Problems are: Problem set: 290 solved, 120 unsolved
[2024-05-21 16:42:38] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:42:38] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 2/287 constraints. Problems are: Problem set: 290 solved, 120 unsolved
[2024-05-21 16:42:40] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 1/288 constraints. Problems are: Problem set: 290 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 0/288 constraints. Problems are: Problem set: 290 solved, 120 unsolved
Problem TDEAD102 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 15 (OVERLAPS) 410/869 variables, 459/747 constraints. Problems are: Problem set: 301 solved, 109 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/869 variables, 11/758 constraints. Problems are: Problem set: 301 solved, 109 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/869 variables, 109/867 constraints. Problems are: Problem set: 301 solved, 109 unsolved
[2024-05-21 16:42:51] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/870 variables, and 868 constraints, problems are : Problem set: 301 solved, 109 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 459/459 constraints, ReadFeed: 11/12 constraints, PredecessorRefiner: 109/410 constraints, Known Traps: 182/182 constraints]
After SMT, in 60343ms problems are : Problem set: 301 solved, 109 unsolved
Search for dead transitions found 301 dead transitions in 60349ms
Found 301 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 301 transitions
Dead transitions reduction (with SMT) removed 301 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 459/538 places, 110/450 transitions.
Graph (complete) has 812 edges and 459 vertex of which 213 are kept as prefixes of interest. Removing 246 places using SCC suffix rule.1 ms
Discarding 246 places :
Also discarding 0 output transitions
Ensure Unique test removed 35 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 178 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 13 ms. Remains 178 /459 variables (removed 281) and now considering 127/110 (removed -17) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 178/538 places, 127/450 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60478 ms. Remains : 178/538 places, 127/450 transitions.
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 450/450 transitions.
Applied a total of 0 rules in 9 ms. Remains 538 /538 variables (removed 0) and now considering 450/450 (removed 0) transitions.
// Phase 1: matrix 450 rows 538 cols
[2024-05-21 16:42:55] [INFO ] Computed 107 invariants in 7 ms
[2024-05-21 16:42:56] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-21 16:42:56] [INFO ] Invariant cache hit.
[2024-05-21 16:42:56] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-05-21 16:42:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 16:43:06] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:43:06] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:43:07] [INFO ] Deduced a trap composed of 68 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:43:07] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:43:07] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:43:07] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:43:07] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:43:07] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:43:08] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:43:08] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:43:08] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:43:08] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:43:08] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:43:08] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:43:08] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:43:09] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:43:09] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:43:09] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:43:09] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:43:09] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 16:43:10] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:43:10] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:43:10] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:43:10] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 4 ms to minimize.
[2024-05-21 16:43:10] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:43:10] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:43:10] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:43:11] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:43:11] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:43:11] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:43:11] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:43:11] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:43:11] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:43:12] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:43:12] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:43:12] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:43:12] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:43:12] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:43:12] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:43:12] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 2 solved, 447 unsolved
[2024-05-21 16:43:13] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:43:13] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:43:13] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 2 ms to minimize.
[2024-05-21 16:43:13] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:43:13] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:43:14] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:43:14] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:43:14] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:43:14] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:43:14] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:43:14] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:43:14] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:43:15] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:43:15] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:43:15] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:43:15] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:43:15] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:43:15] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:43:15] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:43:16] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
Problem TDEAD426 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 3 solved, 446 unsolved
[2024-05-21 16:43:19] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:43:19] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:43:20] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:43:20] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 4 ms to minimize.
[2024-05-21 16:43:20] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:43:20] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:43:20] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:43:20] [INFO ] Deduced a trap composed of 69 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:43:20] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:43:21] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:43:21] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:43:21] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:43:21] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:43:21] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 2 ms to minimize.
[2024-05-21 16:43:21] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:43:22] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:43:22] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:43:22] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:43:22] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:43:22] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 3 solved, 446 unsolved
[2024-05-21 16:43:22] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:43:23] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:43:23] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:43:23] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:43:23] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:43:24] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:43:24] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 4 ms to minimize.
[2024-05-21 16:43:24] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:43:24] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:43:24] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 4 ms to minimize.
[2024-05-21 16:43:24] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:43:25] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:43:25] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:43:25] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:43:25] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:43:25] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:43:25] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:43:26] [INFO ] Deduced a trap composed of 86 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:43:26] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:43:26] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 3 solved, 446 unsolved
[2024-05-21 16:43:26] [INFO ] Deduced a trap composed of 87 places in 181 ms of which 3 ms to minimize.
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 3 solved, 446 unsolved
Search for dead transitions found 3 dead transitions in 30177ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/538 places, 447/450 transitions.
Applied a total of 0 rules in 13 ms. Remains 538 /538 variables (removed 0) and now considering 447/447 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31009 ms. Remains : 538/538 places, 447/450 transitions.
Treatment of property BusinessProcesses-PT-20-LTLFireability-05 finished in 141340 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||(F((p1||G(p2))) U p3))))'
Support contains 2 out of 551 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Graph (trivial) has 259 edges and 551 vertex of which 6 / 551 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 1182 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 543 transition count 384
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 473 transition count 384
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 142 place count 473 transition count 272
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 388 place count 339 transition count 272
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 395 place count 332 transition count 265
Iterating global reduction 2 with 7 rules applied. Total rules applied 402 place count 332 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 402 place count 332 transition count 264
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 404 place count 331 transition count 264
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 279 rules applied. Total rules applied 683 place count 189 transition count 127
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 689 place count 186 transition count 133
Applied a total of 689 rules in 52 ms. Remains 186 /551 variables (removed 365) and now considering 133/463 (removed 330) transitions.
[2024-05-21 16:43:27] [INFO ] Flow matrix only has 132 transitions (discarded 1 similar events)
// Phase 1: matrix 132 rows 186 cols
[2024-05-21 16:43:27] [INFO ] Computed 81 invariants in 1 ms
[2024-05-21 16:43:27] [INFO ] Implicit Places using invariants in 162 ms returned [26, 27, 28, 29, 30, 35, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 163 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/551 places, 133/463 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 163/551 places, 133/463 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-07 finished in 278 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(F(p0)))'
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 455
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 455
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 451
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 451
Applied a total of 24 rules in 40 ms. Remains 539 /551 variables (removed 12) and now considering 451/463 (removed 12) transitions.
// Phase 1: matrix 451 rows 539 cols
[2024-05-21 16:43:27] [INFO ] Computed 108 invariants in 4 ms
[2024-05-21 16:43:27] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-21 16:43:27] [INFO ] Invariant cache hit.
[2024-05-21 16:43:28] [INFO ] Implicit Places using invariants and state equation in 647 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 888 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 451/463 transitions.
Applied a total of 0 rules in 14 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 943 ms. Remains : 538/551 places, 451/463 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Computed a total of 470 stabilizing places and 393 stable transitions
Graph (complete) has 1163 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 470 stabilizing places and 393 stable transitions
Detected a total of 470/538 stabilizing places and 393/451 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 25 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLFireability-08 finished in 1524 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(G((p0 U p1)))))'
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 455
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 455
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 540 transition count 452
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 540 transition count 452
Applied a total of 22 rules in 39 ms. Remains 540 /551 variables (removed 11) and now considering 452/463 (removed 11) transitions.
// Phase 1: matrix 452 rows 540 cols
[2024-05-21 16:43:28] [INFO ] Computed 108 invariants in 8 ms
[2024-05-21 16:43:29] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-21 16:43:29] [INFO ] Invariant cache hit.
[2024-05-21 16:43:29] [INFO ] Implicit Places using invariants and state equation in 584 ms returned [61]
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 : 539/551 places, 452/463 transitions.
Applied a total of 0 rules in 10 ms. Remains 539 /539 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 895 ms. Remains : 539/551 places, 452/463 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-11 finished in 1117 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(F(((p0&&G(p1))||(p2&&(p0 U X(p3)))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 455
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 455
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 540 transition count 452
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 540 transition count 452
Applied a total of 22 rules in 48 ms. Remains 540 /551 variables (removed 11) and now considering 452/463 (removed 11) transitions.
// Phase 1: matrix 452 rows 540 cols
[2024-05-21 16:43:29] [INFO ] Computed 108 invariants in 8 ms
[2024-05-21 16:43:30] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-21 16:43:30] [INFO ] Invariant cache hit.
[2024-05-21 16:43:30] [INFO ] Implicit Places using invariants and state equation in 559 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 791 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 452/463 transitions.
Applied a total of 0 rules in 10 ms. Remains 539 /539 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 849 ms. Remains : 539/551 places, 452/463 transitions.
Stuttering acceptance computed with spot in 388 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-12
Stuttering criterion allowed to conclude after 265 steps with 1 reset in 2 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-12 finished in 1268 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||X(F(p0))))||((!p0||X(F(p0)))&&F(G(p1))))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 455
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 455
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 451
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 451
Applied a total of 24 rules in 62 ms. Remains 539 /551 variables (removed 12) and now considering 451/463 (removed 12) transitions.
// Phase 1: matrix 451 rows 539 cols
[2024-05-21 16:43:31] [INFO ] Computed 108 invariants in 7 ms
[2024-05-21 16:43:31] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-21 16:43:31] [INFO ] Invariant cache hit.
[2024-05-21 16:43:32] [INFO ] Implicit Places using invariants and state equation in 667 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 937 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 451/463 transitions.
Applied a total of 0 rules in 12 ms. Remains 538 /538 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1011 ms. Remains : 538/551 places, 451/463 transitions.
Stuttering acceptance computed with spot in 209 ms :[false, false, (NOT p0), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-14
Product exploration explored 100000 steps with 508 reset in 357 ms.
Product exploration explored 100000 steps with 510 reset in 311 ms.
Computed a total of 470 stabilizing places and 393 stable transitions
Graph (complete) has 1165 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 470 stabilizing places and 393 stable transitions
Detected a total of 470/538 stabilizing places and 393/451 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (199 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 35468 steps (32 resets) in 388 ms. (91 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 356 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[false, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 451/451 transitions.
Graph (trivial) has 251 edges and 538 vertex of which 6 / 538 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 1159 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 530 transition count 375
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 463 transition count 375
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 136 place count 463 transition count 264
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 380 place count 330 transition count 264
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 287 rules applied. Total rules applied 667 place count 184 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 671 place count 182 transition count 130
Applied a total of 671 rules in 50 ms. Remains 182 /538 variables (removed 356) and now considering 130/451 (removed 321) transitions.
[2024-05-21 16:43:34] [INFO ] Flow matrix only has 129 transitions (discarded 1 similar events)
// Phase 1: matrix 129 rows 182 cols
[2024-05-21 16:43:34] [INFO ] Computed 80 invariants in 2 ms
[2024-05-21 16:43:34] [INFO ] Implicit Places using invariants in 176 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 177 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/538 places, 130/451 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 158/538 places, 130/451 transitions.
Computed a total of 85 stabilizing places and 78 stable transitions
Computed a total of 85 stabilizing places and 78 stable transitions
Detected a total of 85/158 stabilizing places and 78/130 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 331 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (5911 resets) in 1250 ms. (31 steps per ms) remains 2/4 properties
BEST_FIRST walk for 35159 steps (1315 resets) in 272 ms. (128 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 705 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13583 reset in 401 ms.
Product exploration explored 100000 steps with 13417 reset in 337 ms.
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-21 16:43:37] [INFO ] Flow matrix only has 129 transitions (discarded 1 similar events)
// Phase 1: matrix 129 rows 158 cols
[2024-05-21 16:43:37] [INFO ] Computed 56 invariants in 2 ms
[2024-05-21 16:43:37] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 16:43:37] [INFO ] Flow matrix only has 129 transitions (discarded 1 similar events)
[2024-05-21 16:43:37] [INFO ] Invariant cache hit.
[2024-05-21 16:43:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 16:43:37] [INFO ] Implicit Places using invariants and state equation in 241 ms returned [6, 25, 44, 46, 48, 57, 91, 93, 95, 97, 99, 101, 103, 138]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 375 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/158 places, 130/130 transitions.
Graph (complete) has 474 edges and 144 vertex of which 135 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 135 transition count 122
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 131 transition count 122
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 12 place count 128 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 128 transition count 116
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 128 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 127 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 18 place count 126 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 126 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 21 place count 126 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 22 place count 125 transition count 112
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 28 place count 122 transition count 109
Applied a total of 28 rules in 8 ms. Remains 122 /144 variables (removed 22) and now considering 109/130 (removed 21) transitions.
[2024-05-21 16:43:37] [INFO ] Flow matrix only has 108 transitions (discarded 1 similar events)
// Phase 1: matrix 108 rows 122 cols
[2024-05-21 16:43:37] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 16:43:37] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 16:43:37] [INFO ] Flow matrix only has 108 transitions (discarded 1 similar events)
[2024-05-21 16:43:37] [INFO ] Invariant cache hit.
[2024-05-21 16:43:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 16:43:37] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 247 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/158 places, 109/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 635 ms. Remains : 121/158 places, 109/130 transitions.
Treatment of property BusinessProcesses-PT-20-LTLFireability-14 finished in 6679 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 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Graph (trivial) has 263 edges and 551 vertex of which 6 / 551 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 1182 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 543 transition count 382
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 471 transition count 382
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 146 place count 471 transition count 270
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 391 place count 338 transition count 270
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 400 place count 329 transition count 261
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 329 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 409 place count 329 transition count 260
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 411 place count 328 transition count 260
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 279 rules applied. Total rules applied 690 place count 186 transition count 123
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 696 place count 183 transition count 129
Applied a total of 696 rules in 27 ms. Remains 183 /551 variables (removed 368) and now considering 129/463 (removed 334) transitions.
[2024-05-21 16:43:37] [INFO ] Flow matrix only has 128 transitions (discarded 1 similar events)
// Phase 1: matrix 128 rows 183 cols
[2024-05-21 16:43:37] [INFO ] Computed 82 invariants in 1 ms
[2024-05-21 16:43:38] [INFO ] Implicit Places using invariants in 145 ms returned [26, 27, 28, 29, 30, 35, 36, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 58, 159]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 147 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/551 places, 129/463 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 158/551 places, 129/463 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-15 finished in 234 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((X(p0)||F((p1&&X((p1 U (p2||G(p1)))))))))'
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((p0||X((p1||(p2&&G(p3)))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-20-LTLFireability-04
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 551/551 places, 463/463 transitions.
Graph (trivial) has 260 edges and 551 vertex of which 6 / 551 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 1182 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 543 transition count 384
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 473 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 472 transition count 383
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 144 place count 472 transition count 273
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 384 place count 342 transition count 273
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 392 place count 334 transition count 265
Iterating global reduction 3 with 8 rules applied. Total rules applied 400 place count 334 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 400 place count 334 transition count 264
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 402 place count 333 transition count 264
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 283 rules applied. Total rules applied 685 place count 189 transition count 125
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 691 place count 186 transition count 131
Applied a total of 691 rules in 65 ms. Remains 186 /551 variables (removed 365) and now considering 131/463 (removed 332) transitions.
[2024-05-21 16:43:38] [INFO ] Flow matrix only has 130 transitions (discarded 1 similar events)
// Phase 1: matrix 130 rows 186 cols
[2024-05-21 16:43:38] [INFO ] Computed 83 invariants in 2 ms
[2024-05-21 16:43:38] [INFO ] Implicit Places using invariants in 192 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 45, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 146]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 195 ms to find 25 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 161/551 places, 131/463 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 263 ms. Remains : 161/551 places, 131/463 transitions.
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-04
Product exploration explored 100000 steps with 16967 reset in 268 ms.
Product exploration explored 100000 steps with 16892 reset in 302 ms.
Computed a total of 83 stabilizing places and 75 stable transitions
Computed a total of 83 stabilizing places and 75 stable transitions
Detected a total of 83/161 stabilizing places and 75/131 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 164 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
RANDOM walk for 40000 steps (6952 resets) in 510 ms. (78 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (1645 resets) in 177 ms. (224 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (1673 resets) in 168 ms. (236 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (1692 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2024-05-21 16:43:40] [INFO ] Flow matrix only has 130 transitions (discarded 1 similar events)
// Phase 1: matrix 130 rows 161 cols
[2024-05-21 16:43:40] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 16:43:40] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
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) 43/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/123 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/155 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/159 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 129/288 variables, 159/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/290 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/290 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/291 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 161/161 constraints, ReadFeed: 6/6 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) 43/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/123 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:43:40] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/155 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/159 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 129/288 variables, 159/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/290 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/290 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/290 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/291 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 161/161 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 365ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 131/131 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 160 transition count 129
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 160 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 158 transition count 127
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 158 transition count 127
Applied a total of 8 rules in 13 ms. Remains 158 /161 variables (removed 3) and now considering 127/131 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 158/161 places, 127/131 transitions.
RANDOM walk for 10430 steps (549 resets) in 54 ms. (189 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p1 p2) (OR p1 p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 8 factoid took 409 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 131/131 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-21 16:43:41] [INFO ] Flow matrix only has 130 transitions (discarded 1 similar events)
[2024-05-21 16:43:41] [INFO ] Invariant cache hit.
[2024-05-21 16:43:41] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 16:43:41] [INFO ] Flow matrix only has 130 transitions (discarded 1 similar events)
[2024-05-21 16:43:41] [INFO ] Invariant cache hit.
[2024-05-21 16:43:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 16:43:41] [INFO ] Implicit Places using invariants and state equation in 256 ms returned [6, 8, 25, 49, 51, 53, 61, 95, 97, 99, 101, 103, 105, 107, 141, 151]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 412 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/161 places, 131/131 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 143 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 143 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 141 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 141 transition count 126
Applied a total of 8 rules in 3 ms. Remains 141 /145 variables (removed 4) and now considering 126/131 (removed 5) transitions.
[2024-05-21 16:43:41] [INFO ] Flow matrix only has 125 transitions (discarded 1 similar events)
// Phase 1: matrix 125 rows 141 cols
[2024-05-21 16:43:41] [INFO ] Computed 42 invariants in 1 ms
[2024-05-21 16:43:41] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 16:43:41] [INFO ] Flow matrix only has 125 transitions (discarded 1 similar events)
[2024-05-21 16:43:41] [INFO ] Invariant cache hit.
[2024-05-21 16:43:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:43:42] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/161 places, 126/131 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 727 ms. Remains : 141/161 places, 126/131 transitions.
Computed a total of 63 stabilizing places and 70 stable transitions
Graph (complete) has 464 edges and 141 vertex of which 132 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Computed a total of 63 stabilizing places and 70 stable transitions
Detected a total of 63/141 stabilizing places and 70/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 169 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
RANDOM walk for 40000 steps (6697 resets) in 628 ms. (63 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (1723 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1701 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1735 resets) in 145 ms. (273 steps per ms) remains 1/3 properties
[2024-05-21 16:43:42] [INFO ] Flow matrix only has 125 transitions (discarded 1 similar events)
[2024-05-21 16:43:42] [INFO ] Invariant cache hit.
[2024-05-21 16:43:42] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
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) 45/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/105 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/125 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/129 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 121/250 variables, 129/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/265 variables, 12/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/265 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/266 variables, and 188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 141/141 constraints, ReadFeed: 5/5 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) 45/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/105 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:43:43] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:43:43] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:43:43] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:43:43] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:43:43] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:43:43] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:43:43] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 20/125 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/129 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 121/250 variables, 129/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/265 variables, 12/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/265 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/266 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 141/141 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 590ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p1 p2) (OR p1 p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 8 factoid took 461 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Product exploration explored 100000 steps with 16894 reset in 256 ms.
Product exploration explored 100000 steps with 16895 reset in 250 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 126/126 transitions.
Graph (complete) has 464 edges and 141 vertex of which 132 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
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 132 transition count 122
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 129 transition count 114
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 129 transition count 114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 129 transition count 115
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 14 rules in 11 ms. Remains 129 /141 variables (removed 12) and now considering 115/126 (removed 11) transitions.
[2024-05-21 16:43:45] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 16:43:45] [INFO ] Flow matrix only has 114 transitions (discarded 1 similar events)
// Phase 1: matrix 114 rows 129 cols
[2024-05-21 16:43:45] [INFO ] Computed 37 invariants in 4 ms
[2024-05-21 16:43:45] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/129 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-21 16:43:46] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:43:46] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:43:46] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:43:46] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-21 16:43:47] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:43:48] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:43:49] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 17/74 constraints. Problems are: Problem set: 8 solved, 100 unsolved
[2024-05-21 16:43:49] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:43:49] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:43:49] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:43:49] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 4/78 constraints. Problems are: Problem set: 8 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/78 constraints. Problems are: Problem set: 8 solved, 100 unsolved
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
At refinement iteration 9 (OVERLAPS) 113/242 variables, 129/207 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 5/212 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/212 constraints. Problems are: Problem set: 15 solved, 93 unsolved
[2024-05-21 16:43:50] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:43:51] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:43:51] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:43:51] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/242 variables, 4/216 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/216 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 14 (OVERLAPS) 0/242 variables, 0/216 constraints. Problems are: Problem set: 15 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/243 variables, and 216 constraints, problems are : Problem set: 15 solved, 93 unsolved in 7144 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 15 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 5/5 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 16/21 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 8/129 variables, 30/51 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/53 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 29/82 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/82 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 113/242 variables, 129/211 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 5/216 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 93/309 constraints. Problems are: Problem set: 15 solved, 93 unsolved
[2024-05-21 16:43:54] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:43:54] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:43:54] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:43:55] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:43:55] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:43:55] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 3 ms to minimize.
[2024-05-21 16:43:55] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:43:55] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:43:55] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:43:55] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 10/319 constraints. Problems are: Problem set: 15 solved, 93 unsolved
[2024-05-21 16:43:57] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:43:57] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:43:57] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:43:57] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:43:58] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:43:58] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:43:58] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:43:58] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:43:58] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 9/328 constraints. Problems are: Problem set: 15 solved, 93 unsolved
[2024-05-21 16:44:01] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:44:01] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:44:01] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 3/331 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/331 constraints. Problems are: Problem set: 15 solved, 93 unsolved
At refinement iteration 14 (OVERLAPS) 0/242 variables, 0/331 constraints. Problems are: Problem set: 15 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/243 variables, and 331 constraints, problems are : Problem set: 15 solved, 93 unsolved in 14886 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 93/108 constraints, Known Traps: 67/67 constraints]
After SMT, in 22163ms problems are : Problem set: 15 solved, 93 unsolved
Search for dead transitions found 15 dead transitions in 22167ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 129/141 places, 100/126 transitions.
Graph (complete) has 402 edges and 129 vertex of which 122 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 120 /129 variables (removed 9) and now considering 100/100 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/141 places, 100/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22189 ms. Remains : 120/141 places, 100/126 transitions.
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 141 /141 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-21 16:44:07] [INFO ] Flow matrix only has 125 transitions (discarded 1 similar events)
// Phase 1: matrix 125 rows 141 cols
[2024-05-21 16:44:07] [INFO ] Computed 42 invariants in 2 ms
[2024-05-21 16:44:07] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 16:44:07] [INFO ] Flow matrix only has 125 transitions (discarded 1 similar events)
[2024-05-21 16:44:07] [INFO ] Invariant cache hit.
[2024-05-21 16:44:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:44:07] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-21 16:44:07] [INFO ] Flow matrix only has 125 transitions (discarded 1 similar events)
[2024-05-21 16:44:07] [INFO ] Invariant cache hit.
[2024-05-21 16:44:07] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 16:44:08] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 16:44:08] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 2/14 constraints. Problems are: Problem set: 4 solved, 115 unsolved
[2024-05-21 16:44:08] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/15 constraints. Problems are: Problem set: 6 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 6 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 1/141 variables, 29/44 constraints. Problems are: Problem set: 6 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 1/45 constraints. Problems are: Problem set: 6 solved, 113 unsolved
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:44:10] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 20/65 constraints. Problems are: Problem set: 6 solved, 113 unsolved
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:44:11] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:44:12] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 20/85 constraints. Problems are: Problem set: 6 solved, 113 unsolved
[2024-05-21 16:44:13] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/86 constraints. Problems are: Problem set: 6 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/86 constraints. Problems are: Problem set: 6 solved, 113 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 11 (OVERLAPS) 124/265 variables, 141/227 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 5/232 constraints. Problems are: Problem set: 15 solved, 104 unsolved
[2024-05-21 16:44:14] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:44:14] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:44:14] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 3/235 constraints. Problems are: Problem set: 15 solved, 104 unsolved
[2024-05-21 16:44:15] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:44:15] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:44:15] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:44:15] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:44:15] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-21 16:44:15] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:44:15] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:44:15] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:44:15] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:44:16] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:44:16] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:44:16] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:44:16] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:44:16] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:44:16] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:44:16] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:44:16] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:44:16] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 18/253 constraints. Problems are: Problem set: 15 solved, 104 unsolved
[2024-05-21 16:44:16] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-05-21 16:44:16] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:44:17] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:44:17] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:44:17] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:44:17] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:44:17] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:44:17] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:44:17] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:44:17] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:44:17] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:44:17] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:44:17] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 13/266 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 0/266 constraints. Problems are: Problem set: 15 solved, 104 unsolved
[2024-05-21 16:44:19] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:44:19] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2024-05-21 16:44:19] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2024-05-21 16:44:19] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:44:19] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:44:19] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:44:19] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2024-05-21 16:44:19] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:44:19] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:44:19] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/265 variables, 10/276 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/276 constraints. Problems are: Problem set: 15 solved, 104 unsolved
[2024-05-21 16:44:21] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:44:21] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:44:21] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:44:21] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:44:21] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:44:21] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:44:21] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:44:21] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/265 variables, 8/284 constraints. Problems are: Problem set: 15 solved, 104 unsolved
[2024-05-21 16:44:22] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:44:22] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/265 variables, 2/286 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/265 variables, 0/286 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 22 (OVERLAPS) 0/265 variables, 0/286 constraints. Problems are: Problem set: 15 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/266 variables, and 286 constraints, problems are : Problem set: 15 solved, 104 unsolved in 16572 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 141/141 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 15 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 10/12 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 58/70 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/70 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 1/141 variables, 29/99 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/100 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 40/140 constraints. Problems are: Problem set: 15 solved, 104 unsolved
[2024-05-21 16:44:25] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:44:25] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:44:25] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:44:25] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 4/144 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/144 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 124/265 variables, 141/285 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 5/290 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 104/394 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/394 constraints. Problems are: Problem set: 15 solved, 104 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/394 constraints. Problems are: Problem set: 15 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/266 variables, and 394 constraints, problems are : Problem set: 15 solved, 104 unsolved in 9345 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 141/141 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 104/119 constraints, Known Traps: 102/102 constraints]
After SMT, in 26002ms problems are : Problem set: 15 solved, 104 unsolved
Search for dead transitions found 15 dead transitions in 26003ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 141/141 places, 111/126 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 134 transition count 111
Applied a total of 7 rules in 3 ms. Remains 134 /141 variables (removed 7) and now considering 111/111 (removed 0) transitions.
[2024-05-21 16:44:33] [INFO ] Flow matrix only has 110 transitions (discarded 1 similar events)
// Phase 1: matrix 110 rows 134 cols
[2024-05-21 16:44:33] [INFO ] Computed 43 invariants in 4 ms
[2024-05-21 16:44:34] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 16:44:34] [INFO ] Flow matrix only has 110 transitions (discarded 1 similar events)
[2024-05-21 16:44:34] [INFO ] Invariant cache hit.
[2024-05-21 16:44:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:44:34] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [41, 43, 45]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 280 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/141 places, 111/126 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 129 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 129 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 129 transition count 108
Applied a total of 5 rules in 6 ms. Remains 129 /131 variables (removed 2) and now considering 108/111 (removed 3) transitions.
[2024-05-21 16:44:34] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
// Phase 1: matrix 107 rows 129 cols
[2024-05-21 16:44:34] [INFO ] Computed 40 invariants in 1 ms
[2024-05-21 16:44:34] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 16:44:34] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
[2024-05-21 16:44:34] [INFO ] Invariant cache hit.
[2024-05-21 16:44:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:44:34] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 129/141 places, 108/126 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 26833 ms. Remains : 129/141 places, 108/126 transitions.
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 56225 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)||(X((p1||X(p1))) U ((p2&&X((p1||X(p1))))||X(G((p1||X(p1))))))))'
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||X(F(p0))))||((!p0||X(F(p0)))&&F(G(p1))))))'
[2024-05-21 16:44:34] [INFO ] Flatten gal took : 53 ms
[2024-05-21 16:44:34] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-21 16:44:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 551 places, 463 transitions and 1411 arcs took 9 ms.
Total runtime 506288 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 551
TRANSITIONS: 463
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.016s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 7146
MODEL NAME: /home/mcc/execution/414/model
551 places, 463 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-20, 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 r047-tajo-171620398600604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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