Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 192K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717226207555

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:16:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:16:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:16:49] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-06-01 07:16:49] [INFO ] Transformed 782 places.
[2024-06-01 07:16:49] [INFO ] Transformed 697 transitions.
[2024-06-01 07:16:49] [INFO ] Found NUPN structural information;
[2024-06-01 07:16:49] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 63 places in 17 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 115 place count 604 transition count 537
Iterating global reduction 1 with 101 rules applied. Total rules applied 216 place count 604 transition count 537
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 269 place count 551 transition count 484
Iterating global reduction 1 with 53 rules applied. Total rules applied 322 place count 551 transition count 484
Applied a total of 322 rules in 221 ms. Remains 551 /719 variables (removed 168) and now considering 484/638 (removed 154) transitions.
// Phase 1: matrix 484 rows 551 cols
[2024-06-01 07:16:50] [INFO ] Computed 107 invariants in 46 ms
[2024-06-01 07:16:50] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-06-01 07:16:50] [INFO ] Invariant cache hit.
[2024-06-01 07:16:51] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
Running 483 sub problems to find dead transitions.
[2024-06-01 07:16:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (OVERLAPS) 1/551 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 93 places in 214 ms of which 32 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 100 places in 295 ms of which 12 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 94 places in 498 ms of which 4 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 10 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 80 places in 657 ms of which 4 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 7 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 6 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
Problem TDEAD430 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/147 constraints. Problems are: Problem set: 3 solved, 480 unsolved
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 98 places in 194 ms of which 6 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 6 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/167 constraints. Problems are: Problem set: 3 solved, 480 unsolved
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 4 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 3 ms to minimize.
Problem TDEAD435 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 20/187 constraints. Problems are: Problem set: 4 solved, 479 unsolved
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 4 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
SMT process timed out in 30351ms, After SMT, problems are : Problem set: 4 solved, 479 unsolved
Search for dead transitions found 4 dead transitions in 30372ms
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 : 551/719 places, 480/638 transitions.
Applied a total of 0 rules in 14 ms. Remains 551 /551 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31874 ms. Remains : 551/719 places, 480/638 transitions.
Support contains 40 out of 551 places after structural reductions.
[2024-06-01 07:17:22] [INFO ] Flatten gal took : 64 ms
[2024-06-01 07:17:22] [INFO ] Flatten gal took : 31 ms
[2024-06-01 07:17:22] [INFO ] Input system was already deterministic with 480 transitions.
RANDOM walk for 40000 steps (195 resets) in 2377 ms. (16 steps per ms) remains 15/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
// Phase 1: matrix 480 rows 551 cols
[2024-06-01 07:17:23] [INFO ] Computed 107 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 197/220 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 201/421 variables, 51/65 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 121/542 variables, 40/105 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 2/544 variables, 2/107 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 475/1019 variables, 544/651 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 0/651 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 11/1030 variables, 6/657 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1030 variables, 0/657 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 1/1031 variables, 1/658 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1031 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/1031 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1031/1031 variables, and 658 constraints, problems are : Problem set: 1 solved, 14 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 187/204 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 216/420 variables, 54/66 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 20/86 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 114 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:26] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 20/106 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:29] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
SMT process timed out in 6385ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 480/480 transitions.
Graph (trivial) has 250 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1215 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 544 transition count 404
Reduce places removed 67 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 477 transition count 402
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 140 place count 475 transition count 402
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 140 place count 475 transition count 294
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 235 rules applied. Total rules applied 375 place count 348 transition count 294
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 382 place count 341 transition count 287
Iterating global reduction 3 with 7 rules applied. Total rules applied 389 place count 341 transition count 287
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 651 place count 209 transition count 157
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 655 place count 207 transition count 164
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 657 place count 207 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 659 place count 205 transition count 162
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 664 place count 205 transition count 162
Applied a total of 664 rules in 116 ms. Remains 205 /551 variables (removed 346) and now considering 162/480 (removed 318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 205/551 places, 162/480 transitions.
RANDOM walk for 40000 steps (1538 resets) in 1298 ms. (30 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40004 steps (362 resets) in 136 ms. (292 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (543 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
[2024-06-01 07:17:30] [INFO ] Flow matrix only has 161 transitions (discarded 1 similar events)
// Phase 1: matrix 161 rows 205 cols
[2024-06-01 07:17:30] [INFO ] Computed 86 invariants in 5 ms
[2024-06-01 07:17:30] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/160 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/201 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/203 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 161/364 variables, 203/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 14/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/366 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/366 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 205/205 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/160 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/201 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:30] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 201/366 variables, and 88 constraints, problems are : Problem set: 1 solved, 0 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 20/22 constraints, State Equation: 0/205 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 528ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BusinessProcesses-PT-20-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 483 stabilizing places and 422 stable transitions
Graph (complete) has 1222 edges and 551 vertex of which 549 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.36 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 542 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 542 transition count 471
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 538 transition count 467
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 538 transition count 467
Applied a total of 26 rules in 36 ms. Remains 538 /551 variables (removed 13) and now considering 467/480 (removed 13) transitions.
// Phase 1: matrix 467 rows 538 cols
[2024-06-01 07:17:31] [INFO ] Computed 107 invariants in 8 ms
[2024-06-01 07:17:31] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-06-01 07:17:31] [INFO ] Invariant cache hit.
[2024-06-01 07:17:32] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-06-01 07:17:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 72 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 86 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 4 solved, 462 unsolved
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 15 solved, 451 unsolved
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 4 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 20 solved, 446 unsolved
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 6 ms to minimize.
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 22 solved, 444 unsolved
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 95 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:59] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/227 constraints. Problems are: Problem set: 24 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1005 variables, and 227 constraints, problems are : Problem set: 24 solved, 442 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 24 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 120/227 constraints. Problems are: Problem set: 24 solved, 442 unsolved
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 4 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
Problem TDEAD424 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/247 constraints. Problems are: Problem set: 25 solved, 441 unsolved
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/267 constraints. Problems are: Problem set: 25 solved, 441 unsolved
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
Problem TDEAD437 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/287 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/307 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 90 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 94 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/327 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 108 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 86 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 116 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 20/347 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 3 ms to minimize.
SMT process timed out in 60241ms, After SMT, problems are : Problem set: 28 solved, 438 unsolved
Search for dead transitions found 28 dead transitions in 60248ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 439/480 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 439
Applied a total of 1 rules in 11 ms. Remains 537 /538 variables (removed 1) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 537 cols
[2024-06-01 07:18:32] [INFO ] Computed 111 invariants in 9 ms
[2024-06-01 07:18:32] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-06-01 07:18:32] [INFO ] Invariant cache hit.
[2024-06-01 07:18:32] [INFO ] Implicit Places using invariants and state equation in 398 ms returned [60, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 693 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 535/551 places, 439/480 transitions.
Applied a total of 0 rules in 9 ms. Remains 535 /535 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61946 ms. Remains : 535/551 places, 439/480 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-00
Stuttering criterion allowed to conclude after 177 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-00 finished in 62268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((X(F(p0))&&(X(p1) U p2)))||p3))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 542 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 542 transition count 471
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 538 transition count 467
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 538 transition count 467
Applied a total of 26 rules in 41 ms. Remains 538 /551 variables (removed 13) and now considering 467/480 (removed 13) transitions.
// Phase 1: matrix 467 rows 538 cols
[2024-06-01 07:18:33] [INFO ] Computed 107 invariants in 4 ms
[2024-06-01 07:18:33] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 07:18:33] [INFO ] Invariant cache hit.
[2024-06-01 07:18:33] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-06-01 07:18:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 4 solved, 462 unsolved
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 4 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 70 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 1 ms to minimize.
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 15 solved, 451 unsolved
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 5 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 5 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 20 solved, 446 unsolved
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 3 ms to minimize.
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 22 solved, 444 unsolved
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 16 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
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 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.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 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.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 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.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 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.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 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.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 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.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 1.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/227 constraints. Problems are: Problem set: 24 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1005 variables, and 227 constraints, problems are : Problem set: 24 solved, 442 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 24 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 120/227 constraints. Problems are: Problem set: 24 solved, 442 unsolved
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 4 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
Problem TDEAD424 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/247 constraints. Problems are: Problem set: 25 solved, 441 unsolved
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/267 constraints. Problems are: Problem set: 25 solved, 441 unsolved
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
Problem TDEAD437 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/287 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/307 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 95 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/327 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 75 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 108 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 85 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 4 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 20/347 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 94 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 60184ms, After SMT, problems are : Problem set: 28 solved, 438 unsolved
Search for dead transitions found 28 dead transitions in 60190ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 439/480 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 439
Applied a total of 1 rules in 10 ms. Remains 537 /538 variables (removed 1) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 537 cols
[2024-06-01 07:19:34] [INFO ] Computed 111 invariants in 4 ms
[2024-06-01 07:19:34] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 07:19:34] [INFO ] Invariant cache hit.
[2024-06-01 07:19:34] [INFO ] Implicit Places using invariants and state equation in 369 ms returned [60, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 528 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 535/551 places, 439/480 transitions.
Applied a total of 0 rules in 8 ms. Remains 535 /535 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61391 ms. Remains : 535/551 places, 439/480 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 220 ms.
Product exploration explored 100000 steps with 33333 reset in 249 ms.
Computed a total of 467 stabilizing places and 381 stable transitions
Graph (complete) has 1130 edges and 535 vertex of which 533 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 467 stabilizing places and 381 stable transitions
Detected a total of 467/535 stabilizing places and 381/439 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 70 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLFireability-01 finished in 62254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 472
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 472
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 540 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 540 transition count 469
Applied a total of 22 rules in 27 ms. Remains 540 /551 variables (removed 11) and now considering 469/480 (removed 11) transitions.
// Phase 1: matrix 469 rows 540 cols
[2024-06-01 07:19:35] [INFO ] Computed 107 invariants in 3 ms
[2024-06-01 07:19:35] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 07:19:35] [INFO ] Invariant cache hit.
[2024-06-01 07:19:36] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2024-06-01 07:19:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 1 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/127 constraints. Problems are: Problem set: 4 solved, 464 unsolved
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/147 constraints. Problems are: Problem set: 7 solved, 461 unsolved
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 71 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/167 constraints. Problems are: Problem set: 7 solved, 461 unsolved
[2024-06-01 07:19:54] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/187 constraints. Problems are: Problem set: 9 solved, 459 unsolved
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 3 ms to minimize.
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/207 constraints. Problems are: Problem set: 11 solved, 457 unsolved
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 108 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 138 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 1 ms to minimize.
Problem TDEAD410 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 20/227 constraints. Problems are: Problem set: 12 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1009 variables, and 227 constraints, problems are : Problem set: 12 solved, 456 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/540 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 12 solved, 456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 41/41 constraints. Problems are: Problem set: 12 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/41 constraints. Problems are: Problem set: 12 solved, 456 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 65/106 constraints. Problems are: Problem set: 12 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 1/107 constraints. Problems are: Problem set: 12 solved, 456 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 120/227 constraints. Problems are: Problem set: 12 solved, 456 unsolved
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/247 constraints. Problems are: Problem set: 18 solved, 450 unsolved
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 133 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 0 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/267 constraints. Problems are: Problem set: 23 solved, 445 unsolved
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:18] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:18] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:20:18] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:18] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/287 constraints. Problems are: Problem set: 23 solved, 445 unsolved
[2024-06-01 07:20:18] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:20] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:20] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:20] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:20:20] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:20:20] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:20] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:20] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/307 constraints. Problems are: Problem set: 23 solved, 445 unsolved
[2024-06-01 07:20:22] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:20:22] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:20:22] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:20:22] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:20:22] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:23] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:23] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:23] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:23] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:23] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:20:23] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 130 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 126 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:20:24] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 20/327 constraints. Problems are: Problem set: 23 solved, 445 unsolved
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 20/347 constraints. Problems are: Problem set: 23 solved, 445 unsolved
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 10 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 20/367 constraints. Problems are: Problem set: 23 solved, 445 unsolved
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 60119ms, After SMT, problems are : Problem set: 23 solved, 445 unsolved
Search for dead transitions found 23 dead transitions in 60136ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 540/551 places, 446/480 transitions.
Applied a total of 0 rules in 8 ms. Remains 540 /540 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60729 ms. Remains : 540/551 places, 446/480 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-02 finished in 60846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F((p1&&X((p1 U (p2||G(p1)))))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 542 transition count 471
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 542 transition count 471
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 538 transition count 467
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 538 transition count 467
Applied a total of 26 rules in 24 ms. Remains 538 /551 variables (removed 13) and now considering 467/480 (removed 13) transitions.
// Phase 1: matrix 467 rows 538 cols
[2024-06-01 07:20:36] [INFO ] Computed 107 invariants in 4 ms
[2024-06-01 07:20:36] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-01 07:20:36] [INFO ] Invariant cache hit.
[2024-06-01 07:20:36] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-06-01 07:20:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 1 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/147 constraints. Problems are: Problem set: 4 solved, 462 unsolved
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 1 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/167 constraints. Problems are: Problem set: 15 solved, 451 unsolved
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/187 constraints. Problems are: Problem set: 20 solved, 446 unsolved
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 2 ms to minimize.
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/207 constraints. Problems are: Problem set: 22 solved, 444 unsolved
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/227 constraints. Problems are: Problem set: 24 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1005 variables, and 227 constraints, problems are : Problem set: 24 solved, 442 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/538 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 24 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 41/41 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/41 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 1/538 variables, 64/105 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 2/107 constraints. Problems are: Problem set: 24 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 120/227 constraints. Problems are: Problem set: 24 solved, 442 unsolved
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
Problem TDEAD424 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 20/247 constraints. Problems are: Problem set: 25 solved, 441 unsolved
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 20/267 constraints. Problems are: Problem set: 25 solved, 441 unsolved
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 119 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
Problem TDEAD437 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 20/287 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:21:22] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 20/307 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:21:22] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:21:22] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:21:22] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:22] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:22] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:23] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 65 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 20/327 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 75 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 108 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 86 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 20/347 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 20/367 constraints. Problems are: Problem set: 28 solved, 438 unsolved
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 2 ms to minimize.
SMT process timed out in 60168ms, After SMT, problems are : Problem set: 28 solved, 438 unsolved
Search for dead transitions found 28 dead transitions in 60173ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 538/551 places, 439/480 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 537 transition count 439
Applied a total of 1 rules in 18 ms. Remains 537 /538 variables (removed 1) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 537 cols
[2024-06-01 07:21:37] [INFO ] Computed 111 invariants in 5 ms
[2024-06-01 07:21:37] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-06-01 07:21:37] [INFO ] Invariant cache hit.
[2024-06-01 07:21:37] [INFO ] Implicit Places using invariants and state equation in 447 ms returned [60, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 755 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 535/551 places, 439/480 transitions.
Applied a total of 0 rules in 7 ms. Remains 535 /535 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61537 ms. Remains : 535/551 places, 439/480 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-03
Product exploration explored 100000 steps with 33326 reset in 133 ms.
Product exploration explored 100000 steps with 33315 reset in 226 ms.
Computed a total of 467 stabilizing places and 381 stable transitions
Graph (complete) has 1130 edges and 535 vertex of which 533 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 467 stabilizing places and 381 stable transitions
Detected a total of 467/535 stabilizing places and 381/439 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 516 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (199 resets) in 308 ms. (129 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (34 resets) in 136 ms. (291 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40002 steps (35 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (35 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (30 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (29 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
// Phase 1: matrix 439 rows 535 cols
[2024-06-01 07:21:39] [INFO ] Computed 109 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 392/401 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 5 (OVERLAPS) 127/528 variables, 45/109 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 18 places in 362 ms of which 2 ms to minimize.
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 7/116 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 434/962 variables, 528/644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/644 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 11/973 variables, 6/650 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/973 variables, 0/650 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/974 variables, 1/651 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/974 variables, 0/651 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/974 variables, 0/651 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 974/974 variables, and 651 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 392/401 variables, 63/64 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 6/70 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 14/84 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 127/528 variables, 45/129 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 1/130 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 1/131 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 0/131 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 434/962 variables, 528/659 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 3/662 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/962 variables, 1/663 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/962 variables, 0/663 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 11/973 variables, 6/669 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/973 variables, 2/671 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/973 variables, 0/671 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/974 variables, 1/672 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/974 variables, 0/672 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/974 variables, 0/672 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 974/974 variables, and 672 constraints, problems are : Problem set: 3 solved, 3 unsolved in 2497 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 25/25 constraints]
After SMT, in 4121ms problems are : Problem set: 3 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 586 ms.
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 439/439 transitions.
Graph (trivial) has 250 edges and 535 vertex of which 6 / 535 are part of one of the 1 SCC in 2 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 1123 edges and 530 vertex of which 528 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 528 transition count 362
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 460 transition count 362
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 138 place count 460 transition count 251
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 382 place count 327 transition count 251
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 668 place count 180 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 672 place count 178 transition count 119
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 677 place count 178 transition count 114
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 682 place count 173 transition count 114
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 687 place count 173 transition count 114
Applied a total of 687 rules in 59 ms. Remains 173 /535 variables (removed 362) and now considering 114/439 (removed 325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 173/535 places, 114/439 transitions.
RANDOM walk for 40000 steps (1947 resets) in 329 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4653 steps (66 resets) in 15 ms. (290 steps per ms) remains 0/3 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p0 (NOT p1))), (G (OR p2 p0 p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 18 factoid took 1671 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 439/439 transitions.
Applied a total of 0 rules in 9 ms. Remains 535 /535 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2024-06-01 07:21:46] [INFO ] Invariant cache hit.
[2024-06-01 07:21:46] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-06-01 07:21:46] [INFO ] Invariant cache hit.
[2024-06-01 07:21:47] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-06-01 07:21:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/535 variables, 64/107 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:21:55] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:21:55] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:21:55] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:55] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 1 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:05] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 113 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 30147ms, After SMT, problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 30158ms
Finished structural reductions in LTL mode , in 1 iterations and 30926 ms. Remains : 535/535 places, 439/439 transitions.
Computed a total of 467 stabilizing places and 381 stable transitions
Graph (complete) has 1130 edges and 535 vertex of which 533 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 467 stabilizing places and 381 stable transitions
Detected a total of 467/535 stabilizing places and 381/439 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (195 resets) in 317 ms. (125 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (36 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (47 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (30 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (31 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
[2024-06-01 07:22:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 392/401 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 127/528 variables, 45/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 434/962 variables, 528/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 11/973 variables, 6/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/973 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/974 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/974 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/974 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 974/974 variables, and 650 constraints, problems are : Problem set: 0 solved, 4 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 392/401 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 37 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 127/528 variables, 45/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 434/962 variables, 528/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 4/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:22:22] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:22:22] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:22] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/962 variables, 20/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:22] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:22] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/962 variables, 2/672 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/962 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 11/973 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/973 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 1/974 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/974 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/974 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 974/974 variables, and 679 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3727 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 535/535 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 31/31 constraints]
After SMT, in 4601ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 164 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=164 )
Parikh walk visited 4 properties in 119 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 581 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2291 reset in 244 ms.
Product exploration explored 100000 steps with 2195 reset in 277 ms.
Support contains 3 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 439/439 transitions.
Applied a total of 0 rules in 11 ms. Remains 535 /535 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2024-06-01 07:22:24] [INFO ] Invariant cache hit.
[2024-06-01 07:22:25] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 07:22:25] [INFO ] Invariant cache hit.
[2024-06-01 07:22:25] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-06-01 07:22:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/535 variables, 64/107 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 1 ms to minimize.
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 1 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 1 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 8 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:51] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:22:51] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:22:54] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:22:55] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:22:55] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:22:55] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:55] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/974 variables, and 239 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/535 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 130/130 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/535 variables, 64/107 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 130/239 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 1 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 119 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 79 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:06] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:09] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:23:09] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 66 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:23:11] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:23:11] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 20/319 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:23:11] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:11] [INFO ] Deduced a trap composed of 114 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:11] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:23:12] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:23:13] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 20/339 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:14] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:23:15] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:23:16] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:16] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:23:16] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 20/359 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:23:16] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:23:16] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:23:17] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:23:18] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:19] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:23:19] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 20/379 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:23:20] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:23:20] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:23:20] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:23:20] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:20] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:23:20] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:23:20] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:23:21] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:23:21] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:23:21] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:21] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:23:21] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:23:21] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:23:21] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:23:21] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:23:22] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:23:22] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:23:22] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:23:22] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:23:22] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 20/399 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:23:25] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:23:25] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:23:25] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:23:25] [INFO ] Deduced a trap composed of 105 places in 157 ms of which 3 ms to minimize.
SMT process timed out in 60098ms, After SMT, problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Finished structural reductions in LTL mode , in 1 iterations and 60914 ms. Remains : 535/535 places, 439/439 transitions.
Treatment of property BusinessProcesses-PT-20-LTLFireability-03 finished in 169539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1||(p2&&G(p3)))))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 472
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 472
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 468
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 468
Applied a total of 24 rules in 42 ms. Remains 539 /551 variables (removed 12) and now considering 468/480 (removed 12) transitions.
// Phase 1: matrix 468 rows 539 cols
[2024-06-01 07:23:25] [INFO ] Computed 107 invariants in 3 ms
[2024-06-01 07:23:26] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-06-01 07:23:26] [INFO ] Invariant cache hit.
[2024-06-01 07:23:26] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-06-01 07:23:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 1 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
Problem TDEAD410 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 20/127 constraints. Problems are: Problem set: 10 solved, 457 unsolved
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/147 constraints. Problems are: Problem set: 10 solved, 457 unsolved
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
Problem TDEAD408 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/167 constraints. Problems are: Problem set: 22 solved, 445 unsolved
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 126 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/187 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 113 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 1 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/227 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-06-01 07:23:56] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:23:56] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:23:56] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:23:56] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:23:56] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1007 variables, and 232 constraints, problems are : Problem set: 25 solved, 442 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/539 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 125/125 constraints]
Escalating to Integer solving :Problem set: 25 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 25 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 25 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 25 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 25 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 125/232 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-06-01 07:24:00] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:24:00] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:00] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:00] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:00] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 1 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD438 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/252 constraints. Problems are: Problem set: 30 solved, 437 unsolved
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:24:05] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:05] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:24:05] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:24:05] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:24:05] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:24:05] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:05] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/272 constraints. Problems are: Problem set: 30 solved, 437 unsolved
[2024-06-01 07:24:06] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:24:06] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:24:06] [INFO ] Deduced a trap composed of 109 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:24:06] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:24:09] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:09] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/292 constraints. Problems are: Problem set: 30 solved, 437 unsolved
[2024-06-01 07:24:09] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:24:11] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:24:11] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:24:11] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:24:11] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:24:11] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/312 constraints. Problems are: Problem set: 30 solved, 437 unsolved
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 1 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:24:14] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/332 constraints. Problems are: Problem set: 30 solved, 437 unsolved
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 114 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 113 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 111 places in 102 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 20/352 constraints. Problems are: Problem set: 30 solved, 437 unsolved
[2024-06-01 07:24:19] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 20/372 constraints. Problems are: Problem set: 30 solved, 437 unsolved
[2024-06-01 07:24:23] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:24:23] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:24:23] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 1 ms to minimize.
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:26] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 20/392 constraints. Problems are: Problem set: 30 solved, 437 unsolved
[2024-06-01 07:24:26] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
SMT process timed out in 60155ms, After SMT, problems are : Problem set: 30 solved, 437 unsolved
Search for dead transitions found 30 dead transitions in 60159ms
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 : 539/551 places, 438/480 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 538 transition count 438
Applied a total of 1 rules in 21 ms. Remains 538 /539 variables (removed 1) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 538 cols
[2024-06-01 07:24:27] [INFO ] Computed 113 invariants in 2 ms
[2024-06-01 07:24:27] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 07:24:27] [INFO ] Invariant cache hit.
[2024-06-01 07:24:27] [INFO ] Implicit Places using invariants and state equation in 382 ms returned [61, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 641 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 536/551 places, 438/480 transitions.
Applied a total of 0 rules in 20 ms. Remains 536 /536 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61907 ms. Remains : 536/551 places, 438/480 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-04
Product exploration explored 100000 steps with 526 reset in 152 ms.
Product exploration explored 100000 steps with 520 reset in 216 ms.
Computed a total of 468 stabilizing places and 380 stable transitions
Graph (complete) has 1127 edges and 536 vertex of which 534 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 468 stabilizing places and 380 stable transitions
Detected a total of 468/536 stabilizing places and 380/438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 369 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
RANDOM walk for 40000 steps (197 resets) in 542 ms. (73 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (34 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (35 resets) in 298 ms. (133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (36 resets) in 238 ms. (167 steps per ms) remains 3/3 properties
// Phase 1: matrix 438 rows 536 cols
[2024-06-01 07:24:29] [INFO ] Computed 111 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 288/401 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 128/529 variables, 47/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 433/962 variables, 529/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/962 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 11/973 variables, 6/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/973 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/974 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/974 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/974 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 974/974 variables, and 647 constraints, problems are : Problem set: 0 solved, 3 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 288/401 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 128/529 variables, 47/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:24:34] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:24:34] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:24:34] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:24:34] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:24:34] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:24:34] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:24:34] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:34] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
SMT process timed out in 5513ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 438/438 transitions.
Graph (trivial) has 249 edges and 536 vertex of which 6 / 536 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 1120 edges and 531 vertex of which 529 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 529 transition count 364
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 464 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 463 transition count 363
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 134 place count 463 transition count 252
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 376 place count 332 transition count 252
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 377 place count 331 transition count 251
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 331 transition count 251
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 295 rules applied. Total rules applied 673 place count 178 transition count 109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 677 place count 176 transition count 116
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 679 place count 176 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 681 place count 174 transition count 114
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 682 place count 174 transition count 114
Applied a total of 682 rules in 54 ms. Remains 174 /536 variables (removed 362) and now considering 114/438 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 174/536 places, 114/438 transitions.
RANDOM walk for 21142 steps (1161 resets) in 105 ms. (199 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p1 p2) (OR p1 p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 10 factoid took 883 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 438/438 transitions.
Applied a total of 0 rules in 9 ms. Remains 536 /536 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2024-06-01 07:24:36] [INFO ] Invariant cache hit.
[2024-06-01 07:24:36] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 07:24:36] [INFO ] Invariant cache hit.
[2024-06-01 07:24:37] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-06-01 07:24:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 64/109 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:24:44] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:24:44] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:24:44] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:24:54] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 5 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:55] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:24:58] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:24:59] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:59] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:59] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:59] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:59] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:59] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:24:59] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:24:59] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:59] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:25:00] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:25:00] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:25:00] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:00] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:25:00] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:25:00] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:25:01] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:25:02] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:25:02] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:25:02] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:02] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:02] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:25:02] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:02] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:25:05] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:25:05] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:25:05] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:25:06] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:25:06] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:25:06] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/974 variables, and 237 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/536 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 126/126 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 64/109 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 126/237 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/297 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:25:18] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:25:18] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:25:18] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:25:18] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:25:18] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:19] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 1 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 20/317 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:25:23] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:25:23] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:23] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:25:23] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:25:23] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:23] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:25:23] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 20/337 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:25:26] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:26] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:26] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 20/357 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:25:30] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:25:30] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:25:30] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:30] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:25:30] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:25:31] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:25:32] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:25:33] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:25:34] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 133 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 60088ms, After SMT, problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Finished structural reductions in LTL mode , in 1 iterations and 60790 ms. Remains : 536/536 places, 438/438 transitions.
Computed a total of 468 stabilizing places and 380 stable transitions
Graph (complete) has 1127 edges and 536 vertex of which 534 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 468 stabilizing places and 380 stable transitions
Detected a total of 468/536 stabilizing places and 380/438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 302 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
RANDOM walk for 40000 steps (198 resets) in 477 ms. (83 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (37 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (35 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
[2024-06-01 07:25:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 110/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 288/401 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 128/529 variables, 47/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 433/962 variables, 529/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/962 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 11/973 variables, 6/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/973 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/974 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/974 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/974 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 974/974 variables, and 647 constraints, problems are : Problem set: 0 solved, 4 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 110/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 288/401 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 35 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 128/529 variables, 47/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
SMT process timed out in 5571ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 438/438 transitions.
Graph (trivial) has 249 edges and 536 vertex of which 6 / 536 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 1120 edges and 531 vertex of which 529 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 529 transition count 364
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 464 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 463 transition count 363
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 134 place count 463 transition count 252
Deduced a syphon composed of 111 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 376 place count 332 transition count 252
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 377 place count 331 transition count 251
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 331 transition count 251
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 295 rules applied. Total rules applied 673 place count 178 transition count 109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 677 place count 176 transition count 116
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 679 place count 176 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 681 place count 174 transition count 114
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 682 place count 174 transition count 114
Applied a total of 682 rules in 56 ms. Remains 174 /536 variables (removed 362) and now considering 114/438 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 174/536 places, 114/438 transitions.
RANDOM walk for 27703 steps (1450 resets) in 157 ms. (175 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p1 p2) (OR p1 p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 10 factoid took 703 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Product exploration explored 100000 steps with 528 reset in 180 ms.
Product exploration explored 100000 steps with 523 reset in 272 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 536 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 536/536 places, 438/438 transitions.
Graph (trivial) has 248 edges and 536 vertex of which 6 / 536 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 1121 edges and 531 vertex of which 529 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 529 transition count 430
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 85 Pre rules applied. Total rules applied 62 place count 529 transition count 488
Deduced a syphon composed of 145 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 147 place count 529 transition count 488
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 173 place count 503 transition count 445
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 199 place count 503 transition count 445
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 292 places in 0 ms
Iterating global reduction 1 with 173 rules applied. Total rules applied 372 place count 503 transition count 445
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 417 place count 458 transition count 400
Deduced a syphon composed of 247 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 462 place count 458 transition count 400
Deduced a syphon composed of 247 places in 0 ms
Applied a total of 462 rules in 197 ms. Remains 458 /536 variables (removed 78) and now considering 400/438 (removed 38) transitions.
[2024-06-01 07:25:45] [INFO ] Redundant transitions in 37 ms returned []
Running 399 sub problems to find dead transitions.
// Phase 1: matrix 400 rows 458 cols
[2024-06-01 07:25:45] [INFO ] Computed 111 invariants in 22 ms
[2024-06-01 07:25:45] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/458 variables, 65/110 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 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 TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem 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 TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 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 TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD397 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 20/131 constraints. Problems are: Problem set: 158 solved, 241 unsolved
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
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 TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 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 TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 20/151 constraints. Problems are: Problem set: 222 solved, 177 unsolved
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 2 places in 11 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD285 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 20/171 constraints. Problems are: Problem set: 250 solved, 149 unsolved
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 20/191 constraints. Problems are: Problem set: 278 solved, 121 unsolved
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD146 is UNSAT
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD210 is UNSAT
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD212 is UNSAT
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 20/211 constraints. Problems are: Problem set: 283 solved, 116 unsolved
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:26:03] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:26:04] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:26:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD290 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 20/231 constraints. Problems are: Problem set: 284 solved, 115 unsolved
[2024-06-01 07:26:04] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:26:05] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:26:05] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:26:05] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:26:05] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:26:05] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:26:05] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:26:06] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:26:06] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:26:06] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:26:06] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:26:06] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:26:06] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:26:06] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:26:06] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 15/246 constraints. Problems are: Problem set: 284 solved, 115 unsolved
[2024-06-01 07:26:07] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:26:07] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:26:07] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:26:08] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 4/250 constraints. Problems are: Problem set: 284 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/250 constraints. Problems are: Problem set: 284 solved, 115 unsolved
Problem TDEAD129 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 13 (OVERLAPS) 399/857 variables, 458/708 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/857 variables, 11/719 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/857 variables, 0/719 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 16 (OVERLAPS) 1/858 variables, 1/720 constraints. Problems are: Problem set: 290 solved, 109 unsolved
[2024-06-01 07:26:12] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:26:12] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:26:12] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:26:12] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/858 variables, 4/724 constraints. Problems are: Problem set: 290 solved, 109 unsolved
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/858 variables, 2/726 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/858 variables, 0/726 constraints. Problems are: Problem set: 290 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 858/858 variables, and 726 constraints, problems are : Problem set: 290 solved, 109 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 458/458 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 145/145 constraints]
Escalating to Integer solving :Problem set: 290 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 197/407 variables, 65/65 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 2/67 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 145/212 constraints. Problems are: Problem set: 290 solved, 109 unsolved
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 20/232 constraints. Problems are: Problem set: 290 solved, 109 unsolved
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 12/244 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/244 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 49/456 variables, 44/288 constraints. Problems are: Problem set: 290 solved, 109 unsolved
[2024-06-01 07:26:21] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:26:21] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:26:21] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:26:21] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 4/292 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/292 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 399/855 variables, 456/748 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/855 variables, 11/759 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/855 variables, 109/868 constraints. Problems are: Problem set: 290 solved, 109 unsolved
[2024-06-01 07:26:28] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:26:29] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:26:29] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/855 variables, 3/871 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/855 variables, 0/871 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 15 (OVERLAPS) 2/857 variables, 2/873 constraints. Problems are: Problem set: 290 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/858 variables, and 873 constraints, problems are : Problem set: 290 solved, 109 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 458/458 constraints, ReadFeed: 11/12 constraints, PredecessorRefiner: 109/399 constraints, Known Traps: 184/184 constraints]
After SMT, in 60539ms problems are : Problem set: 290 solved, 109 unsolved
Search for dead transitions found 290 dead transitions in 60544ms
Found 290 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 290 transitions
Dead transitions reduction (with SMT) removed 290 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 458/536 places, 110/438 transitions.
Graph (complete) has 804 edges and 458 vertex of which 211 are kept as prefixes of interest. Removing 247 places using SCC suffix rule.2 ms
Discarding 247 places :
Also discarding 0 output transitions
Ensure Unique test removed 33 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 178 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 31 ms. Remains 178 /458 variables (removed 280) and now considering 127/110 (removed -17) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 178/536 places, 127/438 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60847 ms. Remains : 178/536 places, 127/438 transitions.
Support contains 4 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 438/438 transitions.
Applied a total of 0 rules in 17 ms. Remains 536 /536 variables (removed 0) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 536 cols
[2024-06-01 07:26:46] [INFO ] Computed 111 invariants in 3 ms
[2024-06-01 07:26:46] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-06-01 07:26:46] [INFO ] Invariant cache hit.
[2024-06-01 07:26:47] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-06-01 07:26:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 64/109 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:27:00] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:27:00] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:00] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:00] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:27:00] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 0 ms to minimize.
[2024-06-01 07:27:00] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:27:03] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:27:06] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:27:07] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:27:07] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:27:07] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:27:07] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:27:07] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:27:07] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:27:07] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:08] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:27:08] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:27:08] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:08] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:08] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 1 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:16] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:27:17] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:27:17] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:27:17] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:17] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/974 variables, and 236 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/536 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 125/125 constraints]
Escalating to Integer solving :Problem set: 0 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 64/109 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 125/236 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 62 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:27:22] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:27:22] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:27:22] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:27:22] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:27:22] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:22] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:27:22] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:27:23] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:27:23] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:27:23] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:27:23] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:23] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:27:23] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:27:23] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:27:23] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:27:24] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:27:25] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:26] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:27:26] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:26] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:27:26] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:26] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:27:26] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:27:26] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:27:26] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:27:27] [INFO ] Deduced a trap composed of 91 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:28] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:27:28] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:27:28] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:27:28] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:28] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:28] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:27:28] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:27:28] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:27:29] [INFO ] Deduced a trap composed of 112 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:27:29] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:27:29] [INFO ] Deduced a trap composed of 30 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:27:29] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:27:29] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:29] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:27:29] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:27:29] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:27:29] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:27:29] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:30] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:27:30] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 20/316 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:30] [INFO ] Deduced a trap composed of 31 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:27:30] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:27:30] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:27:38] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:27:38] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 20/356 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:39] [INFO ] Deduced a trap composed of 137 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:40] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:40] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:27:40] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:27:40] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:27:40] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:27:40] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:41] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:27:41] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:27:41] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:27:41] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:27:41] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:27:41] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:27:41] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:27:45] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:27:45] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:27:45] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:27:45] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:27:46] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/974 variables, and 397 constraints, problems are : Problem set: 0 solved, 437 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/536 constraints, PredecessorRefiner: 0/437 constraints, Known Traps: 286/286 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Finished structural reductions in LTL mode , in 1 iterations and 61033 ms. Remains : 536/536 places, 438/438 transitions.
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 261520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X((p1||X(p1))) U ((p2&&X((p1||X(p1))))||X(G((p1||X(p1))))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 472
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 472
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 468
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 468
Applied a total of 24 rules in 43 ms. Remains 539 /551 variables (removed 12) and now considering 468/480 (removed 12) transitions.
// Phase 1: matrix 468 rows 539 cols
[2024-06-01 07:27:47] [INFO ] Computed 107 invariants in 4 ms
[2024-06-01 07:27:47] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 07:27:47] [INFO ] Invariant cache hit.
[2024-06-01 07:27:48] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-06-01 07:27:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/147 constraints. Problems are: Problem set: 3 solved, 464 unsolved
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 127 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 127 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 1 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 124 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/167 constraints. Problems are: Problem set: 3 solved, 464 unsolved
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/187 constraints. Problems are: Problem set: 3 solved, 464 unsolved
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 3 solved, 464 unsolved
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 31 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 1 ms to minimize.
Problem TDEAD415 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/227 constraints. Problems are: Problem set: 20 solved, 447 unsolved
[2024-06-01 07:28:18] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:18] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:28:18] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:18] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1007 variables, and 231 constraints, problems are : Problem set: 20 solved, 447 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/539 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 124/124 constraints]
Escalating to Integer solving :Problem set: 20 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 20 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 124/231 constraints. Problems are: Problem set: 20 solved, 447 unsolved
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 114 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/251 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:28:25] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:28:25] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:25] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:28:25] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:28:25] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:25] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:25] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:28:25] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/271 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 118 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/291 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/311 constraints. Problems are: Problem set: 29 solved, 438 unsolved
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 31 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 61 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:36] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:28:36] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:28:36] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:36] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:28:36] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:28:37] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:37] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/331 constraints. Problems are: Problem set: 29 solved, 438 unsolved
[2024-06-01 07:28:38] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:28:38] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:28:38] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:28:38] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:28:38] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:28:39] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:28:39] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:28:39] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:39] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:28:39] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:28:39] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:28:40] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:28:41] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:28:41] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:41] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:28:41] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:28:41] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:28:41] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:28:42] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:28:42] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 20/351 constraints. Problems are: Problem set: 29 solved, 438 unsolved
[2024-06-01 07:28:42] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:28:42] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:28:42] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:28:43] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:28:44] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:28:44] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:28:44] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:28:44] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:28:44] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:28:44] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:28:44] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:28:44] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:28:45] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:28:45] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 20/371 constraints. Problems are: Problem set: 29 solved, 438 unsolved
[2024-06-01 07:28:45] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:28:45] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:28:46] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:28:46] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:28:46] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:28:46] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:46] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:28:46] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 60173ms, After SMT, problems are : Problem set: 29 solved, 438 unsolved
Search for dead transitions found 29 dead transitions in 60179ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 439/480 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 538 transition count 439
Applied a total of 1 rules in 9 ms. Remains 538 /539 variables (removed 1) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 538 cols
[2024-06-01 07:28:48] [INFO ] Computed 112 invariants in 3 ms
[2024-06-01 07:28:48] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 07:28:48] [INFO ] Invariant cache hit.
[2024-06-01 07:28:49] [INFO ] Implicit Places using invariants and state equation in 371 ms returned [60, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 534 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 536/551 places, 439/480 transitions.
Applied a total of 0 rules in 9 ms. Remains 536 /536 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61605 ms. Remains : 536/551 places, 439/480 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-05
Product exploration explored 100000 steps with 33501 reset in 134 ms.
Product exploration explored 100000 steps with 33444 reset in 147 ms.
Computed a total of 468 stabilizing places and 381 stable transitions
Graph (complete) has 1129 edges and 536 vertex of which 534 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 468 stabilizing places and 381 stable transitions
Detected a total of 468/536 stabilizing places and 381/439 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 503 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (196 resets) in 160 ms. (248 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (36 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (33 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (35 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
// Phase 1: matrix 439 rows 536 cols
[2024-06-01 07:28:50] [INFO ] Computed 110 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 195/198 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/400 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 5 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 129/529 variables, 46/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 434/963 variables, 529/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 5/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/963 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 11/974 variables, 6/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/974 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/975 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/975 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/975 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 975/975 variables, and 658 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1507 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 195/198 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/400 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 13/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 129/529 variables, 46/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 434/963 variables, 529/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/963 variables, 3/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/963 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 11/974 variables, 6/694 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/974 variables, 5/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/974 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/975 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/975 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/975 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 975/975 variables, and 700 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4013 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 51/51 constraints]
After SMT, in 5531ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 273 ms.
Support contains 3 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 439/439 transitions.
Graph (trivial) has 250 edges and 536 vertex of which 6 / 536 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1122 edges and 531 vertex of which 529 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 529 transition count 363
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 462 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 461 transition count 362
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 138 place count 461 transition count 251
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 382 place count 328 transition count 251
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 670 place count 180 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 674 place count 178 transition count 118
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 676 place count 178 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 176 transition count 116
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 679 place count 176 transition count 116
Applied a total of 679 rules in 51 ms. Remains 176 /536 variables (removed 360) and now considering 116/439 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 176/536 places, 116/439 transitions.
RANDOM walk for 1137 steps (50 resets) in 9 ms. (113 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 16 factoid took 1358 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 439/439 transitions.
Applied a total of 0 rules in 13 ms. Remains 536 /536 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2024-06-01 07:28:57] [INFO ] Invariant cache hit.
[2024-06-01 07:28:58] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 07:28:58] [INFO ] Invariant cache hit.
[2024-06-01 07:28:58] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-06-01 07:28:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 64/108 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:29:10] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:29:12] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 1 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:29:14] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 89 places in 226 ms of which 5 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 95 places in 164 ms of which 5 ms to minimize.
[2024-06-01 07:29:20] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 5 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 6 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:29:21] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 5 ms to minimize.
[2024-06-01 07:29:22] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 5 ms to minimize.
[2024-06-01 07:29:22] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 5 ms to minimize.
[2024-06-01 07:29:22] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:29:22] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:29:22] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 95 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:29:23] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:29:28] [INFO ] Deduced a trap composed of 92 places in 4471 ms of which 29 ms to minimize.
[2024-06-01 07:29:28] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
SMT process timed out in 30233ms, After SMT, problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 30238ms
Finished structural reductions in LTL mode , in 1 iterations and 30976 ms. Remains : 536/536 places, 439/439 transitions.
Computed a total of 468 stabilizing places and 381 stable transitions
Graph (complete) has 1129 edges and 536 vertex of which 534 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 468 stabilizing places and 381 stable transitions
Detected a total of 468/536 stabilizing places and 381/439 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 712 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (198 resets) in 327 ms. (121 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (36 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (36 resets) in 330 ms. (120 steps per ms) remains 3/3 properties
[2024-06-01 07:29:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 195/198 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/400 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:30] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 129/529 variables, 46/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 434/963 variables, 529/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 11/974 variables, 6/654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/974 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/975 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/975 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/975 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 975/975 variables, and 655 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1194 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 195/198 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 202/400 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:29:31] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:29:31] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:29:31] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 10/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 129/529 variables, 46/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 434/963 variables, 529/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 3/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/963 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 11/974 variables, 6/690 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 974/975 variables, and 690 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 42/42 constraints]
After SMT, in 6220ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 439/439 transitions.
Graph (trivial) has 250 edges and 536 vertex of which 6 / 536 are part of one of the 1 SCC in 2 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 1122 edges and 531 vertex of which 529 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 529 transition count 363
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 462 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 461 transition count 362
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 138 place count 461 transition count 251
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 382 place count 328 transition count 251
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 670 place count 180 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 674 place count 178 transition count 118
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 676 place count 178 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 176 transition count 116
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 679 place count 176 transition count 116
Applied a total of 679 rules in 54 ms. Remains 176 /536 variables (removed 360) and now considering 116/439 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 176/536 places, 116/439 transitions.
RANDOM walk for 654 steps (24 resets) in 8 ms. (72 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 16 factoid took 2240 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 33242 reset in 198 ms.
Product exploration explored 100000 steps with 33243 reset in 191 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 536 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 536/536 places, 439/439 transitions.
Graph (trivial) has 250 edges and 536 vertex of which 6 / 536 are part of one of the 1 SCC in 16 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1123 edges and 531 vertex of which 529 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 529 transition count 431
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 85 Pre rules applied. Total rules applied 64 place count 529 transition count 490
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 149 place count 529 transition count 490
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 176 place count 502 transition count 445
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 203 place count 502 transition count 445
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 1 with 171 rules applied. Total rules applied 374 place count 502 transition count 445
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 419 place count 457 transition count 400
Deduced a syphon composed of 246 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 464 place count 457 transition count 400
Deduced a syphon composed of 246 places in 1 ms
Applied a total of 464 rules in 87 ms. Remains 457 /536 variables (removed 79) and now considering 400/439 (removed 39) transitions.
[2024-06-01 07:29:40] [INFO ] Redundant transitions in 6 ms returned []
Running 399 sub problems to find dead transitions.
// Phase 1: matrix 400 rows 457 cols
[2024-06-01 07:29:40] [INFO ] Computed 110 invariants in 6 ms
[2024-06-01 07:29:40] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/457 variables, 65/109 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 399 unsolved
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-01 07:29:48] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:29:49] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem 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 TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD397 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 20/130 constraints. Problems are: Problem set: 165 solved, 234 unsolved
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 07:29:50] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 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 TDEAD254 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 20/150 constraints. Problems are: Problem set: 225 solved, 174 unsolved
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 07:29:51] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 07:29:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 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 TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 20/170 constraints. Problems are: Problem set: 259 solved, 140 unsolved
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 4 ms to minimize.
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:29:53] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:29:56] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 2 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-06-01 07:29:56] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 5 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 20/190 constraints. Problems are: Problem set: 276 solved, 123 unsolved
[2024-06-01 07:29:56] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:29:56] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 4 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 4 ms to minimize.
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 4 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
Problem TDEAD209 is UNSAT
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
[2024-06-01 07:29:57] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:29:58] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD285 is UNSAT
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:29:59] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 3 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD285 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 20/210 constraints. Problems are: Problem set: 281 solved, 118 unsolved
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 4 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:30:00] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 5 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 5 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:30:02] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 13/223 constraints. Problems are: Problem set: 281 solved, 118 unsolved
[2024-06-01 07:30:04] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:30:04] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:30:04] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:30:04] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:30:04] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 4 ms to minimize.
[2024-06-01 07:30:04] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:30:05] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:30:05] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 8/231 constraints. Problems are: Problem set: 281 solved, 118 unsolved
[2024-06-01 07:30:06] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:30:06] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:30:06] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:30:06] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:30:06] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 4 ms to minimize.
[2024-06-01 07:30:07] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 8/239 constraints. Problems are: Problem set: 281 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/239 constraints. Problems are: Problem set: 281 solved, 118 unsolved
Problem TDEAD102 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 13 (OVERLAPS) 399/856 variables, 457/696 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/856 variables, 11/707 constraints. Problems are: Problem set: 290 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 856/857 variables, and 707 constraints, problems are : Problem set: 290 solved, 109 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 457/457 constraints, ReadFeed: 11/12 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 129/129 constraints]
Escalating to Integer solving :Problem set: 290 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 196/406 variables, 65/65 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 1/66 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 129/195 constraints. Problems are: Problem set: 290 solved, 109 unsolved
[2024-06-01 07:30:11] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:30:11] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:30:11] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:30:11] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:30:11] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:30:12] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:30:12] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:30:12] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:30:12] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:30:12] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:30:12] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:30:13] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:30:13] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:30:13] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:30:13] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:30:13] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:30:13] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:30:13] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/215 constraints. Problems are: Problem set: 290 solved, 109 unsolved
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 2 ms to minimize.
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:30:14] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 28 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 1 ms to minimize.
[2024-06-01 07:30:15] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 10/225 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/225 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 49/455 variables, 44/269 constraints. Problems are: Problem set: 290 solved, 109 unsolved
[2024-06-01 07:30:17] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 1/270 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/270 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 399/854 variables, 455/725 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/854 variables, 11/736 constraints. Problems are: Problem set: 290 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/854 variables, 109/845 constraints. Problems are: Problem set: 290 solved, 109 unsolved
[2024-06-01 07:30:23] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/854 variables, 1/846 constraints. Problems are: Problem set: 290 solved, 109 unsolved
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 5 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/854 variables, 2/848 constraints. Problems are: Problem set: 290 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 854/857 variables, and 848 constraints, problems are : Problem set: 290 solved, 109 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 455/457 constraints, ReadFeed: 11/12 constraints, PredecessorRefiner: 109/399 constraints, Known Traps: 163/163 constraints]
After SMT, in 60312ms problems are : Problem set: 290 solved, 109 unsolved
Search for dead transitions found 290 dead transitions in 60316ms
Found 290 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 290 transitions
Dead transitions reduction (with SMT) removed 290 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 457/536 places, 110/439 transitions.
Graph (complete) has 802 edges and 457 vertex of which 211 are kept as prefixes of interest. Removing 246 places using SCC suffix rule.1 ms
Discarding 246 places :
Also discarding 0 output transitions
Ensure Unique test removed 33 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 178 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 22 ms. Remains 178 /457 variables (removed 279) and now considering 127/110 (removed -17) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 178/536 places, 127/439 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60440 ms. Remains : 178/536 places, 127/439 transitions.
Support contains 3 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 439/439 transitions.
Applied a total of 0 rules in 20 ms. Remains 536 /536 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 536 cols
[2024-06-01 07:30:40] [INFO ] Computed 110 invariants in 9 ms
[2024-06-01 07:30:40] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 07:30:40] [INFO ] Invariant cache hit.
[2024-06-01 07:30:41] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-06-01 07:30:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 64/108 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:31:04] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 95 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:31:05] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:31:06] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 1 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:31:07] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:31:08] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:31:09] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:31:09] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:31:09] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:31:09] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:31:10] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:31:10] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:31:10] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:31:10] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:31:10] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:31:10] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:31:11] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
SMT process timed out in 30209ms, After SMT, problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 30215ms
Finished structural reductions in LTL mode , in 1 iterations and 30955 ms. Remains : 536/536 places, 439/439 transitions.
Treatment of property BusinessProcesses-PT-20-LTLFireability-05 finished in 204308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F((p1||G(p2))) U p3))))'
Support contains 2 out of 551 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Graph (trivial) has 259 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1216 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 543 transition count 401
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 473 transition count 401
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 142 place count 473 transition count 289
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 388 place count 339 transition count 289
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 395 place count 332 transition count 282
Iterating global reduction 2 with 7 rules applied. Total rules applied 402 place count 332 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 402 place count 332 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 404 place count 331 transition count 281
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 278 rules applied. Total rules applied 682 place count 190 transition count 144
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 688 place count 187 transition count 150
Applied a total of 688 rules in 58 ms. Remains 187 /551 variables (removed 364) and now considering 150/480 (removed 330) transitions.
[2024-06-01 07:31:11] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 187 cols
[2024-06-01 07:31:11] [INFO ] Computed 81 invariants in 1 ms
[2024-06-01 07:31:17] [INFO ] Implicit Places using invariants in 6097 ms returned [27, 28, 29, 30, 31, 36, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 6110 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/551 places, 150/480 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6172 ms. Remains : 164/551 places, 150/480 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-07 finished in 6257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 472
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 472
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 468
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 468
Applied a total of 24 rules in 58 ms. Remains 539 /551 variables (removed 12) and now considering 468/480 (removed 12) transitions.
// Phase 1: matrix 468 rows 539 cols
[2024-06-01 07:31:18] [INFO ] Computed 107 invariants in 3 ms
[2024-06-01 07:31:18] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 07:31:18] [INFO ] Invariant cache hit.
[2024-06-01 07:31:18] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-06-01 07:31:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-01 07:31:45] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 2 ms to minimize.
[2024-06-01 07:31:45] [INFO ] Deduced a trap composed of 91 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:31:46] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:31:46] [INFO ] Deduced a trap composed of 90 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:31:46] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:31:46] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:31:46] [INFO ] Deduced a trap composed of 88 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 89 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 91 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:31:47] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:31:48] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:31:49] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 3 ms to minimize.
SMT process timed out in 30279ms, After SMT, problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 30284ms
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 468/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31112 ms. Remains : 539/551 places, 468/480 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 295 ms.
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Computed a total of 471 stabilizing places and 410 stable transitions
Graph (complete) has 1202 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 471 stabilizing places and 410 stable transitions
Detected a total of 471/539 stabilizing places and 410/468 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLFireability-08 finished in 31895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U p1)))))'
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 472
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 472
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 540 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 540 transition count 469
Applied a total of 22 rules in 60 ms. Remains 540 /551 variables (removed 11) and now considering 469/480 (removed 11) transitions.
// Phase 1: matrix 469 rows 540 cols
[2024-06-01 07:31:49] [INFO ] Computed 107 invariants in 4 ms
[2024-06-01 07:31:50] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-01 07:31:50] [INFO ] Invariant cache hit.
[2024-06-01 07:31:50] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2024-06-01 07:31:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 07:32:01] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 5 ms to minimize.
[2024-06-01 07:32:01] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:32:01] [INFO ] Deduced a trap composed of 87 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:32:01] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:32:01] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:32:01] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:32:02] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:32:02] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:32:02] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:32:02] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:32:02] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:32:02] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:32:02] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:32:03] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:32:03] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:32:03] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:32:03] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:32:03] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:32:03] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:32:03] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/127 constraints. Problems are: Problem set: 6 solved, 462 unsolved
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 90 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:32:04] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:32:06] [INFO ] Deduced a trap composed of 91 places in 1774 ms of which 29 ms to minimize.
[2024-06-01 07:32:06] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:32:06] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:32:07] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:32:07] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:32:07] [INFO ] Deduced a trap composed of 90 places in 183 ms of which 2 ms to minimize.
[2024-06-01 07:32:07] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:32:07] [INFO ] Deduced a trap composed of 90 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:32:08] [INFO ] Deduced a trap composed of 91 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:32:08] [INFO ] Deduced a trap composed of 84 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:32:08] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:32:08] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:32:08] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 2 ms to minimize.
[2024-06-01 07:32:08] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/147 constraints. Problems are: Problem set: 6 solved, 462 unsolved
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:32:09] [INFO ] Deduced a trap composed of 83 places in 176 ms of which 2 ms to minimize.
[2024-06-01 07:32:10] [INFO ] Deduced a trap composed of 88 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:32:10] [INFO ] Deduced a trap composed of 86 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:32:10] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:32:10] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:32:10] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:32:10] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:32:11] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 80 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:32:12] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/167 constraints. Problems are: Problem set: 6 solved, 462 unsolved
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 90 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 94 places in 194 ms of which 6 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:32:16] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 1 ms to minimize.
[2024-06-01 07:32:17] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:32:17] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:32:17] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:32:17] [INFO ] Deduced a trap composed of 103 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:32:17] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:32:17] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:32:18] [INFO ] Deduced a trap composed of 77 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:32:18] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:32:18] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:32:18] [INFO ] Deduced a trap composed of 96 places in 239 ms of which 5 ms to minimize.
[2024-06-01 07:32:18] [INFO ] Deduced a trap composed of 92 places in 246 ms of which 7 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 87 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 85 places in 251 ms of which 7 ms to minimize.
[2024-06-01 07:32:19] [INFO ] Deduced a trap composed of 87 places in 239 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/187 constraints. Problems are: Problem set: 6 solved, 462 unsolved
[2024-06-01 07:32:20] [INFO ] Deduced a trap composed of 92 places in 269 ms of which 5 ms to minimize.
[2024-06-01 07:32:20] [INFO ] Deduced a trap composed of 96 places in 270 ms of which 6 ms to minimize.
[2024-06-01 07:32:20] [INFO ] Deduced a trap composed of 98 places in 237 ms of which 6 ms to minimize.
SMT process timed out in 30105ms, After SMT, problems are : Problem set: 6 solved, 462 unsolved
Search for dead transitions found 6 dead transitions in 30111ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 540/551 places, 463/480 transitions.
Applied a total of 0 rules in 19 ms. Remains 540 /540 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31068 ms. Remains : 540/551 places, 463/480 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-11 finished in 31318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0&&G(p1))||(p2&&(p0 U X(p3)))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 472
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 472
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 540 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 540 transition count 469
Applied a total of 22 rules in 70 ms. Remains 540 /551 variables (removed 11) and now considering 469/480 (removed 11) transitions.
// Phase 1: matrix 469 rows 540 cols
[2024-06-01 07:32:21] [INFO ] Computed 107 invariants in 7 ms
[2024-06-01 07:32:21] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-01 07:32:21] [INFO ] Invariant cache hit.
[2024-06-01 07:32:22] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2024-06-01 07:32:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 07:32:34] [INFO ] Deduced a trap composed of 97 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:32:35] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 88 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:32:36] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:32:37] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:32:37] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:32:37] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:32:37] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:32:37] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:32:37] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:32:38] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-06-01 07:32:38] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:32:38] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:32:38] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:32:38] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:32:38] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:32:39] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:32:40] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:32:40] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:32:40] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:32:40] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:32:40] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:32:40] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:32:40] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:32:41] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
Problem TDEAD419 is UNSAT
Problem TDEAD435 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/147 constraints. Problems are: Problem set: 2 solved, 466 unsolved
[2024-06-01 07:32:41] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:32:41] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:32:41] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:32:41] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:32:42] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:32:43] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:32:43] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:32:43] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:32:43] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:32:43] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:32:43] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:32:43] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:32:44] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:32:44] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:32:44] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
Problem TDEAD414 is UNSAT
Problem TDEAD426 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/167 constraints. Problems are: Problem set: 4 solved, 464 unsolved
[2024-06-01 07:32:48] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:32:48] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:32:48] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:32:48] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:32:48] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:32:48] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:32:48] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:32:49] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:32:49] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:32:49] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:32:49] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:32:49] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:32:49] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:32:49] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:32:50] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:32:50] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:32:50] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:32:50] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:32:50] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:32:50] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 4 ms to minimize.
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/187 constraints. Problems are: Problem set: 8 solved, 460 unsolved
[2024-06-01 07:32:51] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:32:51] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:32:51] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:32:51] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:32:51] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:32:52] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:32:52] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:32:52] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:32:52] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 30215ms, After SMT, problems are : Problem set: 8 solved, 460 unsolved
Search for dead transitions found 8 dead transitions in 30230ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 540/551 places, 461/480 transitions.
Applied a total of 0 rules in 8 ms. Remains 540 /540 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31262 ms. Remains : 540/551 places, 461/480 transitions.
Stuttering acceptance computed with spot in 454 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-12
Stuttering criterion allowed to conclude after 177 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-12 finished in 31762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||X(F(p0))))||((!p0||X(F(p0)))&&F(G(p1))))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 543 transition count 472
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 543 transition count 472
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 539 transition count 468
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 539 transition count 468
Applied a total of 24 rules in 64 ms. Remains 539 /551 variables (removed 12) and now considering 468/480 (removed 12) transitions.
// Phase 1: matrix 468 rows 539 cols
[2024-06-01 07:32:53] [INFO ] Computed 107 invariants in 12 ms
[2024-06-01 07:32:53] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-06-01 07:32:53] [INFO ] Invariant cache hit.
[2024-06-01 07:32:54] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-06-01 07:32:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-06-01 07:33:06] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:33:07] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:33:08] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:33:08] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:33:08] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:33:08] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:33:08] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:33:08] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:33:08] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:33:09] [INFO ] Deduced a trap composed of 95 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:33:09] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:33:09] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:33:09] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 2 ms to minimize.
Problem TDEAD410 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 20/127 constraints. Problems are: Problem set: 10 solved, 457 unsolved
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 88 places in 290 ms of which 3 ms to minimize.
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 96 places in 237 ms of which 5 ms to minimize.
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 98 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:33:10] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:33:11] [INFO ] Deduced a trap composed of 88 places in 214 ms of which 3 ms to minimize.
[2024-06-01 07:33:11] [INFO ] Deduced a trap composed of 94 places in 232 ms of which 6 ms to minimize.
[2024-06-01 07:33:11] [INFO ] Deduced a trap composed of 94 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:33:11] [INFO ] Deduced a trap composed of 92 places in 239 ms of which 6 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 96 places in 238 ms of which 3 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 90 places in 189 ms of which 5 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 92 places in 224 ms of which 6 ms to minimize.
[2024-06-01 07:33:12] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 5 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:33:13] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/147 constraints. Problems are: Problem set: 10 solved, 457 unsolved
[2024-06-01 07:33:14] [INFO ] Deduced a trap composed of 86 places in 254 ms of which 6 ms to minimize.
[2024-06-01 07:33:14] [INFO ] Deduced a trap composed of 117 places in 168 ms of which 4 ms to minimize.
[2024-06-01 07:33:14] [INFO ] Deduced a trap composed of 88 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:33:15] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:33:15] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:33:15] [INFO ] Deduced a trap composed of 93 places in 225 ms of which 5 ms to minimize.
[2024-06-01 07:33:15] [INFO ] Deduced a trap composed of 95 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:33:15] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:33:15] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:33:16] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:33:16] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:33:16] [INFO ] Deduced a trap composed of 86 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:33:16] [INFO ] Deduced a trap composed of 92 places in 241 ms of which 6 ms to minimize.
[2024-06-01 07:33:16] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:33:17] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:33:17] [INFO ] Deduced a trap composed of 96 places in 230 ms of which 6 ms to minimize.
[2024-06-01 07:33:17] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:33:17] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:33:17] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:33:18] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 3 ms to minimize.
Problem TDEAD408 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/167 constraints. Problems are: Problem set: 22 solved, 445 unsolved
[2024-06-01 07:33:22] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 88 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 4 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:33:23] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:33:24] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 3 ms to minimize.
SMT process timed out in 30180ms, After SMT, problems are : Problem set: 22 solved, 445 unsolved
Search for dead transitions found 22 dead transitions in 30190ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 446/480 transitions.
Applied a total of 0 rules in 12 ms. Remains 539 /539 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31268 ms. Remains : 539/551 places, 446/480 transitions.
Stuttering acceptance computed with spot in 265 ms :[false, false, (NOT p0), false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-14
Product exploration explored 100000 steps with 501 reset in 387 ms.
Stack based approach found an accepted trace after 33119 steps with 162 reset with depth 367 and stack size 351 in 150 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-14 finished in 32107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Graph (trivial) has 263 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1216 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 543 transition count 399
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 471 transition count 399
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 146 place count 471 transition count 287
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 391 place count 338 transition count 287
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 400 place count 329 transition count 278
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 329 transition count 278
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 409 place count 329 transition count 277
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 411 place count 328 transition count 277
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 278 rules applied. Total rules applied 689 place count 187 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 695 place count 184 transition count 146
Applied a total of 695 rules in 42 ms. Remains 184 /551 variables (removed 367) and now considering 146/480 (removed 334) transitions.
[2024-06-01 07:33:25] [INFO ] Flow matrix only has 145 transitions (discarded 1 similar events)
// Phase 1: matrix 145 rows 184 cols
[2024-06-01 07:33:25] [INFO ] Computed 82 invariants in 3 ms
[2024-06-01 07:33:25] [INFO ] Implicit Places using invariants in 183 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 59, 160]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 185 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/551 places, 146/480 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 159/551 places, 146/480 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-15 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F((p1&&X((p1 U (p2||G(p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1||(p2&&G(p3)))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-20-LTLFireability-04
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 551/551 places, 480/480 transitions.
Graph (trivial) has 260 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1216 edges and 546 vertex of which 544 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 543 transition count 401
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 473 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 472 transition count 400
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 144 place count 472 transition count 290
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 384 place count 342 transition count 290
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 392 place count 334 transition count 282
Iterating global reduction 3 with 8 rules applied. Total rules applied 400 place count 334 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 400 place count 334 transition count 281
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 402 place count 333 transition count 281
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 684 place count 190 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 690 place count 187 transition count 148
Applied a total of 690 rules in 66 ms. Remains 187 /551 variables (removed 364) and now considering 148/480 (removed 332) transitions.
[2024-06-01 07:33:25] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 187 cols
[2024-06-01 07:33:25] [INFO ] Computed 83 invariants in 1 ms
[2024-06-01 07:33:26] [INFO ] Implicit Places using invariants in 223 ms returned [28, 29, 30, 31, 32, 37, 38, 42, 46, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 147]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 240 ms to find 25 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 162/551 places, 148/480 transitions.
Applied a total of 0 rules in 5 ms. Remains 162 /162 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 315 ms. Remains : 162/551 places, 148/480 transitions.
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-04
Product exploration explored 100000 steps with 17069 reset in 471 ms.
Product exploration explored 100000 steps with 16824 reset in 368 ms.
Computed a total of 84 stabilizing places and 92 stable transitions
Computed a total of 84 stabilizing places and 92 stable transitions
Detected a total of 84/162 stabilizing places and 92/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 193 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
RANDOM walk for 40000 steps (6781 resets) in 1659 ms. (24 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (1643 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
[2024-06-01 07:33:27] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 162 cols
[2024-06-01 07:33:28] [INFO ] Computed 58 invariants in 2 ms
[2024-06-01 07:33:28] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/132 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/160 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 146/306 variables, 160/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/308 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/308 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/309 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 162/162 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/132 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/160 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 146/306 variables, 160/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/308 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/308 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/309 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 162/162 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p1 p2) (OR p1 p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 8 factoid took 356 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-06-01 07:33:29] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
[2024-06-01 07:33:29] [INFO ] Invariant cache hit.
[2024-06-01 07:33:29] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 07:33:29] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
[2024-06-01 07:33:29] [INFO ] Invariant cache hit.
[2024-06-01 07:33:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:33:29] [INFO ] Implicit Places using invariants and state equation in 300 ms returned [6, 10, 50, 52, 54, 62, 96, 98, 100, 102, 104, 106, 108]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 455 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 149/162 places, 148/148 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 147 transition count 145
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 147 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 145 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 145 transition count 143
Applied a total of 8 rules in 5 ms. Remains 145 /149 variables (removed 4) and now considering 143/148 (removed 5) transitions.
[2024-06-01 07:33:29] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
// Phase 1: matrix 142 rows 145 cols
[2024-06-01 07:33:29] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 07:33:29] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 07:33:29] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
[2024-06-01 07:33:29] [INFO ] Invariant cache hit.
[2024-06-01 07:33:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:33:29] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 145/162 places, 143/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 798 ms. Remains : 145/162 places, 143/148 transitions.
Computed a total of 67 stabilizing places and 87 stable transitions
Graph (complete) has 512 edges and 145 vertex of which 136 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Computed a total of 67 stabilizing places and 87 stable transitions
Detected a total of 67/145 stabilizing places and 87/143 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 113 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
RANDOM walk for 40000 steps (6823 resets) in 588 ms. (67 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (1683 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1635 resets) in 296 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1636 resets) in 261 ms. (152 steps per ms) remains 3/3 properties
[2024-06-01 07:33:30] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
[2024-06-01 07:33:30] [INFO ] Invariant cache hit.
[2024-06-01 07:33:30] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 55/112 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 22/134 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 138/272 variables, 134/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 14/286 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/286 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/287 variables, and 195 constraints, problems are : Problem set: 0 solved, 3 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 145/145 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 55/112 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:33:30] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 22/134 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 138/272 variables, 134/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:33:31] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 14/286 variables, 11/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/286 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/286 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/287 variables, and 200 constraints, problems are : Problem set: 0 solved, 3 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 145/145 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 638ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 96 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=32 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p1 p2) (OR p1 p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 8 factoid took 468 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Product exploration explored 100000 steps with 16915 reset in 282 ms.
Product exploration explored 100000 steps with 16904 reset in 254 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 143/143 transitions.
Graph (complete) has 512 edges and 145 vertex of which 136 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 136 transition count 139
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 129 transition count 111
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 129 transition count 111
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 129 transition count 112
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 22 rules in 24 ms. Remains 129 /145 variables (removed 16) and now considering 112/143 (removed 31) transitions.
[2024-06-01 07:33:33] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-01 07:33:33] [INFO ] Flow matrix only has 111 transitions (discarded 1 similar events)
// Phase 1: matrix 111 rows 129 cols
[2024-06-01 07:33:33] [INFO ] Computed 40 invariants in 1 ms
[2024-06-01 07:33:33] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/129 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:33:34] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 20/60 constraints. Problems are: Problem set: 2 solved, 103 unsolved
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:33:35] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 3 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:33:36] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 20/80 constraints. Problems are: Problem set: 2 solved, 103 unsolved
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:33:37] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:33:38] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:33:39] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:33:39] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:33:39] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 20/100 constraints. Problems are: Problem set: 3 solved, 102 unsolved
[2024-06-01 07:33:39] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/101 constraints. Problems are: Problem set: 11 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/101 constraints. Problems are: Problem set: 11 solved, 94 unsolved
Problem TDEAD32 is UNSAT
At refinement iteration 10 (OVERLAPS) 110/239 variables, 129/230 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 5/235 constraints. Problems are: Problem set: 12 solved, 93 unsolved
[2024-06-01 07:33:40] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 1/236 constraints. Problems are: Problem set: 12 solved, 93 unsolved
[2024-06-01 07:33:41] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:33:42] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 8/244 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/244 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 0/239 variables, 0/244 constraints. Problems are: Problem set: 12 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/240 variables, and 244 constraints, problems are : Problem set: 12 solved, 93 unsolved in 10839 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 12 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 5/5 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 42/47 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/47 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 8/129 variables, 33/80 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/82 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 28/110 constraints. Problems are: Problem set: 12 solved, 93 unsolved
[2024-06-01 07:33:44] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:33:44] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:33:44] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:33:45] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 13/123 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/123 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 110/239 variables, 129/252 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 5/257 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 93/350 constraints. Problems are: Problem set: 12 solved, 93 unsolved
[2024-06-01 07:33:48] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 1/351 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 0/351 constraints. Problems are: Problem set: 12 solved, 93 unsolved
[2024-06-01 07:33:51] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:33:51] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:33:52] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/239 variables, 4/355 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/355 constraints. Problems are: Problem set: 12 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 0/239 variables, 0/355 constraints. Problems are: Problem set: 12 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/240 variables, and 355 constraints, problems are : Problem set: 12 solved, 93 unsolved in 15722 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 93/105 constraints, Known Traps: 88/88 constraints]
After SMT, in 26670ms problems are : Problem set: 12 solved, 93 unsolved
Search for dead transitions found 12 dead transitions in 26672ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 129/145 places, 100/143 transitions.
Graph (complete) has 406 edges and 129 vertex of which 122 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 4 ms. Remains 121 /129 variables (removed 8) and now considering 100/100 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/145 places, 100/143 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26724 ms. Remains : 121/145 places, 100/143 transitions.
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 143/143 transitions.
Applied a total of 0 rules in 0 ms. Remains 145 /145 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-06-01 07:34:00] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
// Phase 1: matrix 142 rows 145 cols
[2024-06-01 07:34:00] [INFO ] Computed 45 invariants in 3 ms
[2024-06-01 07:34:00] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 07:34:00] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
[2024-06-01 07:34:00] [INFO ] Invariant cache hit.
[2024-06-01 07:34:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:34:00] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-06-01 07:34:00] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
[2024-06-01 07:34:00] [INFO ] Invariant cache hit.
[2024-06-01 07:34:00] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 07:34:01] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:34:01] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:34:01] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-06-01 07:34:01] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:34:01] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 5/20 constraints. Problems are: Problem set: 12 solved, 124 unsolved
[2024-06-01 07:34:02] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/21 constraints. Problems are: Problem set: 14 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/21 constraints. Problems are: Problem set: 14 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 1/145 variables, 28/49 constraints. Problems are: Problem set: 14 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/51 constraints. Problems are: Problem set: 14 solved, 122 unsolved
[2024-06-01 07:34:03] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:34:03] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:34:03] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:34:03] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:34:03] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:34:03] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:34:04] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 20/71 constraints. Problems are: Problem set: 15 solved, 121 unsolved
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:34:05] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:34:06] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 6 ms to minimize.
[2024-06-01 07:34:06] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:34:06] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:34:06] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2024-06-01 07:34:06] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:34:06] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 20/91 constraints. Problems are: Problem set: 20 solved, 116 unsolved
[2024-06-01 07:34:06] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:34:06] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:34:06] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:34:06] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:34:06] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:34:07] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:34:08] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:34:08] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:34:08] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 20/111 constraints. Problems are: Problem set: 22 solved, 114 unsolved
[2024-06-01 07:34:08] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:34:08] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:34:09] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:34:09] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:34:09] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:34:09] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:34:09] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:34:09] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 8/119 constraints. Problems are: Problem set: 23 solved, 113 unsolved
[2024-06-01 07:34:09] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:34:09] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:34:09] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:34:10] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 13/132 constraints. Problems are: Problem set: 23 solved, 113 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 0/132 constraints. Problems are: Problem set: 23 solved, 113 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 13 (OVERLAPS) 141/286 variables, 145/277 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 5/282 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/286 variables, 0/282 constraints. Problems are: Problem set: 32 solved, 104 unsolved
[2024-06-01 07:34:13] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:34:13] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/286 variables, 2/284 constraints. Problems are: Problem set: 32 solved, 104 unsolved
[2024-06-01 07:34:14] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/286 variables, 1/285 constraints. Problems are: Problem set: 32 solved, 104 unsolved
[2024-06-01 07:34:14] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/286 variables, 1/286 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/286 variables, 0/286 constraints. Problems are: Problem set: 32 solved, 104 unsolved
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:34:16] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 4 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/286 variables, 5/291 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/286 variables, 0/291 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 22 (OVERLAPS) 0/286 variables, 0/291 constraints. Problems are: Problem set: 32 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/287 variables, and 291 constraints, problems are : Problem set: 32 solved, 104 unsolved in 18325 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 145/145 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 32 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 5/5 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 10/15 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 25/40 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/40 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 1/145 variables, 28/68 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 2/70 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 71/141 constraints. Problems are: Problem set: 32 solved, 104 unsolved
[2024-06-01 07:34:19] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:34:19] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:34:19] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 11/152 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/152 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 141/286 variables, 145/297 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 5/302 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 104/406 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/406 constraints. Problems are: Problem set: 32 solved, 104 unsolved
At refinement iteration 13 (OVERLAPS) 0/286 variables, 0/406 constraints. Problems are: Problem set: 32 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/287 variables, and 406 constraints, problems are : Problem set: 32 solved, 104 unsolved in 9110 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 145/145 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 104/136 constraints, Known Traps: 107/107 constraints]
After SMT, in 27524ms problems are : Problem set: 32 solved, 104 unsolved
Search for dead transitions found 32 dead transitions in 27526ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 145/145 places, 111/143 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 134 transition count 111
Applied a total of 11 rules in 4 ms. Remains 134 /145 variables (removed 11) and now considering 111/111 (removed 0) transitions.
[2024-06-01 07:34:27] [INFO ] Flow matrix only has 110 transitions (discarded 1 similar events)
// Phase 1: matrix 110 rows 134 cols
[2024-06-01 07:34:27] [INFO ] Computed 43 invariants in 0 ms
[2024-06-01 07:34:28] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 07:34:28] [INFO ] Flow matrix only has 110 transitions (discarded 1 similar events)
[2024-06-01 07:34:28] [INFO ] Invariant cache hit.
[2024-06-01 07:34:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:34:28] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [39, 41, 43]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 350 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/145 places, 111/143 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 129 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 129 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 129 transition count 108
Applied a total of 5 rules in 4 ms. Remains 129 /131 variables (removed 2) and now considering 108/111 (removed 3) transitions.
[2024-06-01 07:34:28] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
// Phase 1: matrix 107 rows 129 cols
[2024-06-01 07:34:28] [INFO ] Computed 40 invariants in 0 ms
[2024-06-01 07:34:28] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 07:34:28] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
[2024-06-01 07:34:28] [INFO ] Invariant cache hit.
[2024-06-01 07:34:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:34:28] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 129/145 places, 108/143 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 28487 ms. Remains : 129/145 places, 108/143 transitions.
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 63031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X((p1||X(p1))) U ((p2&&X((p1||X(p1))))||X(G((p1||X(p1))))))))'
[2024-06-01 07:34:28] [INFO ] Flatten gal took : 54 ms
[2024-06-01 07:34:28] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:34:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 551 places, 480 transitions and 1513 arcs took 15 ms.
Total runtime 1059431 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BusinessProcesses-PT-20-LTLFireability-03
FORMULA BusinessProcesses-PT-20-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-20-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717228063838

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-20-LTLFireability-03
ltl formula formula --ltl=/tmp/13848/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 551 places, 480 transitions and 1513 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.030 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/13848/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/13848/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/13848/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/13848/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 552 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 552, there are 517 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~194 levels ~10000 states ~39388 transitions
pnml2lts-mc( 2/ 4): ~194 levels ~20000 states ~85484 transitions
pnml2lts-mc( 2/ 4): ~194 levels ~40000 states ~191372 transitions
pnml2lts-mc( 2/ 4): ~194 levels ~80000 states ~423996 transitions
pnml2lts-mc( 1/ 4): ~534 levels ~160000 states ~754540 transitions
pnml2lts-mc( 1/ 4): ~534 levels ~320000 states ~1653796 transitions
pnml2lts-mc( 1/ 4): ~534 levels ~640000 states ~3604132 transitions
pnml2lts-mc( 1/ 4): ~534 levels ~1280000 states ~7636500 transitions
pnml2lts-mc( 2/ 4): ~194 levels ~2560000 states ~18829900 transitions
pnml2lts-mc( 2/ 4): ~194 levels ~5120000 states ~39673156 transitions
pnml2lts-mc( 2/ 4): ~194 levels ~10240000 states ~84142668 transitions
pnml2lts-mc( 1/ 4): ~534 levels ~20480000 states ~156127668 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 23527829
pnml2lts-mc( 0/ 4): unique states count: 24180728
pnml2lts-mc( 0/ 4): unique transitions count: 200745334
pnml2lts-mc( 0/ 4): - self-loop count: 129
pnml2lts-mc( 0/ 4): - claim dead count: 176297778
pnml2lts-mc( 0/ 4): - claim found count: 260824
pnml2lts-mc( 0/ 4): - claim success count: 24180738
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1083
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 24180738 states 200745370 transitions, fanout: 8.302
pnml2lts-mc( 0/ 4): Total exploration time 282.180 sec (282.170 sec minimum, 282.175 sec on average)
pnml2lts-mc( 0/ 4): States per second: 85693, Transitions per second: 711409
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 248.5MB, 10.8 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 72.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 492 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 248.5MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-20-LTLFireability-04
ltl formula formula --ltl=/tmp/13848/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 551 places, 480 transitions and 1513 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.010 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/13848/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/13848/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/13848/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/13848/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 553 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 552, there are 518 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1063 levels ~10000 states ~22828 transitions
pnml2lts-mc( 0/ 4): ~1476 levels ~20000 states ~48516 transitions
pnml2lts-mc( 0/ 4): ~2306 levels ~40000 states ~98348 transitions
pnml2lts-mc( 0/ 4): ~3344 levels ~80000 states ~203512 transitions
pnml2lts-mc( 0/ 4): ~4131 levels ~160000 states ~459960 transitions
pnml2lts-mc( 0/ 4): ~4131 levels ~320000 states ~1272136 transitions
pnml2lts-mc( 0/ 4): ~4131 levels ~640000 states ~2990372 transitions
pnml2lts-mc( 0/ 4): ~4152 levels ~1280000 states ~6652268 transitions
pnml2lts-mc( 0/ 4): ~4152 levels ~2560000 states ~14705756 transitions
pnml2lts-mc( 0/ 4): ~4152 levels ~5120000 states ~31851948 transitions
pnml2lts-mc( 0/ 4): ~5379 levels ~10240000 states ~64327644 transitions
pnml2lts-mc( 0/ 4): ~15596 levels ~20480000 states ~133193116 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 29982699
pnml2lts-mc( 0/ 4): unique states count: 33460585
pnml2lts-mc( 0/ 4): unique transitions count: 268642809
pnml2lts-mc( 0/ 4): - self-loop count: 2510
pnml2lts-mc( 0/ 4): - claim dead count: 233489242
pnml2lts-mc( 0/ 4): - claim found count: 1562615
pnml2lts-mc( 0/ 4): - claim success count: 33460614
pnml2lts-mc( 0/ 4): - cum. max stack depth: 59503
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33460614 states 268642849 transitions, fanout: 8.029
pnml2lts-mc( 0/ 4): Total exploration time 269.410 sec (269.390 sec minimum, 269.402 sec on average)
pnml2lts-mc( 0/ 4): States per second: 124200, Transitions per second: 997152
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.3MB, 8.1 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 492 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.3MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-20-LTLFireability-05
ltl formula formula --ltl=/tmp/13848/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 551 places, 480 transitions and 1513 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/13848/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/13848/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/13848/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/13848/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 553 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 552, there are 524 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~140 levels ~10000 states ~17200 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~20000 states ~34368 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~40000 states ~70944 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~80000 states ~152576 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~160000 states ~326872 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~320000 states ~665692 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~640000 states ~1414744 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~1280000 states ~2992300 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~2560000 states ~6211684 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~5120000 states ~12897392 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~10240000 states ~26758612 transitions
pnml2lts-mc( 0/ 4): ~140 levels ~20480000 states ~55681620 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33056316
pnml2lts-mc( 0/ 4): unique states count: 33552397
pnml2lts-mc( 0/ 4): unique transitions count: 94389275
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 60636646
pnml2lts-mc( 0/ 4): - claim found count: 198205
pnml2lts-mc( 0/ 4): - claim success count: 33552428
pnml2lts-mc( 0/ 4): - cum. max stack depth: 678
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552428 states 94389365 transitions, fanout: 2.813
pnml2lts-mc( 0/ 4): Total exploration time 241.250 sec (241.210 sec minimum, 241.228 sec on average)
pnml2lts-mc( 0/ 4): States per second: 139077, Transitions per second: 391251
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 261.8MB, 8.2 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 492 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 261.8MB (~256.0MB paged-in)