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.r048-tajo-171620399800596.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 itstools
Input is BusinessProcesses-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 189K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716337493093

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 00:24:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:24:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:24:54] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-22 00:24:54] [INFO ] Transformed 772 places.
[2024-05-22 00:24:54] [INFO ] Transformed 685 transitions.
[2024-05-22 00:24:54] [INFO ] Found NUPN structural information;
[2024-05-22 00:24:54] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 15 places in 11 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 106 place count 651 transition count 572
Iterating global reduction 1 with 98 rules applied. Total rules applied 204 place count 651 transition count 572
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 255 place count 600 transition count 521
Iterating global reduction 1 with 51 rules applied. Total rules applied 306 place count 600 transition count 521
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 307 place count 599 transition count 520
Iterating global reduction 1 with 1 rules applied. Total rules applied 308 place count 599 transition count 520
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 309 place count 598 transition count 519
Iterating global reduction 1 with 1 rules applied. Total rules applied 310 place count 598 transition count 519
Applied a total of 310 rules in 205 ms. Remains 598 /757 variables (removed 159) and now considering 519/670 (removed 151) transitions.
// Phase 1: matrix 519 rows 598 cols
[2024-05-22 00:24:55] [INFO ] Computed 117 invariants in 36 ms
[2024-05-22 00:24:55] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-22 00:24:55] [INFO ] Invariant cache hit.
[2024-05-22 00:24:56] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
Running 518 sub problems to find dead transitions.
[2024-05-22 00:24:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 1/598 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/598 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 89 places in 202 ms of which 38 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 128 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 115 places in 4159 ms of which 4 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 113 places in 182 ms of which 6 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 134 places in 152 ms of which 6 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 132 places in 197 ms of which 3 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 92 places in 229 ms of which 3 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 2 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 133 places in 140 ms of which 9 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 111 places in 181 ms of which 4 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 6 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 136 places in 143 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 135 places in 172 ms of which 7 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 118 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 111 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:25:18] [INFO ] Deduced a trap composed of 129 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:25:19] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:25:19] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:25:19] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:25:19] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 6 ms to minimize.
[2024-05-22 00:25:19] [INFO ] Deduced a trap composed of 110 places in 178 ms of which 4 ms to minimize.
[2024-05-22 00:25:19] [INFO ] Deduced a trap composed of 119 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 114 places in 178 ms of which 4 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 117 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 116 places in 166 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 93 places in 209 ms of which 4 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 4 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 116 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 88 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 129 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 116 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 133 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 103 places in 180 ms of which 4 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 4 ms to minimize.
[2024-05-22 00:25:23] [INFO ] Deduced a trap composed of 91 places in 190 ms of which 4 ms to minimize.
[2024-05-22 00:25:23] [INFO ] Deduced a trap composed of 90 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:25:23] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:25:23] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:25:23] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:25:23] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1117 variables, and 177 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 1/598 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/598 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 60/177 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-22 00:25:31] [INFO ] Deduced a trap composed of 116 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:25:31] [INFO ] Deduced a trap composed of 116 places in 165 ms of which 4 ms to minimize.
[2024-05-22 00:25:31] [INFO ] Deduced a trap composed of 115 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:25:32] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 4 ms to minimize.
[2024-05-22 00:25:32] [INFO ] Deduced a trap composed of 133 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:25:32] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:25:32] [INFO ] Deduced a trap composed of 114 places in 305 ms of which 31 ms to minimize.
[2024-05-22 00:25:33] [INFO ] Deduced a trap composed of 115 places in 180 ms of which 7 ms to minimize.
[2024-05-22 00:25:33] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:25:33] [INFO ] Deduced a trap composed of 114 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:25:33] [INFO ] Deduced a trap composed of 127 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:25:33] [INFO ] Deduced a trap composed of 127 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:25:33] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:25:34] [INFO ] Deduced a trap composed of 111 places in 179 ms of which 5 ms to minimize.
[2024-05-22 00:25:34] [INFO ] Deduced a trap composed of 118 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:25:34] [INFO ] Deduced a trap composed of 114 places in 189 ms of which 3 ms to minimize.
[2024-05-22 00:25:34] [INFO ] Deduced a trap composed of 114 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:25:34] [INFO ] Deduced a trap composed of 119 places in 177 ms of which 4 ms to minimize.
[2024-05-22 00:25:35] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:25:35] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-22 00:25:35] [INFO ] Deduced a trap composed of 134 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:25:35] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:25:36] [INFO ] Deduced a trap composed of 113 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:25:36] [INFO ] Deduced a trap composed of 118 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:25:36] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:25:36] [INFO ] Deduced a trap composed of 116 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:25:36] [INFO ] Deduced a trap composed of 97 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:25:37] [INFO ] Deduced a trap composed of 99 places in 201 ms of which 2 ms to minimize.
[2024-05-22 00:25:37] [INFO ] Deduced a trap composed of 110 places in 175 ms of which 2 ms to minimize.
[2024-05-22 00:25:37] [INFO ] Deduced a trap composed of 104 places in 181 ms of which 4 ms to minimize.
[2024-05-22 00:25:37] [INFO ] Deduced a trap composed of 102 places in 198 ms of which 2 ms to minimize.
[2024-05-22 00:25:37] [INFO ] Deduced a trap composed of 103 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 114 places in 166 ms of which 4 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 104 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 110 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:25:38] [INFO ] Deduced a trap composed of 114 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 119 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 111 places in 178 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-22 00:25:39] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 133 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 116 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:25:40] [INFO ] Deduced a trap composed of 112 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 115 places in 166 ms of which 4 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 124 places in 187 ms of which 4 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 132 places in 162 ms of which 4 ms to minimize.
[2024-05-22 00:25:41] [INFO ] Deduced a trap composed of 105 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 4 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 103 places in 192 ms of which 3 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 104 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:25:42] [INFO ] Deduced a trap composed of 109 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 111 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 4 ms to minimize.
[2024-05-22 00:25:43] [INFO ] Deduced a trap composed of 121 places in 182 ms of which 4 ms to minimize.
Problem TDEAD464 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 20/237 constraints. Problems are: Problem set: 5 solved, 513 unsolved
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 118 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 114 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:25:44] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:25:45] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:25:45] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:25:45] [INFO ] Deduced a trap composed of 117 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:25:45] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:25:45] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:25:46] [INFO ] Deduced a trap composed of 101 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:25:46] [INFO ] Deduced a trap composed of 101 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:25:46] [INFO ] Deduced a trap composed of 105 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:25:46] [INFO ] Deduced a trap composed of 107 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:25:46] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:25:46] [INFO ] Deduced a trap composed of 114 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:25:47] [INFO ] Deduced a trap composed of 105 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:25:47] [INFO ] Deduced a trap composed of 105 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:25:47] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:25:47] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 20/257 constraints. Problems are: Problem set: 5 solved, 513 unsolved
[2024-05-22 00:25:48] [INFO ] Deduced a trap composed of 119 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:25:48] [INFO ] Deduced a trap composed of 100 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:25:48] [INFO ] Deduced a trap composed of 105 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 100 places in 167 ms of which 4 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 129 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 130 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 127 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 108 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:25:49] [INFO ] Deduced a trap composed of 125 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:25:50] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:25:50] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:25:50] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:25:50] [INFO ] Deduced a trap composed of 104 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:25:51] [INFO ] Deduced a trap composed of 97 places in 197 ms of which 4 ms to minimize.
[2024-05-22 00:25:51] [INFO ] Deduced a trap composed of 125 places in 190 ms of which 4 ms to minimize.
[2024-05-22 00:25:51] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:25:51] [INFO ] Deduced a trap composed of 102 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:25:51] [INFO ] Deduced a trap composed of 110 places in 148 ms of which 4 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:25:52] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 20/277 constraints. Problems are: Problem set: 5 solved, 513 unsolved
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 115 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 115 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 110 places in 165 ms of which 4 ms to minimize.
[2024-05-22 00:25:53] [INFO ] Deduced a trap composed of 114 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:25:54] [INFO ] Deduced a trap composed of 116 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:25:54] [INFO ] Deduced a trap composed of 112 places in 184 ms of which 4 ms to minimize.
[2024-05-22 00:25:54] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 4 ms to minimize.
[2024-05-22 00:25:54] [INFO ] Deduced a trap composed of 110 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:25:54] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:25:54] [INFO ] Deduced a trap composed of 122 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 136 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 117 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 4 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 117 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:25:55] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:25:56] [INFO ] Deduced a trap composed of 118 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:25:56] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:25:56] [INFO ] Deduced a trap composed of 109 places in 200 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 20/297 constraints. Problems are: Problem set: 5 solved, 513 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/1117 variables, and 297 constraints, problems are : Problem set: 5 solved, 513 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 0/518 constraints, Known Traps: 180/180 constraints]
After SMT, in 60273ms problems are : Problem set: 5 solved, 513 unsolved
Search for dead transitions found 5 dead transitions in 60297ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 598/757 places, 514/670 transitions.
Applied a total of 0 rules in 27 ms. Remains 598 /598 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61796 ms. Remains : 598/757 places, 514/670 transitions.
Support contains 37 out of 598 places after structural reductions.
[2024-05-22 00:25:56] [INFO ] Flatten gal took : 90 ms
[2024-05-22 00:25:57] [INFO ] Flatten gal took : 43 ms
[2024-05-22 00:25:57] [INFO ] Input system was already deterministic with 514 transitions.
RANDOM walk for 40000 steps (221 resets) in 3164 ms. (12 steps per ms) remains 18/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
// Phase 1: matrix 514 rows 598 cols
[2024-05-22 00:25:58] [INFO ] Computed 117 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 87/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 303/412 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 00:25:58] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:25:58] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:25:58] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:25:58] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:25:58] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:25:58] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:25:58] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:25:58] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:25:58] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:25:58] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 168/580 variables, 44/123 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 00:25:59] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:25:59] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:25:59] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:25:59] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 113 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:26:00] [INFO ] Deduced a trap composed of 108 places in 176 ms of which 4 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 110 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:26:01] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 114 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 118 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:26:02] [INFO ] Deduced a trap composed of 110 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 111 places in 214 ms of which 4 ms to minimize.
[2024-05-22 00:26:03] [INFO ] Deduced a trap composed of 109 places in 146 ms of which 3 ms to minimize.
SMT process timed out in 5124ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 514/514 transitions.
Graph (complete) has 1306 edges and 598 vertex of which 597 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 66 place count 597 transition count 448
Reduce places removed 65 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 68 rules applied. Total rules applied 134 place count 532 transition count 445
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 137 place count 529 transition count 445
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 137 place count 529 transition count 330
Deduced a syphon composed of 115 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 388 place count 393 transition count 330
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 395 place count 386 transition count 323
Iterating global reduction 3 with 7 rules applied. Total rules applied 402 place count 386 transition count 323
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 311 rules applied. Total rules applied 713 place count 228 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 714 place count 228 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 716 place count 227 transition count 172
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 724 place count 227 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 725 place count 226 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 726 place count 225 transition count 171
Applied a total of 726 rules in 166 ms. Remains 225 /598 variables (removed 373) and now considering 171/514 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 225/598 places, 171/514 transitions.
RANDOM walk for 40000 steps (4272 resets) in 914 ms. (43 steps per ms) remains 12/18 properties
BEST_FIRST walk for 40003 steps (1214 resets) in 267 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1200 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1232 resets) in 302 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1186 resets) in 234 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1204 resets) in 229 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1192 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1195 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1255 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1206 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1199 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1092 resets) in 117 ms. (339 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40001 steps (1064 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
// Phase 1: matrix 171 rows 225 cols
[2024-05-22 00:26:04] [INFO ] Computed 90 invariants in 2 ms
[2024-05-22 00:26:04] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 8/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 37/58 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 79/137 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:26:04] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:26:05] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 21/158 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 7/165 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 169/334 variables, 165/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/334 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/334 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 59/393 variables, 58/320 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/393 variables, 26/346 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/393 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 2/395 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/395 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 1/396 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/396 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 0/396 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 349 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2861 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 225/225 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 8/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 37/58 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 79/137 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 21/158 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 7/165 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 169/334 variables, 165/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/334 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/334 variables, 7/269 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/334 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/334 variables, 7/278 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/334 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/334 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 59/393 variables, 58/338 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/393 variables, 26/364 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/393 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 5 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/393 variables, 13/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/393 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/393 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (OVERLAPS) 2/395 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/395 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 1/396 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/396 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (OVERLAPS) 0/396 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 388 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 225/225 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 58/58 constraints]
After SMT, in 7883ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 6 properties in 2133 ms.
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 171/171 transitions.
Graph (trivial) has 25 edges and 225 vertex of which 2 / 225 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 224 transition count 163
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 218 transition count 163
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 218 transition count 154
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 35 place count 205 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 201 transition count 150
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 201 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 199 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 199 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 197 transition count 146
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 52 place count 197 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 196 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 196 transition count 145
Applied a total of 54 rules in 44 ms. Remains 196 /225 variables (removed 29) and now considering 145/171 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 196/225 places, 145/171 transitions.
RANDOM walk for 40000 steps (1889 resets) in 189 ms. (210 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (978 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
// Phase 1: matrix 145 rows 196 cols
[2024-05-22 00:26:14] [INFO ] Computed 86 invariants in 3 ms
[2024-05-22 00:26:14] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 97/104 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 45/149 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 32/181 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/181 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/181 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 39/220 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/220 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/220 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/227 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/227 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/227 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/232 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/232 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 108/340 variables, 124/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/340 variables, 28/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/340 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/340 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/341 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/341 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/341 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 4/4 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 97/104 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 45/149 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/181 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/181 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/181 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 39/220 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/220 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/220 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/227 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/227 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/227 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/232 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/232 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 108/340 variables, 124/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/340 variables, 28/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/340 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/340 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/341 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/341 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/341 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 68/68 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 145/145 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 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 195 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 195 transition count 143
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 4 place count 194 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 6 place count 193 transition count 142
Applied a total of 6 rules in 16 ms. Remains 193 /196 variables (removed 3) and now considering 142/145 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 193/196 places, 142/145 transitions.
RANDOM walk for 40000 steps (1914 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (941 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 64826 steps, run visited all 1 properties in 258 ms. (steps per millisecond=251 )
Probabilistic random walk after 64826 steps, saw 26572 distinct states, run finished after 262 ms. (steps per millisecond=247 ) properties seen :1
FORMULA BusinessProcesses-PT-19-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 540 stabilizing places and 466 stable transitions
Graph (complete) has 1306 edges and 598 vertex of which 597 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 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 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 499
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 495
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 495
Applied a total of 38 rules in 33 ms. Remains 579 /598 variables (removed 19) and now considering 495/514 (removed 19) transitions.
// Phase 1: matrix 495 rows 579 cols
[2024-05-22 00:26:16] [INFO ] Computed 117 invariants in 11 ms
[2024-05-22 00:26:16] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-22 00:26:16] [INFO ] Invariant cache hit.
[2024-05-22 00:26:16] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
Running 494 sub problems to find dead transitions.
[2024-05-22 00:26:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 72/113 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 494 unsolved
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 87 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 118 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 494 unsolved
[2024-05-22 00:26:30] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 99 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:26:31] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 110 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 494 unsolved
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 13 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 110 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 119 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 494 unsolved
[2024-05-22 00:26:41] [INFO ] Deduced a trap composed of 112 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:26:41] [INFO ] Deduced a trap composed of 119 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:26:41] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 124 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:26:42] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 113 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 6 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:26:43] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:26:44] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:26:44] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:26:44] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 2 ms to minimize.
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 2 solved, 492 unsolved
[2024-05-22 00:26:44] [INFO ] Deduced a trap composed of 101 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:26:44] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 113 places in 153 ms of which 5 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 99 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 3 ms to minimize.
SMT process timed out in 30214ms, After SMT, problems are : Problem set: 2 solved, 492 unsolved
Search for dead transitions found 2 dead transitions in 30220ms
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 : 579/598 places, 493/514 transitions.
Applied a total of 0 rules in 8 ms. Remains 579 /579 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31185 ms. Remains : 579/598 places, 493/514 transitions.
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-01
Entered a terminal (fully accepting) state of product in 134 steps with 0 reset in 5 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-01 finished in 31552 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) U G(p1))))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 582 transition count 498
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 582 transition count 498
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 578 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 578 transition count 494
Applied a total of 40 rules in 37 ms. Remains 578 /598 variables (removed 20) and now considering 494/514 (removed 20) transitions.
// Phase 1: matrix 494 rows 578 cols
[2024-05-22 00:26:47] [INFO ] Computed 117 invariants in 4 ms
[2024-05-22 00:26:47] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 00:26:47] [INFO ] Invariant cache hit.
[2024-05-22 00:26:48] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
Running 493 sub problems to find dead transitions.
[2024-05-22 00:26:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/111 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-05-22 00:26:59] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:26:59] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 4 ms to minimize.
[2024-05-22 00:26:59] [INFO ] Deduced a trap composed of 112 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:26:59] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:27:01] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:27:01] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:27:01] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:27:01] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:27:01] [INFO ] Deduced a trap composed of 124 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:27:01] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:27:01] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 109 places in 168 ms of which 2 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:27:04] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:04] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:27:04] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:27:04] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:27:04] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:27:04] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:04] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:27:04] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/157 constraints. Problems are: Problem set: 8 solved, 485 unsolved
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 102 places in 206 ms of which 4 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 105 places in 168 ms of which 4 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 130 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:27:08] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:27:08] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:27:08] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:27:08] [INFO ] Deduced a trap composed of 113 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:27:08] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 3 ms to minimize.
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/177 constraints. Problems are: Problem set: 14 solved, 479 unsolved
[2024-05-22 00:27:12] [INFO ] Deduced a trap composed of 107 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:27:12] [INFO ] Deduced a trap composed of 102 places in 174 ms of which 2 ms to minimize.
[2024-05-22 00:27:12] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:27:12] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 100 places in 177 ms of which 2 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:27:13] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:27:14] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 3 ms to minimize.
[2024-05-22 00:27:14] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:27:14] [INFO ] Deduced a trap composed of 115 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:27:14] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:27:14] [INFO ] Deduced a trap composed of 112 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:27:15] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:27:15] [INFO ] Deduced a trap composed of 103 places in 180 ms of which 4 ms to minimize.
[2024-05-22 00:27:15] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:27:15] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 2 ms to minimize.
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD428 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/197 constraints. Problems are: Problem set: 18 solved, 475 unsolved
[2024-05-22 00:27:15] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:27:16] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:17] [INFO ] Deduced a trap composed of 103 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:27:17] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:27:17] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:27:17] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:27:18] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
SMT process timed out in 30190ms, After SMT, problems are : Problem set: 18 solved, 475 unsolved
Search for dead transitions found 18 dead transitions in 30195ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 578/598 places, 476/514 transitions.
Applied a total of 0 rules in 11 ms. Remains 578 /578 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31163 ms. Remains : 578/598 places, 476/514 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-04 finished in 31351 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&&F(p1)&&(p2 U p3)))))'
Support contains 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 585 transition count 501
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 585 transition count 501
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 582 transition count 498
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 582 transition count 498
Applied a total of 32 rules in 26 ms. Remains 582 /598 variables (removed 16) and now considering 498/514 (removed 16) transitions.
// Phase 1: matrix 498 rows 582 cols
[2024-05-22 00:27:18] [INFO ] Computed 117 invariants in 9 ms
[2024-05-22 00:27:19] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-22 00:27:19] [INFO ] Invariant cache hit.
[2024-05-22 00:27:19] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
Running 497 sub problems to find dead transitions.
[2024-05-22 00:27:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 2 (OVERLAPS) 1/582 variables, 71/112 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 87 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:30] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 124 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 115 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:27:31] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:27:32] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:27:32] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:27:32] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:27:32] [INFO ] Deduced a trap composed of 104 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:27:32] [INFO ] Deduced a trap composed of 104 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:27:32] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:27:32] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:27:32] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:27:33] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:27:34] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:27:35] [INFO ] Deduced a trap composed of 83 places in 178 ms of which 5 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 3 ms to minimize.
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 20/157 constraints. Problems are: Problem set: 8 solved, 489 unsolved
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:27:36] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 6 ms to minimize.
[2024-05-22 00:27:37] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 113 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 111 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:27:38] [INFO ] Deduced a trap composed of 101 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:27:39] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:27:40] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
Problem TDEAD447 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 20/177 constraints. Problems are: Problem set: 9 solved, 488 unsolved
[2024-05-22 00:27:44] [INFO ] Deduced a trap composed of 126 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:27:44] [INFO ] Deduced a trap composed of 88 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:27:44] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 112 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 105 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:27:45] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 4 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 104 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:27:46] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 88 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 20/197 constraints. Problems are: Problem set: 9 solved, 488 unsolved
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 105 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 85 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 110 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 3 ms to minimize.
SMT process timed out in 30162ms, After SMT, problems are : Problem set: 9 solved, 488 unsolved
Search for dead transitions found 9 dead transitions in 30166ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 582/598 places, 489/514 transitions.
Applied a total of 0 rules in 12 ms. Remains 582 /582 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31029 ms. Remains : 582/598 places, 489/514 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-05 finished in 31369 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(G(p0)))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Graph (trivial) has 288 edges and 598 vertex of which 6 / 598 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1300 edges and 593 vertex of which 592 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 591 transition count 432
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 517 transition count 432
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 150 place count 517 transition count 308
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 422 place count 369 transition count 308
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 436 place count 355 transition count 294
Iterating global reduction 2 with 14 rules applied. Total rules applied 450 place count 355 transition count 294
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Deduced a syphon composed of 151 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 307 rules applied. Total rules applied 757 place count 199 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 759 place count 198 transition count 146
Applied a total of 759 rules in 95 ms. Remains 198 /598 variables (removed 400) and now considering 146/514 (removed 368) transitions.
// Phase 1: matrix 146 rows 198 cols
[2024-05-22 00:27:50] [INFO ] Computed 88 invariants in 3 ms
[2024-05-22 00:27:50] [INFO ] Implicit Places using invariants in 201 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 204 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 146/514 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 308 ms. Remains : 170/598 places, 146/514 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-06
Product exploration explored 100000 steps with 21361 reset in 441 ms.
Product exploration explored 100000 steps with 21358 reset in 399 ms.
Computed a total of 147 stabilizing places and 128 stable transitions
Computed a total of 147 stabilizing places and 128 stable transitions
Detected a total of 147/170 stabilizing places and 128/146 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9793 resets) in 780 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3038 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 161 steps, run visited all 1 properties in 7 ms. (steps per millisecond=23 )
Probabilistic random walk after 161 steps, saw 100 distinct states, run finished after 7 ms. (steps per millisecond=23 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 146/146 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 170 cols
[2024-05-22 00:27:52] [INFO ] Computed 60 invariants in 1 ms
[2024-05-22 00:27:52] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-22 00:27:52] [INFO ] Invariant cache hit.
[2024-05-22 00:27:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 00:27:52] [INFO ] Implicit Places using invariants and state equation in 252 ms returned [1, 3, 5, 10, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 61, 76, 78, 82, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 375 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/170 places, 146/146 transitions.
Graph (complete) has 420 edges and 136 vertex of which 125 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 125 transition count 128
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 112 transition count 128
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 37 place count 102 transition count 101
Iterating global reduction 2 with 10 rules applied. Total rules applied 47 place count 102 transition count 101
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 102 transition count 98
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 99 transition count 98
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 96 transition count 95
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 96 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 62 place count 96 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 63 place count 95 transition count 92
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 78 place count 87 transition count 85
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 6 with 2 rules applied. Total rules applied 80 place count 86 transition count 84
Applied a total of 80 rules in 28 ms. Remains 86 /136 variables (removed 50) and now considering 84/146 (removed 62) transitions.
// Phase 1: matrix 84 rows 86 cols
[2024-05-22 00:27:52] [INFO ] Computed 21 invariants in 2 ms
[2024-05-22 00:27:52] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 00:27:52] [INFO ] Invariant cache hit.
[2024-05-22 00:27:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:27:52] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/170 places, 84/146 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 616 ms. Remains : 86/170 places, 84/146 transitions.
Computed a total of 63 stabilizing places and 66 stable transitions
Computed a total of 63 stabilizing places and 66 stable transitions
Detected a total of 63/86 stabilizing places and 66/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9997 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2975 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 120 steps, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Probabilistic random walk after 120 steps, saw 73 distinct states, run finished after 4 ms. (steps per millisecond=30 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21800 reset in 143 ms.
Product exploration explored 100000 steps with 21942 reset in 151 ms.
Built C files in :
/tmp/ltsmin2521789241767811707
[2024-05-22 00:27:53] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2024-05-22 00:27:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:27:53] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2024-05-22 00:27:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:27:53] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2024-05-22 00:27:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:27:53] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2521789241767811707
Running compilation step : cd /tmp/ltsmin2521789241767811707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 393 ms.
Running link step : cd /tmp/ltsmin2521789241767811707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin2521789241767811707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13603902913266736193.hoa' '--buchi-type=spotba'
LTSmin run took 1268 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-19-LTLFireability-06 finished in 5041 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)||(p1 U X(p2)))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 585 transition count 501
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 585 transition count 501
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 581 transition count 497
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 581 transition count 497
Applied a total of 34 rules in 35 ms. Remains 581 /598 variables (removed 17) and now considering 497/514 (removed 17) transitions.
// Phase 1: matrix 497 rows 581 cols
[2024-05-22 00:27:55] [INFO ] Computed 117 invariants in 10 ms
[2024-05-22 00:27:55] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-22 00:27:55] [INFO ] Invariant cache hit.
[2024-05-22 00:27:56] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-22 00:27:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:28:07] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 124 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 100 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:28:08] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:28:09] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:28:10] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 00:28:10] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:28:10] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:28:10] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:28:10] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:28:11] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:28:12] [INFO ] Deduced a trap composed of 130 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:28:13] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:28:14] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:28:15] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:28:15] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:28:15] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:28:15] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:28:15] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:28:15] [INFO ] Deduced a trap composed of 101 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:28:16] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:28:16] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 00:28:20] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:28:20] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:28:21] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 104 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 4 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 4 solved, 492 unsolved
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 4 ms to minimize.
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 2 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 103 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 3 ms to minimize.
SMT process timed out in 30173ms, After SMT, problems are : Problem set: 4 solved, 492 unsolved
Search for dead transitions found 4 dead transitions in 30181ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 581/598 places, 493/514 transitions.
Applied a total of 0 rules in 12 ms. Remains 581 /581 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31278 ms. Remains : 581/598 places, 493/514 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 294 ms.
Product exploration explored 100000 steps with 33333 reset in 232 ms.
Computed a total of 524 stabilizing places and 446 stable transitions
Graph (complete) has 1278 edges and 581 vertex of which 580 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 524 stabilizing places and 446 stable transitions
Detected a total of 524/581 stabilizing places and 446/493 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 23 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-07 finished in 32030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Graph (trivial) has 288 edges and 598 vertex of which 6 / 598 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 1300 edges and 593 vertex of which 592 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 591 transition count 433
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 148 place count 518 transition count 433
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 148 place count 518 transition count 307
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 425 place count 367 transition count 307
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 438 place count 354 transition count 294
Iterating global reduction 2 with 13 rules applied. Total rules applied 451 place count 354 transition count 294
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 305 rules applied. Total rules applied 756 place count 199 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 758 place count 198 transition count 147
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 764 place count 198 transition count 147
Applied a total of 764 rules in 85 ms. Remains 198 /598 variables (removed 400) and now considering 147/514 (removed 367) transitions.
// Phase 1: matrix 147 rows 198 cols
[2024-05-22 00:28:27] [INFO ] Computed 87 invariants in 2 ms
[2024-05-22 00:28:27] [INFO ] Implicit Places using invariants in 342 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 343 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 147/514 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 434 ms. Remains : 170/598 places, 147/514 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-08 finished in 549 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(X(p0)) U (!p0||F((p1||X(p2)))))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 499
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 495
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 495
Applied a total of 38 rules in 28 ms. Remains 579 /598 variables (removed 19) and now considering 495/514 (removed 19) transitions.
// Phase 1: matrix 495 rows 579 cols
[2024-05-22 00:28:27] [INFO ] Computed 117 invariants in 4 ms
[2024-05-22 00:28:28] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 00:28:28] [INFO ] Invariant cache hit.
[2024-05-22 00:28:28] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Running 494 sub problems to find dead transitions.
[2024-05-22 00:28:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 72/113 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 494 unsolved
[2024-05-22 00:28:38] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 4 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 80 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:28:40] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:28:40] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 4 ms to minimize.
[2024-05-22 00:28:40] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:28:40] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:28:40] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:28:40] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
Problem TDEAD406 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 17 solved, 477 unsolved
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:28:43] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:28:43] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:28:43] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:43] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:28:43] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:28:43] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:28:43] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:28:44] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:28:44] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:28:44] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:28:44] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:28:44] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:28:44] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:28:44] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:28:44] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 17 solved, 477 unsolved
[2024-05-22 00:28:45] [INFO ] Deduced a trap composed of 39 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:28:45] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:28:45] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:28:45] [INFO ] Deduced a trap composed of 127 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:28:45] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:28:45] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:28:45] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:28:46] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:28:46] [INFO ] Deduced a trap composed of 97 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:28:46] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:28:46] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:28:46] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:28:46] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:28:46] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:28:46] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:28:46] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:28:47] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:28:47] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:28:47] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:28:47] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 2 ms to minimize.
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 20 solved, 474 unsolved
[2024-05-22 00:28:51] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:28:51] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:28:51] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:28:51] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:28:51] [INFO ] Deduced a trap composed of 127 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:28:52] [INFO ] Deduced a trap composed of 122 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:28:52] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:28:52] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:28:52] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:28:52] [INFO ] Deduced a trap composed of 122 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:28:52] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:28:52] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:28:52] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:28:53] [INFO ] Deduced a trap composed of 123 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:28:53] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:28:53] [INFO ] Deduced a trap composed of 120 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:28:53] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:28:53] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:28:53] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:28:54] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 3 ms to minimize.
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD438 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 23 solved, 471 unsolved
[2024-05-22 00:28:54] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:28:54] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:28:54] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:28:54] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:28:54] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:28:55] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:28:55] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:28:55] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:28:55] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:28:55] [INFO ] Deduced a trap composed of 110 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:28:55] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:28:55] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:28:55] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:28:56] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:28:56] [INFO ] Deduced a trap composed of 101 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:28:56] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:28:57] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:28:58] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:28:58] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1074 variables, and 216 constraints, problems are : Problem set: 23 solved, 471 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/579 constraints, PredecessorRefiner: 494/494 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 23 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 41/41 constraints. Problems are: Problem set: 23 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/41 constraints. Problems are: Problem set: 23 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 72/113 constraints. Problems are: Problem set: 23 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 4/117 constraints. Problems are: Problem set: 23 solved, 471 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 99/216 constraints. Problems are: Problem set: 23 solved, 471 unsolved
[2024-05-22 00:29:02] [INFO ] Deduced a trap composed of 39 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:29:02] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:02] [INFO ] Deduced a trap composed of 96 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:29:03] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:29:03] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:29:03] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:29:03] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:29:03] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:29:03] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:04] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:29:04] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:29:04] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 4 ms to minimize.
[2024-05-22 00:29:04] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:29:04] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:29:04] [INFO ] Deduced a trap composed of 121 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:29:04] [INFO ] Deduced a trap composed of 107 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:05] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:05] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:29:05] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:29:05] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/236 constraints. Problems are: Problem set: 23 solved, 471 unsolved
[2024-05-22 00:29:06] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:29:06] [INFO ] Deduced a trap composed of 112 places in 186 ms of which 4 ms to minimize.
[2024-05-22 00:29:06] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 105 places in 195 ms of which 3 ms to minimize.
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 101 places in 174 ms of which 4 ms to minimize.
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:29:07] [INFO ] Deduced a trap composed of 95 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 100 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 98 places in 164 ms of which 2 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:08] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:29:09] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:29:09] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:29:09] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:29:09] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:29:09] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:29:09] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/256 constraints. Problems are: Problem set: 23 solved, 471 unsolved
[2024-05-22 00:29:10] [INFO ] Deduced a trap composed of 110 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:29:11] [INFO ] Deduced a trap composed of 102 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:29:11] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:29:11] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:29:11] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:29:11] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:29:12] [INFO ] Deduced a trap composed of 103 places in 151 ms of which 4 ms to minimize.
[2024-05-22 00:29:12] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:29:12] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:29:12] [INFO ] Deduced a trap composed of 104 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:29:12] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:29:12] [INFO ] Deduced a trap composed of 127 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:29:12] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:29:13] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:29:13] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:29:13] [INFO ] Deduced a trap composed of 101 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:29:14] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/276 constraints. Problems are: Problem set: 23 solved, 471 unsolved
[2024-05-22 00:29:15] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:29:15] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:29:15] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:29:16] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 7 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:29:17] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 20/296 constraints. Problems are: Problem set: 23 solved, 471 unsolved
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 100 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:29:18] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 108 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:29:19] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 20/316 constraints. Problems are: Problem set: 23 solved, 471 unsolved
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 99 places in 169 ms of which 5 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 100 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 99 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 116 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
Problem TDEAD401 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 20/336 constraints. Problems are: Problem set: 24 solved, 470 unsolved
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 100 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:29:28] [INFO ] Deduced a trap composed of 111 places in 188 ms of which 16 ms to minimize.
SMT process timed out in 60169ms, After SMT, problems are : Problem set: 24 solved, 470 unsolved
Search for dead transitions found 24 dead transitions in 60177ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 579/598 places, 471/514 transitions.
Applied a total of 0 rules in 13 ms. Remains 579 /579 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60977 ms. Remains : 579/598 places, 471/514 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-09
Product exploration explored 100000 steps with 864 reset in 303 ms.
Stack based approach found an accepted trace after 56529 steps with 498 reset with depth 80 and stack size 80 in 211 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-09 finished in 61774 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((G(p0)||G(F((p1||G(p2)))))))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Graph (trivial) has 289 edges and 598 vertex of which 6 / 598 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 1300 edges and 593 vertex of which 592 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 591 transition count 432
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 517 transition count 432
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 150 place count 517 transition count 306
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 427 place count 366 transition count 306
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 441 place count 352 transition count 292
Iterating global reduction 2 with 14 rules applied. Total rules applied 455 place count 352 transition count 292
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 301 rules applied. Total rules applied 756 place count 199 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 758 place count 198 transition count 147
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 764 place count 198 transition count 147
Applied a total of 764 rules in 77 ms. Remains 198 /598 variables (removed 400) and now considering 147/514 (removed 367) transitions.
// Phase 1: matrix 147 rows 198 cols
[2024-05-22 00:29:29] [INFO ] Computed 87 invariants in 3 ms
[2024-05-22 00:29:30] [INFO ] Implicit Places using invariants in 341 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 345 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 147/514 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 429 ms. Remains : 170/598 places, 147/514 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-10
Product exploration explored 100000 steps with 21106 reset in 252 ms.
Product exploration explored 100000 steps with 21182 reset in 337 ms.
Computed a total of 147 stabilizing places and 129 stable transitions
Computed a total of 147 stabilizing places and 129 stable transitions
Detected a total of 147/170 stabilizing places and 129/147 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 16 factoid took 1519 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (6813 resets) in 224 ms. (177 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40002 steps (2420 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2810 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2823 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2474 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (2835 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
// Phase 1: matrix 147 rows 170 cols
[2024-05-22 00:29:32] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 00:29:32] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem apf4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 78/131 variables, 39/42 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 31/162 variables, 13/55 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/166 variables, 4/59 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 146/312 variables, 166/225 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 4/229 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/316 variables, 4/233 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/316 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/317 variables, and 233 constraints, problems are : Problem set: 1 solved, 4 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 170/170 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 51/53 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/131 variables, 39/42 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-22 00:29:33] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:29:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:29:33] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 3/45 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 31/162 variables, 13/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/166 variables, 4/62 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 146/312 variables, 166/228 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 4/232 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 2/234 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 0/234 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 4/316 variables, 4/238 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/316 variables, 1/239 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-22 00:29:33] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/316 variables, 1/240 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/316 variables, 0/240 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/316 variables, 0/240 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/317 variables, and 240 constraints, problems are : Problem set: 2 solved, 3 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 170/170 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 755ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 147/147 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 170 transition count 146
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 170 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 168 transition count 144
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 6 place count 168 transition count 144
Applied a total of 6 rules in 13 ms. Remains 168 /170 variables (removed 2) and now considering 144/147 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 168/170 places, 144/147 transitions.
RANDOM walk for 1289 steps (53 resets) in 13 ms. (92 steps per ms) remains 0/3 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2 p1))), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (F p1)]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 891 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-10 finished in 4907 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 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Graph (trivial) has 288 edges and 598 vertex of which 6 / 598 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 1300 edges and 593 vertex of which 592 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 591 transition count 432
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 517 transition count 432
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 150 place count 517 transition count 307
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 275 rules applied. Total rules applied 425 place count 367 transition count 307
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 439 place count 353 transition count 293
Iterating global reduction 2 with 14 rules applied. Total rules applied 453 place count 353 transition count 293
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 301 rules applied. Total rules applied 754 place count 200 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 756 place count 199 transition count 148
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 762 place count 199 transition count 148
Applied a total of 762 rules in 81 ms. Remains 199 /598 variables (removed 399) and now considering 148/514 (removed 366) transitions.
// Phase 1: matrix 148 rows 199 cols
[2024-05-22 00:29:34] [INFO ] Computed 87 invariants in 3 ms
[2024-05-22 00:29:35] [INFO ] Implicit Places using invariants in 354 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 357 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/598 places, 148/514 transitions.
Applied a total of 0 rules in 6 ms. Remains 171 /171 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 444 ms. Remains : 171/598 places, 148/514 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-11 finished in 529 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))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 584 transition count 500
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 584 transition count 500
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 581 transition count 497
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 581 transition count 497
Applied a total of 34 rules in 46 ms. Remains 581 /598 variables (removed 17) and now considering 497/514 (removed 17) transitions.
// Phase 1: matrix 497 rows 581 cols
[2024-05-22 00:29:35] [INFO ] Computed 117 invariants in 5 ms
[2024-05-22 00:29:35] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-22 00:29:35] [INFO ] Invariant cache hit.
[2024-05-22 00:29:36] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-22 00:29:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 71/111 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 496 unsolved
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 127 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 118 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 14 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 108 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 128 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 108 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 123 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
Problem TDEAD405 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 16 solved, 480 unsolved
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 126 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 16 solved, 480 unsolved
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 126 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 111 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 126 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 18 solved, 478 unsolved
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 122 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 5 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 84 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 123 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 18 solved, 478 unsolved
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 106 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 100 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 109 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 4 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 130 places in 157 ms of which 4 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 110 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 109 places in 173 ms of which 3 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD443 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/217 constraints. Problems are: Problem set: 25 solved, 471 unsolved
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 104 places in 165 ms of which 3 ms to minimize.
SMT process timed out in 30230ms, After SMT, problems are : Problem set: 25 solved, 471 unsolved
Search for dead transitions found 25 dead transitions in 30237ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 581/598 places, 472/514 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 580 transition count 472
Applied a total of 1 rules in 14 ms. Remains 580 /581 variables (removed 1) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 580 cols
[2024-05-22 00:30:06] [INFO ] Computed 120 invariants in 9 ms
[2024-05-22 00:30:06] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-22 00:30:06] [INFO ] Invariant cache hit.
[2024-05-22 00:30:07] [INFO ] Implicit Places using invariants and state equation in 568 ms returned [158, 159]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 809 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 578/598 places, 472/514 transitions.
Applied a total of 0 rules in 12 ms. Remains 578 /578 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32080 ms. Remains : 578/598 places, 472/514 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-12
Stuttering criterion allowed to conclude after 3350 steps with 18 reset in 14 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-12 finished in 32255 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(G(p0))&&F(p1))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 499
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 499
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 495
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 495
Applied a total of 38 rules in 51 ms. Remains 579 /598 variables (removed 19) and now considering 495/514 (removed 19) transitions.
// Phase 1: matrix 495 rows 579 cols
[2024-05-22 00:30:07] [INFO ] Computed 117 invariants in 12 ms
[2024-05-22 00:30:07] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-22 00:30:07] [INFO ] Invariant cache hit.
[2024-05-22 00:30:08] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Running 494 sub problems to find dead transitions.
[2024-05-22 00:30:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 69/112 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 494 unsolved
[2024-05-22 00:30:19] [INFO ] Deduced a trap composed of 86 places in 162 ms of which 4 ms to minimize.
[2024-05-22 00:30:19] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:30:19] [INFO ] Deduced a trap composed of 110 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:30:21] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:30:21] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:30:21] [INFO ] Deduced a trap composed of 124 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:30:21] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:30:21] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:30:21] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:30:21] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 494 unsolved
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:30:23] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:30:23] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:30:23] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:30:23] [INFO ] Deduced a trap composed of 124 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:30:23] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:30:23] [INFO ] Deduced a trap composed of 125 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:30:23] [INFO ] Deduced a trap composed of 108 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:30:24] [INFO ] Deduced a trap composed of 105 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:30:24] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:30:24] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:30:24] [INFO ] Deduced a trap composed of 105 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:30:24] [INFO ] Deduced a trap composed of 108 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:30:24] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:30:24] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:30:25] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:30:25] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:30:25] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 494 unsolved
[2024-05-22 00:30:25] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:30:25] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:30:25] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:30:26] [INFO ] Deduced a trap composed of 113 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:30:26] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:30:26] [INFO ] Deduced a trap composed of 110 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:30:26] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:30:26] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:30:26] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:30:26] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:30:27] [INFO ] Deduced a trap composed of 121 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:30:27] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:30:27] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:30:27] [INFO ] Deduced a trap composed of 121 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:30:27] [INFO ] Deduced a trap composed of 133 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:30:27] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:30:28] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:30:28] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:30:28] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:30:28] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 14 solved, 480 unsolved
[2024-05-22 00:30:31] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 122 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 104 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 127 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 120 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 109 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:30:34] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:30:34] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:30:34] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 14 solved, 480 unsolved
[2024-05-22 00:30:34] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:30:34] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:30:34] [INFO ] Deduced a trap composed of 113 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:30:35] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 4 ms to minimize.
[2024-05-22 00:30:35] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:30:35] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:30:35] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:30:35] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:30:35] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 4 ms to minimize.
[2024-05-22 00:30:35] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:30:36] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:30:36] [INFO ] Deduced a trap composed of 109 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:30:36] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:30:36] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:30:36] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:30:36] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:30:36] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:30:36] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 113 places in 104 ms of which 2 ms to minimize.
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 20/217 constraints. Problems are: Problem set: 16 solved, 478 unsolved
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 114 places in 199 ms of which 3 ms to minimize.
[2024-05-22 00:30:38] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 2 ms to minimize.
SMT process timed out in 30205ms, After SMT, problems are : Problem set: 16 solved, 478 unsolved
Search for dead transitions found 16 dead transitions in 30210ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 579/598 places, 479/514 transitions.
Applied a total of 0 rules in 12 ms. Remains 579 /579 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31271 ms. Remains : 579/598 places, 479/514 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-13
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-13 finished in 31429 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)||X((p1||G((p1||X(G(p2)))))))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 499
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 580 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 580 transition count 496
Applied a total of 36 rules in 32 ms. Remains 580 /598 variables (removed 18) and now considering 496/514 (removed 18) transitions.
// Phase 1: matrix 496 rows 580 cols
[2024-05-22 00:30:38] [INFO ] Computed 117 invariants in 7 ms
[2024-05-22 00:30:39] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-22 00:30:39] [INFO ] Invariant cache hit.
[2024-05-22 00:30:39] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Running 495 sub problems to find dead transitions.
[2024-05-22 00:30:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/112 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 495 unsolved
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 101 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:30:49] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 107 places in 234 ms of which 5 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 105 places in 197 ms of which 3 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:30:52] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:30:52] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:30:52] [INFO ] Deduced a trap composed of 126 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:30:52] [INFO ] Deduced a trap composed of 105 places in 165 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 495 unsolved
[2024-05-22 00:30:53] [INFO ] Deduced a trap composed of 109 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:30:53] [INFO ] Deduced a trap composed of 124 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:30:53] [INFO ] Deduced a trap composed of 105 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:30:53] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:30:53] [INFO ] Deduced a trap composed of 120 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:30:53] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 123 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 101 places in 189 ms of which 3 ms to minimize.
[2024-05-22 00:30:54] [INFO ] Deduced a trap composed of 122 places in 248 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 104 places in 241 ms of which 7 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 109 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 119 places in 202 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 121 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 110 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 2 ms to minimize.
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 8 solved, 487 unsolved
[2024-05-22 00:30:56] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:30:57] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:30:57] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:30:57] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:30:57] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:30:57] [INFO ] Deduced a trap composed of 112 places in 268 ms of which 18 ms to minimize.
[2024-05-22 00:30:58] [INFO ] Deduced a trap composed of 109 places in 260 ms of which 6 ms to minimize.
[2024-05-22 00:30:58] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:30:58] [INFO ] Deduced a trap composed of 109 places in 186 ms of which 5 ms to minimize.
[2024-05-22 00:30:58] [INFO ] Deduced a trap composed of 101 places in 164 ms of which 2 ms to minimize.
[2024-05-22 00:30:58] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 104 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 110 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 114 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:30:59] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:31:00] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 3 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD446 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 18 solved, 477 unsolved
[2024-05-22 00:31:04] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:31:04] [INFO ] Deduced a trap composed of 124 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:31:04] [INFO ] Deduced a trap composed of 111 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:31:04] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:31:04] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:31:04] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:31:04] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:31:05] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:31:05] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:05] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:31:05] [INFO ] Deduced a trap composed of 127 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:31:05] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:31:05] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:31:05] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:31:05] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:31:06] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:31:06] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:31:06] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:31:06] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:31:06] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 25 solved, 470 unsolved
[2024-05-22 00:31:07] [INFO ] Deduced a trap composed of 100 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:31:07] [INFO ] Deduced a trap composed of 98 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:31:07] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:31:07] [INFO ] Deduced a trap composed of 108 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 4 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 109 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 107 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 119 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
(s304 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1076 variables, and 214 constraints, problems are : Problem set: 25 solved, 470 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 97/97 constraints]
Escalating to Integer solving :Problem set: 25 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 42/42 constraints. Problems are: Problem set: 25 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/42 constraints. Problems are: Problem set: 25 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/112 constraints. Problems are: Problem set: 25 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 5/117 constraints. Problems are: Problem set: 25 solved, 470 unsolved
Problem TDEAD402 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 97/214 constraints. Problems are: Problem set: 28 solved, 467 unsolved
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 115 places in 180 ms of which 18 ms to minimize.
[2024-05-22 00:31:15] [INFO ] Deduced a trap composed of 104 places in 197 ms of which 3 ms to minimize.
[2024-05-22 00:31:15] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:15] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:31:15] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:31:16] [INFO ] Deduced a trap composed of 103 places in 212 ms of which 4 ms to minimize.
[2024-05-22 00:31:16] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:31:16] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:31:16] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:31:16] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:31:16] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:31:17] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:31:17] [INFO ] Deduced a trap composed of 124 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:31:17] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:31:17] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:31:17] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:31:17] [INFO ] Deduced a trap composed of 127 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:31:17] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/234 constraints. Problems are: Problem set: 28 solved, 467 unsolved
[2024-05-22 00:31:18] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:31:18] [INFO ] Deduced a trap composed of 111 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:31:18] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:31:18] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:31:18] [INFO ] Deduced a trap composed of 115 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:31:19] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:31:19] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:31:19] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:31:19] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:31:19] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:31:19] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:31:19] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 123 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 123 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 113 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/254 constraints. Problems are: Problem set: 28 solved, 467 unsolved
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 107 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 109 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 123 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 127 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/274 constraints. Problems are: Problem set: 28 solved, 467 unsolved
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:31:24] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 133 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 123 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:31:25] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 110 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 127 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 125 places in 178 ms of which 4 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:31:26] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/294 constraints. Problems are: Problem set: 28 solved, 467 unsolved
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 104 places in 188 ms of which 3 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 109 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 103 places in 184 ms of which 4 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 100 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:31:31] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:31:31] [INFO ] Deduced a trap composed of 107 places in 183 ms of which 2 ms to minimize.
[2024-05-22 00:31:31] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 20/314 constraints. Problems are: Problem set: 28 solved, 467 unsolved
[2024-05-22 00:31:32] [INFO ] Deduced a trap composed of 108 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:31:32] [INFO ] Deduced a trap composed of 109 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:31:32] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:31:32] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:31:33] [INFO ] Deduced a trap composed of 103 places in 208 ms of which 3 ms to minimize.
[2024-05-22 00:31:33] [INFO ] Deduced a trap composed of 110 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:31:33] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:31:36] [INFO ] Deduced a trap composed of 127 places in 126 ms of which 3 ms to minimize.
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 20/334 constraints. Problems are: Problem set: 30 solved, 465 unsolved
[2024-05-22 00:31:36] [INFO ] Deduced a trap composed of 39 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:31:36] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 97 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:31:37] [INFO ] Deduced a trap composed of 126 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:31:38] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:31:38] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:31:38] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:38] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:31:38] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:31:38] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 97 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
SMT process timed out in 60124ms, After SMT, problems are : Problem set: 30 solved, 465 unsolved
Search for dead transitions found 30 dead transitions in 60129ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/598 places, 466/514 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 578 transition count 466
Applied a total of 2 rules in 13 ms. Remains 578 /580 variables (removed 2) and now considering 466/466 (removed 0) transitions.
// Phase 1: matrix 466 rows 578 cols
[2024-05-22 00:31:39] [INFO ] Computed 123 invariants in 6 ms
[2024-05-22 00:31:40] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 00:31:40] [INFO ] Invariant cache hit.
[2024-05-22 00:31:40] [INFO ] Implicit Places using invariants and state equation in 484 ms returned [158]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 684 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 577/598 places, 466/514 transitions.
Applied a total of 0 rules in 11 ms. Remains 577 /577 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61803 ms. Remains : 577/598 places, 466/514 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-14
Stuttering criterion allowed to conclude after 179 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-14 finished in 61992 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) U X((X(X(G(!p1)))||(p2 U p1)))))'
Support contains 5 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 514/514 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 584 transition count 500
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 584 transition count 500
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 580 transition count 496
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 580 transition count 496
Applied a total of 36 rules in 47 ms. Remains 580 /598 variables (removed 18) and now considering 496/514 (removed 18) transitions.
// Phase 1: matrix 496 rows 580 cols
[2024-05-22 00:31:40] [INFO ] Computed 117 invariants in 4 ms
[2024-05-22 00:31:41] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-22 00:31:41] [INFO ] Invariant cache hit.
[2024-05-22 00:31:41] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
Running 495 sub problems to find dead transitions.
[2024-05-22 00:31:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 495 unsolved
[2024-05-22 00:31:54] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:31:54] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:31:54] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:31:54] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:31:54] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:55] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:31:55] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:31:55] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:31:55] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:31:55] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:31:55] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:56] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:31:56] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:31:56] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:31:56] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:31:56] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:31:56] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:31:56] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:31:57] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:31:57] [INFO ] Deduced a trap composed of 103 places in 163 ms of which 3 ms to minimize.
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 9 solved, 486 unsolved
[2024-05-22 00:31:57] [INFO ] Deduced a trap composed of 105 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:31:57] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:31:57] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:31:58] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 6 ms to minimize.
[2024-05-22 00:31:58] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:31:58] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:31:58] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:31:58] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:58] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:31:59] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:31:59] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:31:59] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:31:59] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:31:59] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:31:59] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:31:59] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:32:00] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:32:00] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:32:00] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:32:00] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 9 solved, 486 unsolved
[2024-05-22 00:32:00] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:32:01] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:32:01] [INFO ] Deduced a trap composed of 110 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:32:01] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:32:01] [INFO ] Deduced a trap composed of 109 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:32:01] [INFO ] Deduced a trap composed of 132 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:32:01] [INFO ] Deduced a trap composed of 105 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:32:02] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:32:02] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:32:02] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:32:02] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:32:02] [INFO ] Deduced a trap composed of 109 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:32:02] [INFO ] Deduced a trap composed of 109 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:32:03] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:32:03] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:32:03] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:32:03] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:32:03] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:32:03] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:32:04] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 9 solved, 486 unsolved
[2024-05-22 00:32:08] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:32:08] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:32:08] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:32:08] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:32:08] [INFO ] Deduced a trap composed of 110 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:32:08] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:32:08] [INFO ] Deduced a trap composed of 121 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 127 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:32:09] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 16 solved, 479 unsolved
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 124 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 109 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 108 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 16 solved, 479 unsolved
Search for dead transitions found 16 dead transitions in 30171ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/598 places, 480/514 transitions.
Applied a total of 0 rules in 16 ms. Remains 580 /580 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31121 ms. Remains : 580/598 places, 480/514 transitions.
Stuttering acceptance computed with spot in 429 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 553 reset in 290 ms.
Product exploration explored 100000 steps with 556 reset in 270 ms.
Computed a total of 523 stabilizing places and 433 stable transitions
Graph (complete) has 1254 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 523 stabilizing places and 433 stable transitions
Detected a total of 523/580 stabilizing places and 433/480 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (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 280 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 395 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (217 resets) in 457 ms. (87 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 261 ms. (152 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (28 resets) in 599 ms. (66 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 730 ms. (54 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 629 ms. (63 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (36 resets) in 206 ms. (193 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (37 resets) in 228 ms. (174 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (28 resets) in 217 ms. (183 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 657338 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :6 out of 7
Probabilistic random walk after 657338 steps, saw 102385 distinct states, run finished after 3006 ms. (steps per millisecond=218 ) properties seen :6
// Phase 1: matrix 480 rows 580 cols
[2024-05-22 00:32:17] [INFO ] Computed 117 invariants in 9 ms
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) 124/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 299/425 variables, 67/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:32:17] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:32:19] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 128 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 141/566 variables, 45/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/568 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 472/1040 variables, 568/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 100 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:32:22] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 3 ms to minimize.
SMT process timed out in 5112ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 480/480 transitions.
Graph (trivial) has 269 edges and 580 vertex of which 6 / 580 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 1247 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 574 transition count 408
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 510 transition count 408
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 130 place count 510 transition count 285
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 401 place count 362 transition count 285
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 2 with 323 rules applied. Total rules applied 724 place count 198 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 726 place count 197 transition count 129
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 197 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 730 place count 195 transition count 127
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 731 place count 195 transition count 127
Applied a total of 731 rules in 42 ms. Remains 195 /580 variables (removed 385) and now considering 127/480 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 195/580 places, 127/480 transitions.
RANDOM walk for 40000 steps (1816 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 403 steps (7 resets) in 5 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F p0), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 646 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 297 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 480/480 transitions.
Applied a total of 0 rules in 11 ms. Remains 580 /580 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-05-22 00:32:24] [INFO ] Invariant cache hit.
[2024-05-22 00:32:24] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-22 00:32:24] [INFO ] Invariant cache hit.
[2024-05-22 00:32:25] [INFO ] Implicit Places using invariants and state equation in 674 ms returned [158, 159, 160]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 958 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 577/580 places, 480/480 transitions.
Applied a total of 0 rules in 10 ms. Remains 577 /577 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 980 ms. Remains : 577/580 places, 480/480 transitions.
Computed a total of 520 stabilizing places and 433 stable transitions
Graph (complete) has 1239 edges and 577 vertex of which 576 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 520 stabilizing places and 433 stable transitions
Detected a total of 520/577 stabilizing places and 433/480 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (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 292 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (215 resets) in 790 ms. (50 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (28 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (34 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (28 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
// Phase 1: matrix 480 rows 577 cols
[2024-05-22 00:32:26] [INFO ] Computed 114 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 273/428 variables, 66/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:32:26] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 129/557 variables, 39/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 8/565 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 472/1037 variables, 565/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 101 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1037 variables, 4/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1037 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 17/1054 variables, 9/702 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1054 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/1057 variables, 3/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1057 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1057 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 705 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2480 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 273/428 variables, 66/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:32:31] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 129/557 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:32:32] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 4 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 103 places in 201 ms of which 4 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8/565 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 3 ms to minimize.
[2024-05-22 00:32:33] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 0)
(s409 1)
(s410 0)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 1)
(s422 0)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 1)
(s431 0)
(s432 1)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/1057 variables, and 167 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/577 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 53/53 constraints]
After SMT, in 7509ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 480/480 transitions.
Graph (complete) has 1239 edges and 577 vertex of which 576 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 576 transition count 416
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 513 transition count 414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 511 transition count 414
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 131 place count 511 transition count 290
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 404 place count 362 transition count 290
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 323 rules applied. Total rules applied 727 place count 198 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 728 place count 198 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 730 place count 197 transition count 133
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 736 place count 197 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 737 place count 196 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 738 place count 195 transition count 132
Applied a total of 738 rules in 49 ms. Remains 195 /577 variables (removed 382) and now considering 132/480 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 195/577 places, 132/480 transitions.
RANDOM walk for 40000 steps (4244 resets) in 1268 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1077 resets) in 338 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1111 resets) in 435 ms. (91 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (1076 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
// Phase 1: matrix 132 rows 195 cols
[2024-05-22 00:32:34] [INFO ] Computed 83 invariants in 2 ms
[2024-05-22 00:32:34] [INFO ] State equation strengthened by 4 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/88 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/123 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/130 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/137 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 132/269 variables, 137/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 58/327 variables, 58/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 27/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/327 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 282 constraints, problems are : Problem set: 0 solved, 2 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 195/195 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/88 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/123 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/130 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/137 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 132/269 variables, 137/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 58/327 variables, 58/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 27/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/327 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/327 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 284 constraints, problems are : Problem set: 0 solved, 2 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 195/195 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 440ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 96 steps, including 6 resets, run visited all 2 properties in 2 ms. (steps per millisecond=48 )
Parikh walk visited 2 properties in 9 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F p0), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 753 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 379 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 434 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 553 reset in 261 ms.
Product exploration explored 100000 steps with 553 reset in 286 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 404 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 577/577 places, 480/480 transitions.
Graph (complete) has 1239 edges and 577 vertex of which 576 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 576 transition count 479
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 65 place count 576 transition count 545
Deduced a syphon composed of 152 places in 2 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 153 place count 576 transition count 545
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 175 place count 554 transition count 504
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 197 place count 554 transition count 504
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 323 places in 0 ms
Iterating global reduction 1 with 193 rules applied. Total rules applied 390 place count 554 transition count 504
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 436 place count 508 transition count 458
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 482 place count 508 transition count 458
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 485 place count 508 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 486 place count 508 transition count 469
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 489 place count 505 transition count 463
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 492 place count 505 transition count 463
Deduced a syphon composed of 277 places in 0 ms
Applied a total of 492 rules in 173 ms. Remains 505 /577 variables (removed 72) and now considering 463/480 (removed 17) transitions.
[2024-05-22 00:32:38] [INFO ] Redundant transitions in 30 ms returned []
Running 462 sub problems to find dead transitions.
// Phase 1: matrix 463 rows 505 cols
[2024-05-22 00:32:38] [INFO ] Computed 114 invariants in 9 ms
[2024-05-22 00:32:38] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/505 variables, 71/113 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 3 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 2 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 4 places in 176 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 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 TDEAD15 is UNSAT
Problem TDEAD16 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 TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 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 TDEAD72 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 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 TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 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 TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 20/134 constraints. Problems are: Problem set: 161 solved, 301 unsolved
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD14 is UNSAT
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD31 is UNSAT
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 20/154 constraints. Problems are: Problem set: 215 solved, 247 unsolved
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 2 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
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 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 TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 20/174 constraints. Problems are: Problem set: 258 solved, 204 unsolved
[2024-05-22 00:32:55] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-22 00:32:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
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 TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 20/194 constraints. Problems are: Problem set: 287 solved, 175 unsolved
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD119 is UNSAT
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:32:57] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:32:58] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:32:59] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 20/214 constraints. Problems are: Problem set: 300 solved, 162 unsolved
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 1 ms to minimize.
Problem TDEAD182 is UNSAT
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD216 is UNSAT
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD240 is UNSAT
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD243 is UNSAT
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD245 is UNSAT
[2024-05-22 00:33:00] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
Problem TDEAD306 is UNSAT
[2024-05-22 00:33:01] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:33:02] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
Problem TDEAD182 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD306 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 20/234 constraints. Problems are: Problem set: 306 solved, 156 unsolved
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:33:03] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 1 ms to minimize.
[2024-05-22 00:33:04] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:33:05] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 10/244 constraints. Problems are: Problem set: 306 solved, 156 unsolved
[2024-05-22 00:33:06] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:33:06] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:33:06] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:33:06] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:33:06] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:33:07] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:33:08] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 13/257 constraints. Problems are: Problem set: 306 solved, 156 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/968 variables, and 257 constraints, problems are : Problem set: 306 solved, 156 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/505 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 143/143 constraints]
Escalating to Integer solving :Problem set: 306 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 4/4 constraints. Problems are: Problem set: 306 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/4 constraints. Problems are: Problem set: 306 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 219/465 variables, 71/75 constraints. Problems are: Problem set: 306 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 1/76 constraints. Problems are: Problem set: 306 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 143/219 constraints. Problems are: Problem set: 306 solved, 156 unsolved
[2024-05-22 00:33:09] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:33:10] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:33:11] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:33:12] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:33:12] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:33:12] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:33:12] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:33:12] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:33:12] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 20/239 constraints. Problems are: Problem set: 306 solved, 156 unsolved
[2024-05-22 00:33:13] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:33:14] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 4/243 constraints. Problems are: Problem set: 306 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/243 constraints. Problems are: Problem set: 306 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 40/505 variables, 38/281 constraints. Problems are: Problem set: 306 solved, 156 unsolved
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:33:16] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:33:17] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:33:18] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 17/298 constraints. Problems are: Problem set: 306 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/298 constraints. Problems are: Problem set: 306 solved, 156 unsolved
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 11 (OVERLAPS) 463/968 variables, 505/803 constraints. Problems are: Problem set: 344 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/968 variables, 6/809 constraints. Problems are: Problem set: 344 solved, 118 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/968 variables, 118/927 constraints. Problems are: Problem set: 344 solved, 118 unsolved
[2024-05-22 00:33:27] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/968 variables, 1/928 constraints. Problems are: Problem set: 344 solved, 118 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 968/968 variables, and 928 constraints, problems are : Problem set: 344 solved, 118 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 505/505 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 118/462 constraints, Known Traps: 185/185 constraints]
After SMT, in 60263ms problems are : Problem set: 344 solved, 118 unsolved
Search for dead transitions found 344 dead transitions in 60271ms
Found 344 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 344 transitions
Dead transitions reduction (with SMT) removed 344 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 505/577 places, 119/480 transitions.
Graph (complete) has 877 edges and 505 vertex of which 228 are kept as prefixes of interest. Removing 277 places using SCC suffix rule.1 ms
Discarding 277 places :
Also discarding 0 output transitions
Ensure Unique test removed 39 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 189 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 11 ms. Remains 189 /505 variables (removed 316) and now considering 125/119 (removed -6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 189/577 places, 125/480 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60497 ms. Remains : 189/577 places, 125/480 transitions.
Built C files in :
/tmp/ltsmin14156443483209803424
[2024-05-22 00:33:38] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14156443483209803424
Running compilation step : cd /tmp/ltsmin14156443483209803424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1041 ms.
Running link step : cd /tmp/ltsmin14156443483209803424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin14156443483209803424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4340241295846116665.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 577/577 places, 480/480 transitions.
Applied a total of 0 rules in 27 ms. Remains 577 /577 variables (removed 0) and now considering 480/480 (removed 0) transitions.
// Phase 1: matrix 480 rows 577 cols
[2024-05-22 00:33:53] [INFO ] Computed 114 invariants in 8 ms
[2024-05-22 00:33:54] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-22 00:33:54] [INFO ] Invariant cache hit.
[2024-05-22 00:33:54] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2024-05-22 00:33:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/577 variables, 71/112 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:34:05] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:34:05] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:34:05] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:34:05] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:06] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:34:06] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:06] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:34:06] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:34:06] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:34:06] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:34:06] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:34:06] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:34:07] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:34:07] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:34:07] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:34:07] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:34:07] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:07] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 84 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 111 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 101 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 104 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:34:25] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 2 ms to minimize.
SMT process timed out in 30126ms, After SMT, problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 30133ms
Finished structural reductions in LTL mode , in 1 iterations and 31071 ms. Remains : 577/577 places, 480/480 transitions.
Built C files in :
/tmp/ltsmin11290448001918654274
[2024-05-22 00:34:25] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11290448001918654274
Running compilation step : cd /tmp/ltsmin11290448001918654274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 973 ms.
Running link step : cd /tmp/ltsmin11290448001918654274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin11290448001918654274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14435057755601111346.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:34:40] [INFO ] Flatten gal took : 36 ms
[2024-05-22 00:34:40] [INFO ] Flatten gal took : 35 ms
[2024-05-22 00:34:40] [INFO ] Time to serialize gal into /tmp/LTL12150676240956227140.gal : 23 ms
[2024-05-22 00:34:40] [INFO ] Time to serialize properties into /tmp/LTL15164088936642912851.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12150676240956227140.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14534009795970309074.hoa' '-atoms' '/tmp/LTL15164088936642912851.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15164088936642912851.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14534009795970309074.hoa
Detected timeout of ITS tools.
[2024-05-22 00:34:55] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:34:55] [INFO ] Flatten gal took : 40 ms
[2024-05-22 00:34:55] [INFO ] Time to serialize gal into /tmp/LTL10132228644295021593.gal : 21 ms
[2024-05-22 00:34:55] [INFO ] Time to serialize properties into /tmp/LTL16466101333314869722.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10132228644295021593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16466101333314869722.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("((p449==1)&&(p606==1))"))U(X((X(X(G(!("(((p146==1)&&(p482==1))&&(p737==1))")))))||(("(p606==1)")U("(((p146==1)&&(p482==1))&&(p7...169
Formula 0 simplified : G!"((p449==1)&&(p606==1))" R X(XXF"(((p146==1)&&(p482==1))&&(p737==1))" & (!"(p606==1)" R !"(((p146==1)&&(p482==1))&&(p737==1))"))
Detected timeout of ITS tools.
[2024-05-22 00:35:10] [INFO ] Flatten gal took : 35 ms
[2024-05-22 00:35:10] [INFO ] Applying decomposition
[2024-05-22 00:35:10] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15118154959095297162.txt' '-o' '/tmp/graph15118154959095297162.bin' '-w' '/tmp/graph15118154959095297162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15118154959095297162.bin' '-l' '-1' '-v' '-w' '/tmp/graph15118154959095297162.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:35:10] [INFO ] Decomposing Gal with order
[2024-05-22 00:35:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:35:11] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-22 00:35:11] [INFO ] Flatten gal took : 187 ms
[2024-05-22 00:35:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 33 ms.
[2024-05-22 00:35:11] [INFO ] Time to serialize gal into /tmp/LTL7977562107545801838.gal : 25 ms
[2024-05-22 00:35:11] [INFO ] Time to serialize properties into /tmp/LTL16869070856650229793.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7977562107545801838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16869070856650229793.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("((i17.i1.u137.p449==1)&&(i18.u161.p606==1))"))U(X((X(X(G(!("(((i8.i1.u50.p146==1)&&(i9.i1.u144.p482==1))&&(i18.u161.p737==1))")...259
Formula 0 simplified : G!"((i17.i1.u137.p449==1)&&(i18.u161.p606==1))" R X(XXF"(((i8.i1.u50.p146==1)&&(i9.i1.u144.p482==1))&&(i18.u161.p737==1))" & (!"(i18...243
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t219, t320, t328, t332, t406, t409, t478, t482, t484, t486, t489, t491, t500...1602
Computing Next relation with stutter on 109584 deadlock states
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-19-LTLFireability-15 finished in 225637 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) U X((X(X(G(!p1)))||(p2 U p1)))))'
[2024-05-22 00:35:26] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6952832806341262982
[2024-05-22 00:35:26] [INFO ] Computing symmetric may disable matrix : 514 transitions.
[2024-05-22 00:35:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:35:26] [INFO ] Computing symmetric may enable matrix : 514 transitions.
[2024-05-22 00:35:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:35:26] [INFO ] Applying decomposition
[2024-05-22 00:35:26] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8679468503624955225.txt' '-o' '/tmp/graph8679468503624955225.bin' '-w' '/tmp/graph8679468503624955225.weights'
[2024-05-22 00:35:26] [INFO ] Computing Do-Not-Accords matrix : 514 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8679468503624955225.bin' '-l' '-1' '-v' '-w' '/tmp/graph8679468503624955225.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:35:26] [INFO ] Decomposing Gal with order
[2024-05-22 00:35:26] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:35:26] [INFO ] Built C files in 196ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6952832806341262982
Running compilation step : cd /tmp/ltsmin6952832806341262982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 00:35:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:35:26] [INFO ] Removed a total of 261 redundant transitions.
[2024-05-22 00:35:26] [INFO ] Flatten gal took : 72 ms
[2024-05-22 00:35:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 26 ms.
[2024-05-22 00:35:27] [INFO ] Time to serialize gal into /tmp/LTLFireability5576631404571168419.gal : 21 ms
[2024-05-22 00:35:27] [INFO ] Time to serialize properties into /tmp/LTLFireability2192617445594181256.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5576631404571168419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2192617445594181256.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((i2.i2.u140.p449==1)&&(i19.u165.p606==1))"))U(X((X(X(G(!("(((i1.u51.p146==1)&&(i5.i0.u148.p482==1))&&(i19.u165.p737==1))")))))...252
Formula 0 simplified : G!"((i2.i2.u140.p449==1)&&(i19.u165.p606==1))" R X(XXF"(((i1.u51.p146==1)&&(i5.i0.u148.p482==1))&&(i19.u165.p737==1))" & (!"(i19.u16...236
Compilation finished in 1834 ms.
Running link step : cd /tmp/ltsmin6952832806341262982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin6952832806341262982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t219, t320, t328, t406, t409, t478, t484, t486, t489, t491, t508, i0.u76.t264, i0.u15...1771
Computing Next relation with stutter on 109584 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.059: LTL layer: formula: (<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))
pins2lts-mc-linux64( 3/ 8), 0.059: "(<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.060: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.109: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.169: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.173: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.224: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.429: DFS-FIFO for weak LTL, using special progress label 518
pins2lts-mc-linux64( 0/ 8), 0.429: There are 519 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.429: State length is 599, there are 533 groups
pins2lts-mc-linux64( 0/ 8), 0.429: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.429: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.429: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.429: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 1.122: ~1 levels ~960 states ~4384 transitions
pins2lts-mc-linux64( 1/ 8), 1.176: ~1 levels ~1920 states ~8984 transitions
pins2lts-mc-linux64( 1/ 8), 1.411: ~1 levels ~3840 states ~19880 transitions
pins2lts-mc-linux64( 1/ 8), 1.906: ~1 levels ~7680 states ~40400 transitions
pins2lts-mc-linux64( 1/ 8), 2.311: ~1 levels ~15360 states ~80712 transitions
pins2lts-mc-linux64( 1/ 8), 3.391: ~1 levels ~30720 states ~175064 transitions
pins2lts-mc-linux64( 1/ 8), 6.016: ~1 levels ~61440 states ~388648 transitions
pins2lts-mc-linux64( 1/ 8), 10.396: ~1 levels ~122880 states ~862080 transitions
pins2lts-mc-linux64( 1/ 8), 18.388: ~1 levels ~245760 states ~1902056 transitions
pins2lts-mc-linux64( 1/ 8), 33.766: ~1 levels ~491520 states ~4097408 transitions
pins2lts-mc-linux64( 1/ 8), 56.916: ~1 levels ~983040 states ~8810296 transitions
pins2lts-mc-linux64( 6/ 8), 85.102: ~1 levels ~1966080 states ~21552512 transitions
pins2lts-mc-linux64( 1/ 8), 134.737: ~1 levels ~3932160 states ~40127032 transitions
pins2lts-mc-linux64( 1/ 8), 220.020: ~1 levels ~7864320 states ~85454352 transitions
pins2lts-mc-linux64( 1/ 8), 401.311: ~1 levels ~15728640 states ~179841024 transitions
pins2lts-mc-linux64( 6/ 8), 574.782: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 574.854:
pins2lts-mc-linux64( 0/ 8), 574.854: mean standard work distribution: 4.5% (states) 5.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 574.854:
pins2lts-mc-linux64( 0/ 8), 574.854: Explored 20945791 states 287364952 transitions, fanout: 13.719
pins2lts-mc-linux64( 0/ 8), 574.854: Total exploration time 574.390 sec (574.280 sec minimum, 574.341 sec on average)
pins2lts-mc-linux64( 0/ 8), 574.854: States per second: 36466, Transitions per second: 500296
pins2lts-mc-linux64( 0/ 8), 574.854:
pins2lts-mc-linux64( 0/ 8), 574.854: Progress states detected: 41346110
pins2lts-mc-linux64( 0/ 8), 574.854: Redundant explorations: -49.3404
pins2lts-mc-linux64( 0/ 8), 574.854:
pins2lts-mc-linux64( 0/ 8), 574.854: Queue width: 8B, total height: 34286952, memory: 261.59MB
pins2lts-mc-linux64( 0/ 8), 574.854: Tree memory: 571.4MB, 14.5 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 574.854: Tree fill ratio (roots/leafs): 30.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 574.854: Stored 520 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 574.854: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 574.854: Est. total memory use: 833.0MB (~1285.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6952832806341262982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6952832806341262982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-22 00:58:57] [INFO ] Applying decomposition
[2024-05-22 00:58:57] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:58:57] [INFO ] Decomposing Gal with order
[2024-05-22 00:58:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:58:58] [INFO ] Removed a total of 126 redundant transitions.
[2024-05-22 00:58:58] [INFO ] Flatten gal took : 76 ms
[2024-05-22 00:58:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 440 ms.
[2024-05-22 00:58:58] [INFO ] Time to serialize gal into /tmp/LTLFireability13644703315535434537.gal : 31 ms
[2024-05-22 00:58:58] [INFO ] Time to serialize properties into /tmp/LTLFireability9521336164998238512.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13644703315535434537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9521336164998238512.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u145.p449==1)&&(i1.u182.p606==1))"))U(X((X(X(G(!("(((...536
Formula 0 simplified : G!"((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u145.p449==1)&&(i1.u182.p606==1))" R X(XXF"(((i0.i0.i0....520
ITS-tools command line returned an error code 137
[2024-05-22 01:06:20] [INFO ] Flatten gal took : 21 ms
[2024-05-22 01:06:20] [INFO ] Input system was already deterministic with 514 transitions.
[2024-05-22 01:06:20] [INFO ] Transformed 598 places.
[2024-05-22 01:06:20] [INFO ] Transformed 514 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 01:06:50] [INFO ] Time to serialize gal into /tmp/LTLFireability6082206583305727627.gal : 4 ms
[2024-05-22 01:06:50] [INFO ] Time to serialize properties into /tmp/LTLFireability5869638369141078034.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6082206583305727627.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5869638369141078034.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("((p449==1)&&(p606==1))"))U(X((X(X(G(!("(((p146==1)&&(p482==1))&&(p737==1))")))))||(("(p606==1)")U("(((p146==1)&&(p482==1))&&(p7...169
Formula 0 simplified : G!"((p449==1)&&(p606==1))" R X(XXF"(((p146==1)&&(p482==1))&&(p737==1))" & (!"(p606==1)" R !"(((p146==1)&&(p482==1))&&(p737==1))"))
ITS-tools command line returned an error code 137
Total runtime 3206380 ms.

BK_STOP 1716340701006

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-19"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-19, 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 r048-tajo-171620399800596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 execution
cd execution
if [ "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 ;