Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-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 itstools
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 r048-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 1716338102448

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 00:35:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:35:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:35:03] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-22 00:35:03] [INFO ] Transformed 782 places.
[2024-05-22 00:35:03] [INFO ] Transformed 697 transitions.
[2024-05-22 00:35:03] [INFO ] Found NUPN structural information;
[2024-05-22 00:35:03] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 63 places in 14 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 120 ms. Remains 551 /719 variables (removed 168) and now considering 484/638 (removed 154) transitions.
// Phase 1: matrix 484 rows 551 cols
[2024-05-22 00:35:04] [INFO ] Computed 107 invariants in 26 ms
[2024-05-22 00:35:04] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-22 00:35:04] [INFO ] Invariant cache hit.
[2024-05-22 00:35:05] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
Running 483 sub problems to find dead transitions.
[2024-05-22 00:35:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (OVERLAPS) 1/551 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 30 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 100 places in 199 ms of which 3 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:35:15] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:35:16] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 5 ms to minimize.
[2024-05-22 00:35:17] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:35:18] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 5 ms to minimize.
[2024-05-22 00:35:19] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:35:20] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:35:20] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:35:20] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:35:20] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:35:20] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 3 ms to minimize.
Problem TDEAD430 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/147 constraints. Problems are: Problem set: 3 solved, 480 unsolved
[2024-05-22 00:35:20] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:35:20] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:35:21] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:35:21] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:35:21] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:35:21] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:35:21] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:35:21] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:35:21] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:35:22] [INFO ] Deduced a trap composed of 99 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:35:22] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 5 ms to minimize.
[2024-05-22 00:35:22] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:35:22] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:35:22] [INFO ] Deduced a trap composed of 105 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:35:23] [INFO ] Deduced a trap composed of 103 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:35:23] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:35:23] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:35:23] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:35:23] [INFO ] Deduced a trap composed of 103 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:35:23] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/167 constraints. Problems are: Problem set: 3 solved, 480 unsolved
[2024-05-22 00:35:27] [INFO ] Deduced a trap composed of 91 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:35:28] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:35:28] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:35:28] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 4 ms to minimize.
[2024-05-22 00:35:28] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:35:28] [INFO ] Deduced a trap composed of 112 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:35:28] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:35:29] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:35:29] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:35:29] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:35:29] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:35:29] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:35:29] [INFO ] Deduced a trap composed of 110 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:35:30] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:35:30] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:35:30] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:35:30] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:35:30] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:35:30] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:35:30] [INFO ] Deduced a trap composed of 101 places in 137 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-05-22 00:35:31] [INFO ] Deduced a trap composed of 99 places in 171 ms of which 4 ms to minimize.
[2024-05-22 00:35:31] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:35:31] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:35:32] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:35:32] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:35:32] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:35:32] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:35:32] [INFO ] Deduced a trap composed of 101 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:35:32] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:35:32] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:35:33] [INFO ] Deduced a trap composed of 99 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:35:33] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:35:33] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:35:33] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:35:33] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:35:33] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:35:34] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:35:34] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:35:34] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:35:34] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 20/207 constraints. Problems are: Problem set: 4 solved, 479 unsolved
[2024-05-22 00:35:35] [INFO ] Deduced a trap composed of 110 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:35:35] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 3 ms to minimize.
SMT process timed out in 30204ms, After SMT, problems are : Problem set: 4 solved, 479 unsolved
Search for dead transitions found 4 dead transitions in 30223ms
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 32 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 31166 ms. Remains : 551/719 places, 480/638 transitions.
Support contains 40 out of 551 places after structural reductions.
[2024-05-22 00:35:35] [INFO ] Flatten gal took : 90 ms
[2024-05-22 00:35:35] [INFO ] Flatten gal took : 56 ms
[2024-05-22 00:35:35] [INFO ] Input system was already deterministic with 480 transitions.
RANDOM walk for 40000 steps (200 resets) in 2066 ms. (19 steps per ms) remains 17/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
// Phase 1: matrix 480 rows 551 cols
[2024-05-22 00:35:36] [INFO ] Computed 107 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 197/222 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 201/423 variables, 51/65 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 119/542 variables, 40/105 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2/544 variables, 2/107 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 475/1019 variables, 544/651 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1019 variables, 0/651 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 11/1030 variables, 6/657 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1030 variables, 0/657 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 1/1031 variables, 1/658 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1031 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/1031 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1031/1031 variables, and 658 constraints, problems are : Problem set: 1 solved, 16 unsolved in 1190 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 187/206 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-22 00:35:37] [INFO ] Deduced a trap composed of 87 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 216/422 variables, 54/66 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:35:38] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 105 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 3 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 5 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 4 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:35:39] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 20/86 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 97 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:35:40] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 105 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:35:41] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 20/106 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 100 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 115 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:35:42] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 6326ms, After SMT, problems are : Problem set: 1 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 480/480 transitions.
Graph (trivial) has 248 edges and 551 vertex of which 6 / 551 are part of one of the 1 SCC in 11 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.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 544 transition count 405
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 478 transition count 403
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 138 place count 476 transition count 403
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 138 place count 476 transition count 296
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 370 place count 351 transition count 296
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 377 place count 344 transition count 289
Iterating global reduction 3 with 7 rules applied. Total rules applied 384 place count 344 transition count 289
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 646 place count 212 transition count 159
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 650 place count 210 transition count 166
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 652 place count 210 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 654 place count 208 transition count 164
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 659 place count 208 transition count 164
Applied a total of 659 rules in 147 ms. Remains 208 /551 variables (removed 343) and now considering 164/480 (removed 316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 208/551 places, 164/480 transitions.
RANDOM walk for 40000 steps (1517 resets) in 1301 ms. (30 steps per ms) remains 4/16 properties
BEST_FIRST walk for 40004 steps (391 resets) in 207 ms. (192 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (543 resets) in 237 ms. (168 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (518 resets) in 220 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (513 resets) in 223 ms. (178 steps per ms) remains 2/3 properties
[2024-05-22 00:35:43] [INFO ] Flow matrix only has 163 transitions (discarded 1 similar events)
// Phase 1: matrix 163 rows 208 cols
[2024-05-22 00:35:43] [INFO ] Computed 87 invariants in 4 ms
[2024-05-22 00:35:43] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 106/162 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/204 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/206 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 163/369 variables, 206/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 14/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/371 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/371 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 208/208 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 106/162 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:35:44] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:35:44] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:35:44] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 42/204 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:35:44] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:35:44] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:35:44] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
Problem AtomicPropp13 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 3/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/206 variables, 2/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 163/369 variables, 206/299 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 14/313 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 1/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/371 variables, 2/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/371 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/371 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 316 constraints, problems are : Problem set: 1 solved, 1 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 208/208 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 639ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 164/164 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 208 transition count 161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 205 transition count 161
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 205 transition count 155
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 195 transition count 155
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 48 place count 181 transition count 143
Applied a total of 48 rules in 15 ms. Remains 181 /208 variables (removed 27) and now considering 143/164 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 181/208 places, 143/164 transitions.
RANDOM walk for 35208 steps (1865 resets) in 640 ms. (54 steps per ms) remains 0/1 properties
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.21 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 27 ms. Remains 538 /551 variables (removed 13) and now considering 467/480 (removed 13) transitions.
// Phase 1: matrix 467 rows 538 cols
[2024-05-22 00:35:44] [INFO ] Computed 107 invariants in 16 ms
[2024-05-22 00:35:45] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-22 00:35:45] [INFO ] Invariant cache hit.
[2024-05-22 00:35:45] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-22 00:35:45] [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-05-22 00:35:56] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:35:56] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:35:57] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 5 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:35:58] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:35:59] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:00] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:36:01] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 3 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-05-22 00:36:02] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 4 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:36:02] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:03] [INFO ] Deduced a trap composed of 72 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 5 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:04] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:36:05] [INFO ] Deduced a trap composed of 93 places in 139 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-05-22 00:36:08] [INFO ] Deduced a trap composed of 73 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:36:09] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:36:09] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:36:09] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:36:09] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:09] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:36:09] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:36:09] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:09] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:36:11] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 3 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-05-22 00:36:12] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 2 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 4 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-05-22 00:36:15] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 30111ms, After SMT, problems are : Problem set: 22 solved, 444 unsolved
Search for dead transitions found 22 dead transitions in 30116ms
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 : 538/551 places, 445/480 transitions.
Applied a total of 0 rules in 10 ms. Remains 538 /538 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30989 ms. Remains : 538/551 places, 445/480 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-00
Stuttering criterion allowed to conclude after 180 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-00 finished in 31352 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 31 ms. Remains 538 /551 variables (removed 13) and now considering 467/480 (removed 13) transitions.
[2024-05-22 00:36:16] [INFO ] Invariant cache hit.
[2024-05-22 00:36:16] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 00:36:16] [INFO ] Invariant cache hit.
[2024-05-22 00:36:17] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-22 00:36:17] [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-05-22 00:36:26] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:36:26] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 4 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 87 places in 131 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-05-22 00:36:32] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:36:33] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:36:33] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:36:33] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:36:33] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:36:33] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 70 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:36:34] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:36:35] [INFO ] Deduced a trap composed of 93 places in 118 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-05-22 00:36:38] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:36:39] [INFO ] Deduced a trap composed of 90 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:36:40] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:36:41] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:36:41] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:36:41] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:36:41] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:36:41] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 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-05-22 00:36:42] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:36:42] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:36:43] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:36:44] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 71 places in 150 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-05-22 00:36:45] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:36:46] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:36:47] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:36:47] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:36:47] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 22 solved, 444 unsolved
Search for dead transitions found 22 dead transitions in 30208ms
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 : 538/551 places, 445/480 transitions.
Applied a total of 0 rules in 10 ms. Remains 538 /538 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31136 ms. Remains : 538/551 places, 445/480 transitions.
Stuttering acceptance computed with spot in 353 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 291 ms.
Product exploration explored 100000 steps with 33333 reset in 236 ms.
Computed a total of 470 stabilizing places and 387 stable transitions
Graph (complete) has 1157 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Computed a total of 470 stabilizing places and 387 stable transitions
Detected a total of 470/538 stabilizing places and 387/445 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 29 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 32121 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 31 ms. Remains 540 /551 variables (removed 11) and now considering 469/480 (removed 11) transitions.
// Phase 1: matrix 469 rows 540 cols
[2024-05-22 00:36:48] [INFO ] Computed 107 invariants in 17 ms
[2024-05-22 00:36:48] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-22 00:36:48] [INFO ] Invariant cache hit.
[2024-05-22 00:36:49] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2024-05-22 00:36:49] [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-05-22 00:36:59] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:36:59] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:37:00] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 4 ms to minimize.
[2024-05-22 00:37:01] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 74 places in 124 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-05-22 00:37:02] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:37:02] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:37:03] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:37:04] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:37:04] [INFO ] Deduced a trap composed of 101 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:37:04] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:37:04] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:37:04] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 3 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-05-22 00:37:05] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:37:05] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:37:06] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:37:07] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:37:08] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:37:08] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:37:08] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:37:08] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:37:08] [INFO ] Deduced a trap composed of 85 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:37:08] [INFO ] Deduced a trap composed of 109 places in 103 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-05-22 00:37:12] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:37:12] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:37:12] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:37:12] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:37:12] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:37:13] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:37:13] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:37:13] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:37:13] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:37:13] [INFO ] Deduced a trap composed of 96 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:37:13] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:37:14] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:37:14] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:37:14] [INFO ] Deduced a trap composed of 91 places in 171 ms of which 4 ms to minimize.
[2024-05-22 00:37:14] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:37:14] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:37:14] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:37:15] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:37:15] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:37:15] [INFO ] Deduced a trap composed of 93 places in 171 ms of which 3 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-05-22 00:37:15] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:37:16] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:37:16] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:37:16] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:37:16] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:37:16] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:37:16] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:37:16] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:37:17] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 5 ms to minimize.
[2024-05-22 00:37:17] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:37:17] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:37:17] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:37:17] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:37:18] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:37:18] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:37:18] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:37:18] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:37:18] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:37:19] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:37:19] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/207 constraints. Problems are: Problem set: 9 solved, 459 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1009 variables, and 207 constraints, problems are : Problem set: 9 solved, 459 unsolved in 30038 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: 100/100 constraints]
Escalating to Integer solving :Problem set: 9 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 41/41 constraints. Problems are: Problem set: 9 solved, 459 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/41 constraints. Problems are: Problem set: 9 solved, 459 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 65/106 constraints. Problems are: Problem set: 9 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 1/107 constraints. Problems are: Problem set: 9 solved, 459 unsolved
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 100/207 constraints. Problems are: Problem set: 11 solved, 457 unsolved
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:37:23] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 100 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:37:24] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:37:25] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:37:25] [INFO ] Deduced a trap composed of 99 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:37:25] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:37:25] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:37:25] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:37:25] [INFO ] Deduced a trap composed of 94 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:37:26] [INFO ] Deduced a trap composed of 90 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:37:26] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:37:26] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/227 constraints. Problems are: Problem set: 14 solved, 454 unsolved
[2024-05-22 00:37:26] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:37:27] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:37:27] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:37:27] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:37:27] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:37:27] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:37:28] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:37:28] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:37:28] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:37:28] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:37:28] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:37:29] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:37:29] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:37:29] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:37:29] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:37:29] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:37:30] [INFO ] Deduced a trap composed of 102 places in 168 ms of which 3 ms to minimize.
Problem TDEAD411 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/247 constraints. Problems are: Problem set: 15 solved, 453 unsolved
[2024-05-22 00:37:31] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:37:31] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:37:31] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:37:31] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:37:31] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:37:31] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:37:32] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:37:32] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:37:32] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:37:32] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:37:33] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:37:33] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:37:33] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:33] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:33] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:37:33] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:37:34] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 4 ms to minimize.
[2024-05-22 00:37:34] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:37:34] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:37:34] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
Problem TDEAD425 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/267 constraints. Problems are: Problem set: 20 solved, 448 unsolved
[2024-05-22 00:37:35] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:37:35] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 6 ms to minimize.
[2024-05-22 00:37:35] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:37:35] [INFO ] Deduced a trap composed of 123 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:37:36] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:37:36] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:37:36] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:36] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:37:36] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:37:36] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:37:36] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:37:37] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:37:37] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:37:37] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:37:37] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:37:37] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:37:38] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:37:38] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:37:38] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:37:38] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
Problem TDEAD439 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/287 constraints. Problems are: Problem set: 21 solved, 447 unsolved
[2024-05-22 00:37:39] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:37:39] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 5 ms to minimize.
[2024-05-22 00:37:39] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:37:40] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:37:40] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:37:40] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:37:40] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:37:40] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:37:40] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:37:41] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:41] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:37:41] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:37:41] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 4 ms to minimize.
[2024-05-22 00:37:41] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:37:41] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:37:41] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:37:42] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:37:42] [INFO ] Deduced a trap composed of 94 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:37:42] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:37:42] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 3 ms to minimize.
Problem TDEAD414 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 20/307 constraints. Problems are: Problem set: 26 solved, 442 unsolved
[2024-05-22 00:37:43] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:37:43] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:37:43] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:37:43] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:37:43] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:37:44] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:37:44] [INFO ] Deduced a trap composed of 88 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:37:44] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:44] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:37:44] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:45] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:45] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:37:45] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:37:45] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:37:45] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:37:45] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:37:45] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:37:46] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:37:46] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:37:46] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 20/327 constraints. Problems are: Problem set: 26 solved, 442 unsolved
[2024-05-22 00:37:47] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:37:47] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:37:47] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:37:47] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:37:47] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 3 ms to minimize.
SMT process timed out in 60263ms, After SMT, problems are : Problem set: 26 solved, 442 unsolved
Search for dead transitions found 26 dead transitions in 60272ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 540/551 places, 443/480 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 538 transition count 443
Applied a total of 2 rules in 9 ms. Remains 538 /540 variables (removed 2) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 538 cols
[2024-05-22 00:37:49] [INFO ] Computed 112 invariants in 4 ms
[2024-05-22 00:37:49] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 00:37:49] [INFO ] Invariant cache hit.
[2024-05-22 00:37:50] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 538/551 places, 443/480 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61750 ms. Remains : 538/551 places, 443/480 transitions.
Stuttering acceptance computed with spot in 134 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 61905 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 26 ms. Remains 538 /551 variables (removed 13) and now considering 467/480 (removed 13) transitions.
// Phase 1: matrix 467 rows 538 cols
[2024-05-22 00:37:50] [INFO ] Computed 107 invariants in 4 ms
[2024-05-22 00:37:50] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 00:37:50] [INFO ] Invariant cache hit.
[2024-05-22 00:37:51] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-05-22 00:37:51] [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-05-22 00:38:00] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 88 places in 84 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-05-22 00:38:03] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 9 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 4 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 4 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 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-05-22 00:38:06] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 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-05-22 00:38:12] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 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-05-22 00:38:15] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 71 places in 134 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-05-22 00:38:19] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 3 ms to minimize.
SMT process timed out in 30226ms, After SMT, problems are : Problem set: 22 solved, 444 unsolved
Search for dead transitions found 22 dead transitions in 30235ms
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 : 538/551 places, 445/480 transitions.
Applied a total of 0 rules in 10 ms. Remains 538 /538 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30960 ms. Remains : 538/551 places, 445/480 transitions.
Stuttering acceptance computed with spot in 255 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 33384 reset in 201 ms.
Product exploration explored 100000 steps with 33270 reset in 299 ms.
Computed a total of 470 stabilizing places and 387 stable transitions
Graph (complete) has 1157 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.32 ms
Computed a total of 470 stabilizing places and 387 stable transitions
Detected a total of 470/538 stabilizing places and 387/445 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 851 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 245 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 (201 resets) in 289 ms. (137 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (37 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (37 resets) in 247 ms. (161 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 287 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (46 resets) in 225 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (31 resets) in 291 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (30 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (30 resets) in 125 ms. (317 steps per ms) remains 5/8 properties
// Phase 1: matrix 445 rows 538 cols
[2024-05-22 00:38:23] [INFO ] Computed 110 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 392/401 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 5 (OVERLAPS) 130/531 variables, 46/110 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/110 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 440/971 variables, 531/641 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 0/641 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 11/982 variables, 6/647 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/982 variables, 0/647 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/983 variables, 1/648 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/648 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/983 variables, 0/648 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 983/983 variables, and 648 constraints, problems are : Problem set: 2 solved, 3 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 392/400 variables, 63/64 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/84 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 3/87 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/87 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 131/531 variables, 46/133 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 14/147 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/147 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 440/971 variables, 531/678 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/971 variables, 2/680 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
SMT process timed out in 5569ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 445/445 transitions.
Graph (trivial) has 250 edges and 538 vertex of which 6 / 538 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1150 edges and 533 vertex of which 531 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 531 transition count 368
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 463 transition count 368
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 463 transition count 257
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 330 transition count 257
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 671 place count 182 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 675 place count 180 transition count 123
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 677 place count 180 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 679 place count 178 transition count 121
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 680 place count 178 transition count 121
Applied a total of 680 rules in 72 ms. Remains 178 /538 variables (removed 360) and now considering 121/445 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 178/538 places, 121/445 transitions.
RANDOM walk for 40000 steps (1943 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4917 steps (56 resets) in 18 ms. (258 steps per ms) remains 0/2 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 1879 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 187 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))]
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 445/445 transitions.
Applied a total of 0 rules in 28 ms. Remains 538 /538 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-05-22 00:38:31] [INFO ] Invariant cache hit.
[2024-05-22 00:38:32] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-22 00:38:32] [INFO ] Invariant cache hit.
[2024-05-22 00:38:32] [INFO ] Implicit Places using invariants and state equation in 542 ms returned [62, 448]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 771 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 536/538 places, 445/445 transitions.
Applied a total of 0 rules in 27 ms. Remains 536 /536 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 826 ms. Remains : 536/538 places, 445/445 transitions.
Computed a total of 468 stabilizing places and 387 stable transitions
Graph (complete) has 1147 edges and 536 vertex of which 534 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 468 stabilizing places and 387 stable transitions
Detected a total of 468/536 stabilizing places and 387/445 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 325 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 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (199 resets) in 188 ms. (211 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (35 resets) in 64 ms. (615 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (29 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (31 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
// Phase 1: matrix 445 rows 536 cols
[2024-05-22 00:38:33] [INFO ] Computed 108 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 306/399 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:38:33] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:38:33] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:38:33] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 130/529 variables, 44/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:38:33] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:38:33] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 93 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 440/969 variables, 529/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/969 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/980 variables, 6/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/980 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/981 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/981 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/981 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 981/981 variables, and 655 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1823 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 306/399 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 130/529 variables, 44/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:38:36] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:38:36] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:38:36] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:38:36] [INFO ] Deduced a trap composed of 119 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:38:36] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:38:36] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:38:37] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:38:37] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:38:37] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:38:37] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:38:37] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:38:37] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:38:37] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:38:38] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:38:38] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:38:38] [INFO ] Deduced a trap composed of 72 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:38:38] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:38:38] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:38:40] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:38:40] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
SMT process timed out in 6887ms, After SMT, problems are : Problem set: 0 solved, 2 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, 445/445 transitions.
Graph (trivial) has 250 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 1140 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 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 529 transition count 368
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 461 transition count 368
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 461 transition count 257
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 328 transition count 257
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 7 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 285 rules applied. Total rules applied 667 place count 182 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 671 place count 180 transition count 125
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 675 place count 180 transition count 121
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 679 place count 176 transition count 121
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 684 place count 176 transition count 121
Applied a total of 684 rules in 51 ms. Remains 176 /536 variables (removed 360) and now considering 121/445 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 176/536 places, 121/445 transitions.
RANDOM walk for 40000 steps (1901 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 1911 steps (22 resets) in 8 ms. (212 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0 p2), (X p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 818 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 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2356 reset in 317 ms.
Product exploration explored 100000 steps with 2280 reset in 272 ms.
Built C files in :
/tmp/ltsmin3877076929861417713
[2024-05-22 00:38:42] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3877076929861417713
Running compilation step : cd /tmp/ltsmin3877076929861417713;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1055 ms.
Running link step : cd /tmp/ltsmin3877076929861417713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin3877076929861417713;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18246546818735551211.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 445/445 transitions.
Applied a total of 0 rules in 22 ms. Remains 536 /536 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-05-22 00:38:57] [INFO ] Invariant cache hit.
[2024-05-22 00:38:58] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-22 00:38:58] [INFO ] Invariant cache hit.
[2024-05-22 00:38:58] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2024-05-22 00:38:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 64/106 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 00:39:06] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:39:08] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:39:08] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:39:08] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:39:08] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:39:08] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:39:08] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:39:08] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:39:09] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:39:09] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:39:09] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:39:09] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:39:09] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:39:09] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 20/128 constraints. Problems are: Problem set: 3 solved, 441 unsolved
[2024-05-22 00:39:10] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:39:10] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:39:10] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:39:10] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:39:10] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:39:10] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:39:10] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:39:10] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:39:10] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 5 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/148 constraints. Problems are: Problem set: 3 solved, 441 unsolved
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:39:15] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:39:15] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:39:15] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
Problem TDEAD412 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/168 constraints. Problems are: Problem set: 4 solved, 440 unsolved
[2024-05-22 00:39:18] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:39:18] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:39:18] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:39:19] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 115 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:39:20] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
Problem TDEAD427 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/188 constraints. Problems are: Problem set: 5 solved, 439 unsolved
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 86 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:39:21] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 5 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:39:22] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 65 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 63 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 62 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:39:23] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 20/208 constraints. Problems are: Problem set: 7 solved, 437 unsolved
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 4 ms to minimize.
[2024-05-22 00:39:24] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:39:25] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 20/228 constraints. Problems are: Problem set: 7 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/981 variables, and 228 constraints, problems are : Problem set: 7 solved, 437 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/536 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 7 solved, 437 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 42/42 constraints. Problems are: Problem set: 7 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/42 constraints. Problems are: Problem set: 7 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 64/106 constraints. Problems are: Problem set: 7 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 2/108 constraints. Problems are: Problem set: 7 solved, 437 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 120/228 constraints. Problems are: Problem set: 7 solved, 437 unsolved
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/248 constraints. Problems are: Problem set: 7 solved, 437 unsolved
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 124 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 4 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:39:37] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/268 constraints. Problems are: Problem set: 7 solved, 437 unsolved
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:39:38] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:39:39] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 111 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/288 constraints. Problems are: Problem set: 7 solved, 437 unsolved
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 91 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 20/308 constraints. Problems are: Problem set: 7 solved, 437 unsolved
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:47] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:39:47] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:39:47] [INFO ] Deduced a trap composed of 80 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:39:47] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 20/328 constraints. Problems are: Problem set: 7 solved, 437 unsolved
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:39:48] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:39:49] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:39:49] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:39:49] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:39:49] [INFO ] Deduced a trap composed of 86 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:39:49] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:39:50] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:39:50] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:39:50] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:39:50] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:39:50] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:39:50] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:39:50] [INFO ] Deduced a trap composed of 100 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:39:51] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:39:51] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:39:51] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 20/348 constraints. Problems are: Problem set: 7 solved, 437 unsolved
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:39:52] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:39:53] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:39:54] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 20/368 constraints. Problems are: Problem set: 7 solved, 437 unsolved
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:39:55] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:39:56] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:39:57] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:39:57] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:39:57] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:39:57] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:39:57] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:39:57] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:39:58] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:39:58] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 20/388 constraints. Problems are: Problem set: 7 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/981 variables, and 388 constraints, problems are : Problem set: 7 solved, 437 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/536 constraints, PredecessorRefiner: 0/444 constraints, Known Traps: 280/280 constraints]
After SMT, in 60101ms problems are : Problem set: 7 solved, 437 unsolved
Search for dead transitions found 7 dead transitions in 60105ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 536/536 places, 438/445 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 535 transition count 438
Applied a total of 1 rules in 18 ms. Remains 535 /536 variables (removed 1) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 535 cols
[2024-05-22 00:39:58] [INFO ] Computed 110 invariants in 6 ms
[2024-05-22 00:39:58] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 00:39:58] [INFO ] Invariant cache hit.
[2024-05-22 00:39:59] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 535/536 places, 438/445 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61522 ms. Remains : 535/536 places, 438/445 transitions.
Built C files in :
/tmp/ltsmin2334723794960179199
[2024-05-22 00:39:59] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2334723794960179199
Running compilation step : cd /tmp/ltsmin2334723794960179199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1014 ms.
Running link step : cd /tmp/ltsmin2334723794960179199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2334723794960179199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4715620120195766325.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:40:14] [INFO ] Flatten gal took : 38 ms
[2024-05-22 00:40:14] [INFO ] Flatten gal took : 31 ms
[2024-05-22 00:40:14] [INFO ] Time to serialize gal into /tmp/LTL9024783253332970882.gal : 8 ms
[2024-05-22 00:40:14] [INFO ] Time to serialize properties into /tmp/LTL17733460395020033117.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9024783253332970882.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16055623380636738812.hoa' '-atoms' '/tmp/LTL17733460395020033117.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((X("((p564==0)||(p766==0))"))||(F(("(p564!=1)")&&(X(("(p564!=1)")U(("(p75!=1)")||(G("(p564!=1)"))))))))))
Formula 0 simplified : F(X!"((p564==0)||(p766==0))" & G(!"(p564!=1)" | X(!"(p564!=1)" M !"(p75!=1)")))
Detected timeout of ITS tools.
[2024-05-22 00:40:44] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:40:44] [INFO ] Applying decomposition
[2024-05-22 00:40:44] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4955894430274766395.txt' '-o' '/tmp/graph4955894430274766395.bin' '-w' '/tmp/graph4955894430274766395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4955894430274766395.bin' '-l' '-1' '-v' '-w' '/tmp/graph4955894430274766395.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:40:44] [INFO ] Decomposing Gal with order
[2024-05-22 00:40:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:40:45] [INFO ] Removed a total of 171 redundant transitions.
[2024-05-22 00:40:45] [INFO ] Flatten gal took : 93 ms
[2024-05-22 00:40:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 21 ms.
[2024-05-22 00:40:45] [INFO ] Time to serialize gal into /tmp/LTL16627197855133850423.gal : 14 ms
[2024-05-22 00:40:45] [INFO ] Time to serialize properties into /tmp/LTL2459050566479489830.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16627197855133850423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2459050566479489830.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X("((i12.i3.u149.p564==0)||(i20.u188.p766==0))"))||(F(("(i12.i3.u149.p564!=1)")&&(X(("(i12.i3.u149.p564!=1)")U(("(i6.i2.u24.p75!...198
Formula 0 simplified : F(X!"((i12.i3.u149.p564==0)||(i20.u188.p766==0))" & G(!"(i12.i3.u149.p564!=1)" | X(!"(i12.i3.u149.p564!=1)" M !"(i6.i2.u24.p75!=1)")...157
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-20-LTLFireability-03 finished in 189960 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 53 ms. Remains 539 /551 variables (removed 12) and now considering 468/480 (removed 12) transitions.
// Phase 1: matrix 468 rows 539 cols
[2024-05-22 00:41:00] [INFO ] Computed 107 invariants in 6 ms
[2024-05-22 00:41:00] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-22 00:41:00] [INFO ] Invariant cache hit.
[2024-05-22 00:41:01] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-05-22 00:41:01] [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-05-22 00:41:10] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:41:10] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:41:11] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:41:12] [INFO ] Deduced a trap composed of 83 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:41:13] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 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-05-22 00:41:13] [INFO ] Deduced a trap composed of 88 places in 161 ms of which 4 ms to minimize.
[2024-05-22 00:41:13] [INFO ] Deduced a trap composed of 86 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:41:13] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:41:13] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:41:14] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:41:14] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:41:14] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:41:14] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:41:14] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:41:14] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:41:15] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:41:15] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:41:15] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:41:15] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:41:15] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:41:15] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:41:15] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 89 places in 135 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-05-22 00:41:16] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:41:16] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:41:17] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:41:18] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:41:19] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 4 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-05-22 00:41:22] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:41:23] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:41:24] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:41:24] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:41:24] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:41:24] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:41:24] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:41:24] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:41:24] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:41:25] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:41:25] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:41:25] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:41:25] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:41:25] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 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-05-22 00:41:26] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:41:26] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:41:27] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:41:27] [INFO ] Deduced a trap composed of 93 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:41:27] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:41:27] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:41:27] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:41:28] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 89 places in 127 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-05-22 00:41:29] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:41:29] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:41:30] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:41:31] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:41:31] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:41:31] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:41:31] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
SMT process timed out in 30189ms, After SMT, problems are : Problem set: 25 solved, 442 unsolved
Search for dead transitions found 25 dead transitions in 30195ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 443/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 443
Applied a total of 1 rules in 12 ms. Remains 538 /539 variables (removed 1) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 538 cols
[2024-05-22 00:41:31] [INFO ] Computed 111 invariants in 6 ms
[2024-05-22 00:41:31] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-22 00:41:31] [INFO ] Invariant cache hit.
[2024-05-22 00:41:32] [INFO ] Implicit Places using invariants and state equation in 495 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 702 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 537/551 places, 443/480 transitions.
Applied a total of 0 rules in 9 ms. Remains 537 /537 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31827 ms. Remains : 537/551 places, 443/480 transitions.
Stuttering acceptance computed with spot in 130 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 520 reset in 248 ms.
Product exploration explored 100000 steps with 525 reset in 238 ms.
Computed a total of 469 stabilizing places and 385 stable transitions
Graph (complete) has 1142 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 469 stabilizing places and 385 stable transitions
Detected a total of 469/537 stabilizing places and 385/443 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 453 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 154 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 (194 resets) in 313 ms. (127 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (36 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (36 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (35 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
// Phase 1: matrix 443 rows 537 cols
[2024-05-22 00:41:33] [INFO ] Computed 110 invariants in 5 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) 291/404 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 126/530 variables, 45/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 438/968 variables, 530/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/968 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 11/979 variables, 6/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/980 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/980 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 647 constraints, problems are : Problem set: 0 solved, 3 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 537/537 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) 291/404 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:41:34] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:41:35] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:41:36] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 3 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:41:37] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:41:38] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:41:39] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s62 0)
(s63 0)
(s92 0)
(s93 0)
(s94 0)
(s97 0)
(s98 0)
(s99 0)
(s103 0)
(s104 0)
(s105 0)
(s109 0)
(s110 0)
(s111 0)
(s115 0)
(s116 0)
(s117 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s137 0)
(s138 0)
(s139 0)
(s143 0)
(s144 0)
(s148 0)
(s149 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s157 1)
(s159 0)
(s162 0)
(s163 0)
(s165 0)
(s166 0)
(s167 0)
(s171 1)
(s172 0)
(s173 0)
(s177 1)
(s178 0)
(s179 0)
(s183 0)
(s184 0)
(s185 0)
(s188 1)
(s189 0)
(s190 0)
(s194 0)
(s195 0)
(s196 1)
(s200 1)
(s201 0)
(s202 0)
(s206 1)
(s207 0)
(s208 0)
(s212 0)
(s213 0)
(s214 1)
(s218 1)
(s219 0)
(s220 0)
(s224 1)
(s227 0)
(s228 0)
(s230 0)
(s231 1)
(s232 0)
(s236 1)
(s237 0)
(s238 0)
(s242 1)
(s243 0)
(s244 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 1)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 1)
(s372 0)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 1)
(s386 1)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 1)
(s430 1)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 1)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/980 variables, and 108 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 0/45 constraints, State Equation: 0/537 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 43/43 constraints]
After SMT, in 5392ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 537/537 places, 443/443 transitions.
Graph (trivial) has 249 edges and 537 vertex of which 6 / 537 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1135 edges and 532 vertex of which 530 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 530 transition count 369
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 465 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 464 transition count 368
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 464 transition count 257
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 376 place count 333 transition count 257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 377 place count 332 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 332 transition count 256
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 9 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 293 rules applied. Total rules applied 671 place count 181 transition count 114
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 675 place count 179 transition count 121
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 677 place count 179 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 679 place count 177 transition count 119
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 680 place count 177 transition count 119
Applied a total of 680 rules in 92 ms. Remains 177 /537 variables (removed 360) and now considering 119/443 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 177/537 places, 119/443 transitions.
RANDOM walk for 15032 steps (746 resets) in 91 ms. (163 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 1196 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 158 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 176 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 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 443/443 transitions.
Applied a total of 0 rules in 15 ms. Remains 537 /537 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2024-05-22 00:41:40] [INFO ] Invariant cache hit.
[2024-05-22 00:41:41] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-22 00:41:41] [INFO ] Invariant cache hit.
[2024-05-22 00:41:41] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2024-05-22 00:41:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 1/537 variables, 65/109 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:41:50] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:41:50] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:41:50] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:41:50] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:41:51] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 102 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:41:52] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:41:53] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:41:54] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:41:54] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:41:54] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:41:54] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:41:54] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:41:54] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:41:54] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:41:54] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:41:54] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:41:55] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:41:55] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:41:55] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:41:55] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:41:55] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:41:55] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:41:55] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:41:55] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:41:55] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:41:55] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:42:00] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:42:00] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:42:00] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:42:00] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:42:00] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:42:00] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:42:00] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:42:00] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:42:01] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:42:01] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:42:01] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:42:01] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:42:01] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:42:01] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:42:01] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:42:01] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:42:02] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:42:02] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:42:02] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:42:02] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:42:02] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:42:02] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:42:02] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:42:02] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:42:03] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:42:03] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 3 ms to minimize.
[2024-05-22 00:42:03] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:42:03] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:42:03] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:42:03] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:42:03] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:42:03] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:42:03] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:42:04] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:42:04] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:42:04] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:42:04] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:42:04] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:42:04] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:42:04] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:42:05] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:42:05] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:42:05] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:42:05] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:42:05] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:42:05] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:42:05] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:42:05] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:42:06] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:42:06] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:42:06] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:42:06] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:42:06] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:42:06] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:42:06] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:42:06] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:42:06] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:42:07] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:42:07] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:42:07] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:42:11] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:42:11] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:42:11] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:42:11] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
SMT process timed out in 30126ms, After SMT, problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Finished structural reductions in LTL mode , in 1 iterations and 30935 ms. Remains : 537/537 places, 443/443 transitions.
Computed a total of 469 stabilizing places and 385 stable transitions
Graph (complete) has 1142 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 469 stabilizing places and 385 stable transitions
Detected a total of 469/537 stabilizing places and 385/443 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 406 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 158 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
RANDOM walk for 40000 steps (196 resets) in 419 ms. (95 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (37 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
[2024-05-22 00:42:12] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 291/404 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/530 variables, 45/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 438/968 variables, 530/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/968 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/979 variables, 6/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/980 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/980 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 647 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 291/404 variables, 61/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:42:13] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:42:13] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:42:13] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:42:13] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:42:13] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:42:13] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:42:13] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:42:13] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:42:13] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:42:13] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:42:14] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 3 ms to minimize.
[2024-05-22 00:42:14] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:42:14] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:42:14] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:42:14] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 3 ms to minimize.
[2024-05-22 00:42:14] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:42:14] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:42:14] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:42:14] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:42:14] [INFO ] Deduced a trap composed of 95 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 3 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:42:15] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:42:16] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 18/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 126/530 variables, 45/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:42:17] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5381ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 537/537 places, 443/443 transitions.
Graph (trivial) has 249 edges and 537 vertex of which 6 / 537 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1135 edges and 532 vertex of which 530 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 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 530 transition count 369
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 465 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 464 transition count 368
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 464 transition count 257
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 333 transition count 257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 377 place count 332 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 332 transition count 256
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 9 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 293 rules applied. Total rules applied 671 place count 181 transition count 114
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 675 place count 179 transition count 121
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 677 place count 179 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 679 place count 177 transition count 119
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 680 place count 177 transition count 119
Applied a total of 680 rules in 34 ms. Remains 177 /537 variables (removed 360) and now considering 119/443 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 177/537 places, 119/443 transitions.
RANDOM walk for 25634 steps (1375 resets) in 116 ms. (219 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2 p3), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X p1), (X (X p3)), (F (OR (G 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 1019 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 140 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 165 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 137 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 525 reset in 221 ms.
Product exploration explored 100000 steps with 528 reset in 246 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p3)]
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 443/443 transitions.
Graph (trivial) has 248 edges and 537 vertex of which 6 / 537 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1136 edges and 532 vertex of which 530 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 530 transition count 435
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 530 transition count 493
Deduced a syphon composed of 145 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 147 place count 530 transition count 493
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 173 place count 504 transition count 450
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 199 place count 504 transition count 450
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 504 transition count 450
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 417 place count 459 transition count 405
Deduced a syphon composed of 247 places in 4 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 462 place count 459 transition count 405
Deduced a syphon composed of 247 places in 1 ms
Applied a total of 462 rules in 194 ms. Remains 459 /537 variables (removed 78) and now considering 405/443 (removed 38) transitions.
[2024-05-22 00:42:20] [INFO ] Redundant transitions in 28 ms returned []
Running 404 sub problems to find dead transitions.
// Phase 1: matrix 405 rows 459 cols
[2024-05-22 00:42:20] [INFO ] Computed 110 invariants in 11 ms
[2024-05-22 00:42:20] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 65/109 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 43 places in 92 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-05-22 00:42:29] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-22 00:42:29] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 3 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 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
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 4 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 3 places in 21 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 TDEAD72 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 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 TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 20/130 constraints. Problems are: Problem set: 164 solved, 240 unsolved
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:42:30] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 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 TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/150 constraints. Problems are: Problem set: 226 solved, 178 unsolved
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-22 00:42:31] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-22 00:42:32] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-22 00:42:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem 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 TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD335 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/170 constraints. Problems are: Problem set: 258 solved, 146 unsolved
[2024-05-22 00:42:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:42:33] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:42:34] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:42:34] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:42:34] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:42:34] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:42:34] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:42:34] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:42:34] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/190 constraints. Problems are: Problem set: 275 solved, 129 unsolved
[2024-05-22 00:42:35] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:42:35] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:42:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD148 is UNSAT
[2024-05-22 00:42:35] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:42:35] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:42:35] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:42:35] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-22 00:42:36] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:42:36] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:42:36] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:42:36] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:42:36] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:42:36] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:42:36] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:42:36] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:42:36] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:42:37] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:42:37] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:42:37] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:42:37] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 20/210 constraints. Problems are: Problem set: 278 solved, 126 unsolved
[2024-05-22 00:42:37] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:42:37] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:42:37] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:42:38] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:42:38] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
Problem TDEAD160 is UNSAT
[2024-05-22 00:42:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
[2024-05-22 00:42:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD213 is UNSAT
[2024-05-22 00:42:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-05-22 00:42:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
[2024-05-22 00:42:38] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:42:38] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:42:39] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:42:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD295 is UNSAT
[2024-05-22 00:42:39] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:42:39] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:42:39] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:42:39] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:42:39] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:42:39] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:42:40] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD295 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 20/230 constraints. Problems are: Problem set: 284 solved, 120 unsolved
[2024-05-22 00:42:41] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:42:41] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:42:42] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:42:42] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:42:42] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:42:42] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:42:42] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:42:42] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:42:43] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 9/239 constraints. Problems are: Problem set: 284 solved, 120 unsolved
[2024-05-22 00:42:43] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:42:44] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 2/241 constraints. Problems are: Problem set: 284 solved, 120 unsolved
[2024-05-22 00:42:45] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 1/242 constraints. Problems are: Problem set: 284 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 0/242 constraints. Problems are: Problem set: 284 solved, 120 unsolved
Problem TDEAD101 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 14 (OVERLAPS) 404/863 variables, 459/701 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/863 variables, 11/712 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/863 variables, 0/712 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 17 (OVERLAPS) 1/864 variables, 1/713 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/864 variables, 0/713 constraints. Problems are: Problem set: 295 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/864 variables, and 713 constraints, problems are : Problem set: 295 solved, 109 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 459/459 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 132/132 constraints]
Escalating to Integer solving :Problem set: 295 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 197/408 variables, 65/65 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 2/67 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 132/199 constraints. Problems are: Problem set: 295 solved, 109 unsolved
[2024-05-22 00:42:51] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:42:51] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:42:51] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:42:51] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:42:51] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:42:52] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:42:52] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:42:52] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:42:52] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:42:52] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:42:52] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:42:52] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:42:53] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:42:53] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:42:53] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:42:53] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:42:53] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 17/216 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/216 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 49/457 variables, 43/259 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/259 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 404/861 variables, 457/716 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/861 variables, 11/727 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/861 variables, 109/836 constraints. Problems are: Problem set: 295 solved, 109 unsolved
[2024-05-22 00:43:01] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/861 variables, 1/837 constraints. Problems are: Problem set: 295 solved, 109 unsolved
[2024-05-22 00:43:07] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:43:07] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:43:07] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:43:09] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/861 variables, 5/842 constraints. Problems are: Problem set: 295 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/842 constraints. Problems are: Problem set: 295 solved, 109 unsolved
SMT process timed out in 60386ms, After SMT, problems are : Problem set: 295 solved, 109 unsolved
Search for dead transitions found 295 dead transitions in 60394ms
Found 295 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 295 transitions
Dead transitions reduction (with SMT) removed 295 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 459/537 places, 110/443 transitions.
Graph (complete) has 809 edges and 459 vertex of which 212 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 34 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 178 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 32 ms. Remains 178 /459 variables (removed 281) and now considering 127/110 (removed -17) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 178/537 places, 127/443 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60684 ms. Remains : 178/537 places, 127/443 transitions.
Built C files in :
/tmp/ltsmin16833351366414655247
[2024-05-22 00:43:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16833351366414655247
Running compilation step : cd /tmp/ltsmin16833351366414655247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1076 ms.
Running link step : cd /tmp/ltsmin16833351366414655247;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin16833351366414655247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9914830259900671709.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 443/443 transitions.
Applied a total of 0 rules in 16 ms. Remains 537 /537 variables (removed 0) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 537 cols
[2024-05-22 00:43:36] [INFO ] Computed 110 invariants in 3 ms
[2024-05-22 00:43:36] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 00:43:36] [INFO ] Invariant cache hit.
[2024-05-22 00:43:36] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2024-05-22 00:43:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 1/537 variables, 65/109 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:43:45] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:43:46] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:43:47] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:43:48] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:43:48] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:43:48] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:43:48] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:43:48] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:43:48] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:43:48] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:43:48] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:43:49] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:43:50] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:43:51] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:43:52] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:43:52] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:43:52] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:43:55] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 4 ms to minimize.
[2024-05-22 00:43:55] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:43:55] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:43:55] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:43:55] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:43:55] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:43:55] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:43:55] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:43:56] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:43:56] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:43:56] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:43:56] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:43:56] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:43:56] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:43:56] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:43:57] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:43:57] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:43:57] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:43:57] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:43:57] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:43:57] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:43:58] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:43:58] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:43:58] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:43:58] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:43:58] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:43:58] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:43:58] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:43:58] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:43:58] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:43:59] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:43:59] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:43:59] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:43:59] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:43:59] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:43:59] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:43:59] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:43:59] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:44:00] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:44:00] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:44:00] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:44:00] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:44:00] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:44:00] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:44:01] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:44:01] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:44:01] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:44:01] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:44:01] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:44:01] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:44:01] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:44:01] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:44:01] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:44:02] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:44:02] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:44:02] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:44:02] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:44:02] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:44:02] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:44:02] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/980 variables, and 230 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/537 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 1/537 variables, 65/109 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 120/230 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:44:10] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:44:10] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:44:10] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:44:11] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:44:11] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:44:11] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:44:11] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:44:11] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:44:11] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:44:11] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:44:11] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:44:11] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:44:12] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:44:12] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:44:12] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:44:12] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:44:12] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:44:12] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:44:12] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:44:12] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:44:12] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:44:13] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:44:13] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:44:13] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:44:13] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:44:13] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:44:13] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:44:13] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:44:13] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:44:14] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:44:14] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:44:14] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:44:14] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:44:14] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:44:14] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:44:14] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:44:14] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:44:14] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:44:15] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:44:16] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:44:17] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:44:18] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:44:18] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:44:18] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:44:18] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:44:18] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:44:18] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:44:19] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:44:19] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:44:19] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:44:19] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:44:19] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:44:19] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:44:19] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:44:19] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:44:19] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:44:20] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:44:20] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:44:20] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:44:20] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:44:20] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:44:20] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:44:20] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:44:21] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:44:21] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:44:21] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:44:21] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:44:21] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:44:22] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:44:22] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:44:22] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:44:22] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:44:22] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:44:22] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:44:22] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:44:22] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:44:23] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 20/330 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:44:24] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:44:24] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:44:24] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:44:24] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:44:24] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:44:24] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:44:24] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:44:25] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:44:25] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:44:25] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:44:25] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:44:25] [INFO ] Deduced a trap composed of 111 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:44:25] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:44:25] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:44:25] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:44:25] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:44:26] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:44:26] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:44:26] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:44:26] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
Problem TDEAD423 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 20/350 constraints. Problems are: Problem set: 1 solved, 441 unsolved
[2024-05-22 00:44:27] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:44:27] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:44:27] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:44:27] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:44:27] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:44:27] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:44:27] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:44:27] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:44:28] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:44:28] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:44:28] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:44:28] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:44:28] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:44:28] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:44:28] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:44:28] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:44:29] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:44:29] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:44:29] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:44:29] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 20/370 constraints. Problems are: Problem set: 1 solved, 441 unsolved
[2024-05-22 00:44:29] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:44:30] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:44:30] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:44:30] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:44:30] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:44:30] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:44:30] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:44:30] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:44:31] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:44:31] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:44:31] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:44:31] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:44:31] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:44:31] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:44:31] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:44:31] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:44:31] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:44:32] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:44:32] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:44:32] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 20/390 constraints. Problems are: Problem set: 1 solved, 441 unsolved
[2024-05-22 00:44:32] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:44:33] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:44:33] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:44:33] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:44:33] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:44:33] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:44:33] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:44:33] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:44:33] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:44:34] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:44:34] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:44:34] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:44:34] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:44:34] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:44:34] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:44:34] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:44:34] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:44:35] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:44:35] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:44:35] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/537 variables, 20/410 constraints. Problems are: Problem set: 1 solved, 441 unsolved
[2024-05-22 00:44:36] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:44:36] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/980 variables, and 412 constraints, problems are : Problem set: 1 solved, 441 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/537 constraints, PredecessorRefiner: 0/442 constraints, Known Traps: 302/302 constraints]
After SMT, in 60086ms problems are : Problem set: 1 solved, 441 unsolved
Search for dead transitions found 1 dead transitions in 60090ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 537/537 places, 442/443 transitions.
Applied a total of 0 rules in 8 ms. Remains 537 /537 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60696 ms. Remains : 537/537 places, 442/443 transitions.
Built C files in :
/tmp/ltsmin9106273778489706290
[2024-05-22 00:44:36] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9106273778489706290
Running compilation step : cd /tmp/ltsmin9106273778489706290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 988 ms.
Running link step : cd /tmp/ltsmin9106273778489706290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin9106273778489706290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16238857510635809530.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:44:51] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:44:51] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:44:51] [INFO ] Time to serialize gal into /tmp/LTL15726740416158785721.gal : 5 ms
[2024-05-22 00:44:51] [INFO ] Time to serialize properties into /tmp/LTL14364190411185137634.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15726740416158785721.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12306274104138210489.hoa' '-atoms' '/tmp/LTL14364190411185137634.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(p55==0)")||(X(("(p212==0)")||(("(p734==0)")&&(G("(p223==0)"))))))))
Formula 0 simplified : F(!"(p55==0)" & X(!"(p212==0)" & (!"(p734==0)" | F!"(p223==0)")))
Detected timeout of ITS tools.
[2024-05-22 00:45:22] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:45:22] [INFO ] Applying decomposition
[2024-05-22 00:45:22] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13808364757840069300.txt' '-o' '/tmp/graph13808364757840069300.bin' '-w' '/tmp/graph13808364757840069300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13808364757840069300.bin' '-l' '-1' '-v' '-w' '/tmp/graph13808364757840069300.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:45:22] [INFO ] Decomposing Gal with order
[2024-05-22 00:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:45:22] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-22 00:45:22] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 9 ms.
[2024-05-22 00:45:22] [INFO ] Time to serialize gal into /tmp/LTL5618138603116404667.gal : 6 ms
[2024-05-22 00:45:22] [INFO ] Time to serialize properties into /tmp/LTL342981647301645176.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5618138603116404667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL342981647301645176.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(("(i7.i1.u19.p55==0)")||(X(("(i12.u62.p212==0)")||(("(i1.u174.p734==0)")&&(G("(i3.i0.u65.p223==0)"))))))))
Formula 0 simplified : F(!"(i7.i1.u19.p55==0)" & X(!"(i12.u62.p212==0)" & (!"(i1.u174.p734==0)" | F!"(i3.i0.u65.p223==0)")))
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 277082 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 52 ms. Remains 539 /551 variables (removed 12) and now considering 468/480 (removed 12) transitions.
// Phase 1: matrix 468 rows 539 cols
[2024-05-22 00:45:37] [INFO ] Computed 107 invariants in 6 ms
[2024-05-22 00:45:37] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 00:45:37] [INFO ] Invariant cache hit.
[2024-05-22 00:45:38] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-05-22 00:45:38] [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-05-22 00:45:49] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:45:49] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:45:49] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:45:50] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:45:50] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:45:50] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:45:50] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:45:50] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:45:50] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:45:50] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:45:50] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:45:50] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:45:50] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:45:51] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:45:51] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:45:51] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:45:51] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:45:51] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:45:51] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:45:51] [INFO ] Deduced a trap composed of 93 places in 85 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-05-22 00:45:51] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:45:52] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:45:52] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:45:52] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:45:52] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:45:52] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:45:52] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:45:52] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:45:52] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:45:52] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:45:52] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:45:53] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:45:53] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:45:53] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:45:53] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:45:53] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:45:53] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:45:53] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:45:53] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:45:53] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 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-05-22 00:45:53] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:45:54] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:45:54] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:45:54] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:45:54] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:45:54] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:45:54] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:45:54] [INFO ] Deduced a trap composed of 127 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:45:55] [INFO ] Deduced a trap composed of 127 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:45:55] [INFO ] Deduced a trap composed of 130 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:45:55] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:45:55] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:45:55] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:45:55] [INFO ] Deduced a trap composed of 124 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:45:55] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:45:55] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:45:55] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 5 ms to minimize.
[2024-05-22 00:45:56] [INFO ] Deduced a trap composed of 131 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:45:56] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:45:56] [INFO ] Deduced a trap composed of 88 places in 98 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-05-22 00:45:59] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:46:00] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:46:00] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:46:00] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:46:00] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:46:00] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:46:00] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:46:01] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:46:01] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:46:01] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:46:01] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:46:01] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:46:01] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:46:01] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:46:01] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:46:02] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:46:02] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:46:02] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:46:02] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:46:02] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/187 constraints. Problems are: Problem set: 3 solved, 464 unsolved
[2024-05-22 00:46:03] [INFO ] Deduced a trap composed of 104 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:46:03] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:46:03] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:46:03] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:46:03] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:46:03] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:46:03] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:46:03] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:46:04] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:46:04] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:46:04] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:46:04] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:46:04] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:46:04] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:46:04] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:46:04] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:46:04] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:46:04] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:46:04] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:46:05] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 3 solved, 464 unsolved
[2024-05-22 00:46:05] [INFO ] Deduced a trap composed of 31 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:46:05] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:46:05] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:46:05] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:46:05] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:46:05] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:46:05] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:46:06] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:46:06] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:46:06] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:46:06] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:46:06] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:46:06] [INFO ] Deduced a trap composed of 60 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:46:06] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:46:07] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:46:07] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:46:07] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:46:07] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:46:07] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:46:08] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/227 constraints. Problems are: Problem set: 3 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1007 variables, and 227 constraints, problems are : Problem set: 3 solved, 464 unsolved in 30015 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: 120/120 constraints]
Escalating to Integer solving :Problem set: 3 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 3 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 3 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 3 solved, 464 unsolved
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 4 (INCLUDED_ONLY) 0/539 variables, 120/227 constraints. Problems are: Problem set: 20 solved, 447 unsolved
[2024-05-22 00:46:12] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:46:12] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:46:12] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:46:12] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:46:13] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:46:13] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:46:13] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:46:13] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:46:13] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:46:13] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:46:13] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:46:14] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:46:14] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:46:14] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:46:14] [INFO ] Deduced a trap composed of 90 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:46:14] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:46:14] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:46:15] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:46:15] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:46:15] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/247 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-05-22 00:46:15] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:46:15] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:46:16] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:46:16] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:46:16] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:46:16] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:46:16] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:46:16] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:46:17] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:46:17] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:46:17] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:46:17] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:46:17] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 4 ms to minimize.
[2024-05-22 00:46:17] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:46:17] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:46:17] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:46:18] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:46:18] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:46:18] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:46:18] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/267 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-05-22 00:46:19] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:46:19] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:46:19] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:46:19] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:46:19] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:46:20] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:46:20] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:46:20] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:46:20] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:46:20] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:46:20] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:46:20] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:46:20] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:46:20] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:46:21] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:46:21] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:46:21] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:46:21] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:46:21] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:46:21] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/287 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-05-22 00:46:22] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:46:22] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:46:22] [INFO ] Deduced a trap composed of 60 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:46:22] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:46:22] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:46:22] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:46:23] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:46:23] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:46:23] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:46:23] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:46:23] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:46:23] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:46:23] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:46:23] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:46:24] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:46:24] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:46:24] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:46:24] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:46:24] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:46:24] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 3 ms to minimize.
Problem TDEAD451 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/307 constraints. Problems are: Problem set: 26 solved, 441 unsolved
[2024-05-22 00:46:25] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:46:25] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:46:25] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:46:25] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:46:25] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:46:25] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:46:26] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:46:26] [INFO ] Deduced a trap composed of 127 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:46:26] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:46:26] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:46:26] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:46:26] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:46:26] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:46:26] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:46:27] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:46:27] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:46:27] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:46:27] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:46:27] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:46:27] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/327 constraints. Problems are: Problem set: 26 solved, 441 unsolved
[2024-05-22 00:46:28] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:46:28] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:46:28] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:46:28] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:46:29] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:46:29] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:46:29] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:46:29] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:46:29] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:46:29] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:46:29] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:46:29] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:46:29] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:46:30] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:46:30] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:46:30] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:46:30] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:46:30] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:46:30] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:46:30] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 20/347 constraints. Problems are: Problem set: 26 solved, 441 unsolved
[2024-05-22 00:46:31] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:46:31] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:46:32] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:46:33] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:46:34] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:46:34] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:46:34] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:46:34] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 4 ms to minimize.
[2024-05-22 00:46:35] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 4 ms to minimize.
[2024-05-22 00:46:35] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:46:35] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:46:35] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:46:35] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:46:35] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:46:36] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:46:36] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:46:36] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:46:36] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:46:36] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 20/367 constraints. Problems are: Problem set: 26 solved, 441 unsolved
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:46:37] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:46:38] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:46:38] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:46:38] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
SMT process timed out in 60122ms, After SMT, problems are : Problem set: 26 solved, 441 unsolved
Search for dead transitions found 26 dead transitions in 60131ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 442/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 442
Applied a total of 1 rules in 9 ms. Remains 538 /539 variables (removed 1) and now considering 442/442 (removed 0) transitions.
// Phase 1: matrix 442 rows 538 cols
[2024-05-22 00:46:38] [INFO ] Computed 110 invariants in 7 ms
[2024-05-22 00:46:38] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-22 00:46:38] [INFO ] Invariant cache hit.
[2024-05-22 00:46:38] [INFO ] Implicit Places using invariants and state equation in 466 ms returned [60, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 663 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 536/551 places, 442/480 transitions.
Applied a total of 0 rules in 7 ms. Remains 536 /536 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61640 ms. Remains : 536/551 places, 442/480 transitions.
Stuttering acceptance computed with spot in 154 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 33343 reset in 138 ms.
Product exploration explored 100000 steps with 33452 reset in 143 ms.
Computed a total of 468 stabilizing places and 384 stable transitions
Graph (complete) has 1135 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 384 stable transitions
Detected a total of 468/536 stabilizing places and 384/442 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 876 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 211 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 (195 resets) in 178 ms. (223 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (36 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 36259 steps (28 resets) in 146 ms. (246 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 1828 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 231 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 226 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, 442/442 transitions.
Applied a total of 0 rules in 15 ms. Remains 536 /536 variables (removed 0) and now considering 442/442 (removed 0) transitions.
// Phase 1: matrix 442 rows 536 cols
[2024-05-22 00:46:43] [INFO ] Computed 108 invariants in 6 ms
[2024-05-22 00:46:43] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-22 00:46:43] [INFO ] Invariant cache hit.
[2024-05-22 00:46:43] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 441 sub problems to find dead transitions.
[2024-05-22 00:46:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 64/106 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:46:53] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:46:53] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:46:53] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:46:53] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:46:54] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:46:54] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:46:54] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:46:54] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:46:54] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:46:54] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:46:54] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:46:54] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:46:54] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:46:54] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:46:55] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:46:55] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:46:55] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:46:55] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:46:55] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:46:55] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:46:55] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:46:56] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:46:56] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:46:56] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:46:56] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:46:56] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:46:56] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:46:56] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:46:56] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:46:56] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:46:57] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:46:57] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:46:57] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:46:57] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:46:57] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:46:57] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:46:57] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:46:57] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:46:58] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:46:58] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:46:58] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:46:58] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:46:58] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:46:58] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:46:59] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:46:59] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:46:59] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:46:59] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:46:59] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:46:59] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:46:59] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:46:59] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:47:00] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:47:00] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:47:00] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:47:00] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:47:01] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:47:01] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:47:01] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:47:01] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 110 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 111 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:47:07] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:47:07] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:47:07] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:47:07] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:47:07] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:47:07] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:47:07] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:47:08] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:47:08] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:47:08] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:47:08] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:47:08] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:47:08] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:47:08] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:47:08] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:47:08] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:47:10] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:47:10] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:47:10] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:47:11] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:47:11] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:47:11] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:47:11] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:47:11] [INFO ] Deduced a trap composed of 93 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:47:11] [INFO ] Deduced a trap composed of 96 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:47:12] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:47:12] [INFO ] Deduced a trap composed of 96 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:47:12] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:47:12] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:47:12] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:47:12] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:47:12] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:47:12] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:47:12] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:47:13] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:47:13] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 0 solved, 441 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Finished structural reductions in LTL mode , in 1 iterations and 30884 ms. Remains : 536/536 places, 442/442 transitions.
Computed a total of 468 stabilizing places and 384 stable transitions
Graph (complete) has 1135 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 384 stable transitions
Detected a total of 468/536 stabilizing places and 384/442 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 825 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 209 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 36667 steps (179 resets) in 295 ms. (123 steps per ms) remains 0/6 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 1868 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 225 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 199 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 186 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 33338 reset in 184 ms.
Product exploration explored 100000 steps with 33427 reset in 188 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 221 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, 442/442 transitions.
Graph (trivial) has 250 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 1129 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 434
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 493
Deduced a syphon composed of 147 places in 2 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 149 place count 529 transition count 493
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 176 place count 502 transition count 448
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 448
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 448
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 419 place count 457 transition count 403
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 403
Deduced a syphon composed of 246 places in 0 ms
Applied a total of 464 rules in 79 ms. Remains 457 /536 variables (removed 79) and now considering 403/442 (removed 39) transitions.
[2024-05-22 00:47:18] [INFO ] Redundant transitions in 8 ms returned []
Running 402 sub problems to find dead transitions.
// Phase 1: matrix 403 rows 457 cols
[2024-05-22 00:47:18] [INFO ] Computed 108 invariants in 8 ms
[2024-05-22 00:47:18] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (OVERLAPS) 1/457 variables, 65/107 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 402 unsolved
[2024-05-22 00:47:26] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:47:26] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:47:27] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:47:27] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:47:27] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:47:27] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:47:27] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:47:27] [INFO ] Deduced a trap composed of 43 places in 99 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
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-05-22 00:47:27] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-22 00:47:27] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:47:27] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:47:27] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-22 00:47:28] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:47:28] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:47:28] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-22 00:47:28] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-22 00:47:28] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:47:28] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:47:28] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-22 00:47:28] [INFO ] Deduced a trap composed of 3 places in 76 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
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 TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 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 TDEAD239 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 20/128 constraints. Problems are: Problem set: 119 solved, 283 unsolved
[2024-05-22 00:47:28] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:47:28] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 20/148 constraints. Problems are: Problem set: 170 solved, 232 unsolved
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-05-22 00:47:29] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
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 TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 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 TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 20/168 constraints. Problems are: Problem set: 228 solved, 174 unsolved
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-05-22 00:47:32] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-22 00:47:32] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 20/188 constraints. Problems are: Problem set: 258 solved, 144 unsolved
[2024-05-22 00:47:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-22 00:47:32] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-22 00:47:32] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:47:32] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
[2024-05-22 00:47:32] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:47:33] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:47:33] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:47:33] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:47:33] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:47:33] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:47:33] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:47:33] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
Problem TDEAD151 is UNSAT
[2024-05-22 00:47:33] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:47:33] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:47:34] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:47:34] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
[2024-05-22 00:47:34] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-05-22 00:47:34] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD210 is UNSAT
[2024-05-22 00:47:34] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD212 is UNSAT
[2024-05-22 00:47:34] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 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/457 variables, 20/208 constraints. Problems are: Problem set: 270 solved, 132 unsolved
[2024-05-22 00:47:34] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:47:34] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:47:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD288 is UNSAT
[2024-05-22 00:47:35] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:47:35] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:47:35] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:47:35] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:47:35] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:47:35] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:47:35] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:47:35] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:47:36] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:47:36] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 13/221 constraints. Problems are: Problem set: 271 solved, 131 unsolved
[2024-05-22 00:47:37] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:47:38] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:47:38] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:47:38] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:47:38] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:47:38] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:47:39] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 7/228 constraints. Problems are: Problem set: 271 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/228 constraints. Problems are: Problem set: 271 solved, 131 unsolved
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 12 (OVERLAPS) 402/859 variables, 457/685 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/859 variables, 11/696 constraints. Problems are: Problem set: 293 solved, 109 unsolved
[2024-05-22 00:47:42] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:47:42] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:47:42] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:47:42] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:47:42] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:47:42] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/859 variables, 6/702 constraints. Problems are: Problem set: 293 solved, 109 unsolved
[2024-05-22 00:47:44] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:47:44] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 2/704 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/859 variables, 0/704 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 17 (OVERLAPS) 1/860 variables, 1/705 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/860 variables, 0/705 constraints. Problems are: Problem set: 293 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 860/860 variables, and 705 constraints, problems are : Problem set: 293 solved, 109 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 457/457 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 128/128 constraints]
Escalating to Integer solving :Problem set: 293 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 196/406 variables, 65/65 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 1/66 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 128/194 constraints. Problems are: Problem set: 293 solved, 109 unsolved
[2024-05-22 00:47:49] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:47:49] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:47:49] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:47:49] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:47:49] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:47:50] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:47:50] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:47:50] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:47:50] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:47:50] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:47:50] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:47:50] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:47:50] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:47:50] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:47:51] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:47:51] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:47:51] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:47:51] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:47:51] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:47:51] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/214 constraints. Problems are: Problem set: 293 solved, 109 unsolved
[2024-05-22 00:47:52] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:47:52] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:47:52] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:47:52] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:47:52] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 5/219 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/219 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 49/455 variables, 42/261 constraints. Problems are: Problem set: 293 solved, 109 unsolved
[2024-05-22 00:47:54] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:47:54] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 2/263 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/263 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 402/857 variables, 455/718 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/857 variables, 11/729 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/857 variables, 109/838 constraints. Problems are: Problem set: 293 solved, 109 unsolved
[2024-05-22 00:48:01] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/857 variables, 1/839 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/857 variables, 0/839 constraints. Problems are: Problem set: 293 solved, 109 unsolved
At refinement iteration 15 (OVERLAPS) 2/859 variables, 2/841 constraints. Problems are: Problem set: 293 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/860 variables, and 841 constraints, problems are : Problem set: 293 solved, 109 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 457/457 constraints, ReadFeed: 11/12 constraints, PredecessorRefiner: 109/402 constraints, Known Traps: 156/156 constraints]
After SMT, in 60254ms problems are : Problem set: 293 solved, 109 unsolved
Search for dead transitions found 293 dead transitions in 60259ms
Found 293 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 293 transitions
Dead transitions reduction (with SMT) removed 293 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 457/536 places, 110/442 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 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 178 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 178 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 4 rules in 10 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/442 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60366 ms. Remains : 178/536 places, 127/442 transitions.
Built C files in :
/tmp/ltsmin15537923170593820020
[2024-05-22 00:48:18] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15537923170593820020
Running compilation step : cd /tmp/ltsmin15537923170593820020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 677 ms.
Running link step : cd /tmp/ltsmin15537923170593820020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin15537923170593820020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1053088780584919120.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 442/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 536 /536 variables (removed 0) and now considering 442/442 (removed 0) transitions.
// Phase 1: matrix 442 rows 536 cols
[2024-05-22 00:48:33] [INFO ] Computed 108 invariants in 6 ms
[2024-05-22 00:48:33] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 00:48:33] [INFO ] Invariant cache hit.
[2024-05-22 00:48:34] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 441 sub problems to find dead transitions.
[2024-05-22 00:48:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 1/536 variables, 64/106 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:48:43] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:48:43] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:48:43] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:48:43] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:48:44] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:48:44] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:48:44] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:48:44] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:48:44] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:48:44] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:48:44] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:48:44] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:48:44] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:48:45] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:48:45] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:48:45] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:48:45] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:48:45] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:48:45] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:48:45] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/536 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:48:45] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:48:46] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:48:46] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:48:46] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:48:46] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:48:46] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:48:46] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:48:46] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:48:46] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:48:46] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:48:47] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:48:47] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:48:47] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:48:47] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:48:47] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:48:47] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:48:48] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:48:48] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:48:48] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:48:48] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:48:49] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:48:49] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:48:49] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:48:49] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:48:49] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:48:49] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:48:49] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:48:49] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:48:50] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:48:50] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:48:50] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:48:50] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:48:50] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:48:50] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:48:50] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:48:51] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:48:51] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:48:51] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:48:52] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:48:52] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:48:55] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:48:55] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:48:55] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:48:55] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 110 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 111 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:48:57] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:48:57] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:48:57] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:48:57] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:48:57] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:48:57] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:48:57] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:48:59] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:48:59] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:48:59] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:48:59] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:48:59] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:48:59] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:48:59] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:49:00] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:49:01] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:49:01] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:49:01] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-22 00:49:01] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:49:03] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:49:03] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:49:03] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:49:03] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:49:03] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:49:03] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:49:04] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:49:04] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:49:04] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 3 ms to minimize.
SMT process timed out in 30096ms, After SMT, problems are : Problem set: 0 solved, 441 unsolved
Search for dead transitions found 0 dead transitions in 30099ms
Finished structural reductions in LTL mode , in 1 iterations and 30642 ms. Remains : 536/536 places, 442/442 transitions.
Built C files in :
/tmp/ltsmin11093572041302481046
[2024-05-22 00:49:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11093572041302481046
Running compilation step : cd /tmp/ltsmin11093572041302481046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 878 ms.
Running link step : cd /tmp/ltsmin11093572041302481046;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11093572041302481046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4832376956605933445.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:49:19] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:49:19] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:49:19] [INFO ] Time to serialize gal into /tmp/LTL927671691032334362.gal : 2 ms
[2024-05-22 00:49:19] [INFO ] Time to serialize properties into /tmp/LTL237585401706761059.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL927671691032334362.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7384752538269173281.hoa' '-atoms' '/tmp/LTL237585401706761059.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p478==1)"))||((X(("(p670!=1)")||(X("(p670!=1)"))))U((X(G(("(p670!=1)")||(X("(p670!=1)")))))||(("(p352==1)")&&(X(("(p670!=1)")|...179
Formula 0 simplified : G!"(p478==1)" & (X(!"(p670!=1)" & X!"(p670!=1)") R (XF(!"(p670!=1)" & X!"(p670!=1)") & (!"(p352==1)" | X(!"(p670!=1)" & X!"(p670!=1)...160
Detected timeout of ITS tools.
[2024-05-22 00:49:49] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:49:49] [INFO ] Applying decomposition
[2024-05-22 00:49:49] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11229744428355848471.txt' '-o' '/tmp/graph11229744428355848471.bin' '-w' '/tmp/graph11229744428355848471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11229744428355848471.bin' '-l' '-1' '-v' '-w' '/tmp/graph11229744428355848471.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:49:49] [INFO ] Decomposing Gal with order
[2024-05-22 00:49:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:49:49] [INFO ] Removed a total of 153 redundant transitions.
[2024-05-22 00:49:49] [INFO ] Flatten gal took : 34 ms
[2024-05-22 00:49:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 14 ms.
[2024-05-22 00:49:49] [INFO ] Time to serialize gal into /tmp/LTL18112494457459440663.gal : 8 ms
[2024-05-22 00:49:49] [INFO ] Time to serialize properties into /tmp/LTL10078711008461981673.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18112494457459440663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10078711008461981673.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((F("(i12.i2.u130.p478==1)"))||((X(("(i8.i0.u165.p670!=1)")||(X("(i8.i0.u165.p670!=1)"))))U((X(G(("(i8.i0.u165.p670!=1)")||(X("(i8.i...269
Formula 0 simplified : G!"(i12.i2.u130.p478==1)" & (X(!"(i8.i0.u165.p670!=1)" & X!"(i8.i0.u165.p670!=1)") R (XF(!"(i8.i0.u165.p670!=1)" & X!"(i8.i0.u165.p6...250
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-20-LTLFireability-05 finished in 267566 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.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.
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 1 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 66 ms. Remains 187 /551 variables (removed 364) and now considering 150/480 (removed 330) transitions.
[2024-05-22 00:50:04] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 187 cols
[2024-05-22 00:50:04] [INFO ] Computed 81 invariants in 1 ms
[2024-05-22 00:50:05] [INFO ] Implicit Places using invariants in 145 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 159 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 229 ms. Remains : 164/551 places, 150/480 transitions.
Stuttering acceptance computed with spot in 26 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 268 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 20 ms. Remains 539 /551 variables (removed 12) and now considering 468/480 (removed 12) transitions.
// Phase 1: matrix 468 rows 539 cols
[2024-05-22 00:50:05] [INFO ] Computed 107 invariants in 3 ms
[2024-05-22 00:50:05] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 00:50:05] [INFO ] Invariant cache hit.
[2024-05-22 00:50:05] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-05-22 00:50:05] [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-05-22 00:50:15] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:50:15] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:50:16] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:50:16] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:50:16] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:50:16] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:50:16] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:50:16] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:50:16] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:50:16] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:50:16] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:50:17] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:50:17] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:50:17] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:50:17] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:50:17] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:50:17] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:50:17] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:50:17] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:50:17] [INFO ] Deduced a trap composed of 102 places in 87 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-05-22 00:50:18] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:50:18] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:50:18] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 3 ms to minimize.
[2024-05-22 00:50:18] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:50:18] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:50:18] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:50:18] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:50:18] [INFO ] Deduced a trap composed of 118 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:50:18] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:50:19] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:50:19] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:50:19] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:50:19] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:50:19] [INFO ] Deduced a trap composed of 100 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:50:19] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:50:19] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:50:19] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:50:19] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:50:19] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:50:19] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-22 00:50:20] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:50:20] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:50:20] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:50:20] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:50:20] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:50:20] [INFO ] Deduced a trap composed of 113 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:50:20] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:50:20] [INFO ] Deduced a trap composed of 105 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:50:21] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:50:21] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:50:21] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:50:21] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:50:21] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:50:21] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:50:21] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:50:21] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:50:21] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:50:21] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:50:22] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:50:22] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/167 constraints. Problems are: Problem set: 16 solved, 451 unsolved
[2024-05-22 00:50:26] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:50:26] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:50:26] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:50:26] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:50:26] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:50:26] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:50:26] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:50:26] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:50:27] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:50:27] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:50:27] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:50:27] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:50:27] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:50:27] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:50:27] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:50:27] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:50:28] [INFO ] Deduced a trap composed of 110 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:50:28] [INFO ] Deduced a trap composed of 106 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:50:28] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:50:28] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
Problem TDEAD438 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/187 constraints. Problems are: Problem set: 19 solved, 448 unsolved
[2024-05-22 00:50:28] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:50:28] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:50:29] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:50:29] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:50:29] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:50:29] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:50:29] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:50:29] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:50:29] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:50:30] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:50:30] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:50:30] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:50:30] [INFO ] Deduced a trap composed of 118 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:50:30] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:50:30] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:50:30] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:50:30] [INFO ] Deduced a trap composed of 107 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:50:30] [INFO ] Deduced a trap composed of 113 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:50:31] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:50:31] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 2 ms to minimize.
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 22 solved, 445 unsolved
[2024-05-22 00:50:31] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:50:31] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:50:31] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:50:31] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:50:31] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:50:32] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:50:32] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:50:32] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:50:32] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:50:32] [INFO ] Deduced a trap composed of 109 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:50:32] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:50:32] [INFO ] Deduced a trap composed of 109 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:50:32] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:50:32] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:50:33] [INFO ] Deduced a trap composed of 110 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:50:33] [INFO ] Deduced a trap composed of 107 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:50:33] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:50:33] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:50:33] [INFO ] Deduced a trap composed of 116 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:50:33] [INFO ] Deduced a trap composed of 113 places in 100 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 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 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.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 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 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 1.0)
(s296 0.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 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/227 constraints. Problems are: Problem set: 22 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 539/1007 variables, and 227 constraints, problems are : Problem set: 22 solved, 445 unsolved in 30012 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: 120/120 constraints]
Escalating to Integer solving :Problem set: 22 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 41/41 constraints. Problems are: Problem set: 22 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/41 constraints. Problems are: Problem set: 22 solved, 445 unsolved
At refinement iteration 2 (OVERLAPS) 1/539 variables, 64/105 constraints. Problems are: Problem set: 22 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 2/107 constraints. Problems are: Problem set: 22 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 120/227 constraints. Problems are: Problem set: 22 solved, 445 unsolved
[2024-05-22 00:50:39] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:50:39] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:50:40] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:50:40] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:50:40] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:50:40] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:50:40] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:50:40] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:50:40] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:50:40] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:50:40] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:50:41] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:50:41] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:50:41] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:50:41] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:50:41] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:50:41] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:50:41] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:50:41] [INFO ] Deduced a trap composed of 112 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:50:41] [INFO ] Deduced a trap composed of 123 places in 89 ms of which 2 ms to minimize.
Problem TDEAD419 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 20/247 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-05-22 00:50:42] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:50:42] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:50:42] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:50:42] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:50:42] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:50:42] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:50:42] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:50:43] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:50:43] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:50:43] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:50:43] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:50:43] [INFO ] Deduced a trap composed of 102 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:50:43] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:50:43] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:50:43] [INFO ] Deduced a trap composed of 104 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:50:43] [INFO ] Deduced a trap composed of 104 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:50:43] [INFO ] Deduced a trap composed of 110 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:50:44] [INFO ] Deduced a trap composed of 114 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:50:44] [INFO ] Deduced a trap composed of 116 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:50:44] [INFO ] Deduced a trap composed of 120 places in 102 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 20/267 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-05-22 00:50:44] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:50:44] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:50:44] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:50:45] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:50:45] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:50:45] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:50:45] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:50:45] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:50:45] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:50:45] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:50:45] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:50:45] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:50:45] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:50:46] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:50:46] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:50:46] [INFO ] Deduced a trap composed of 105 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:50:46] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:50:46] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:50:46] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:50:46] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 20/287 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-05-22 00:50:47] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:50:47] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:50:47] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:50:47] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:50:47] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:50:47] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:50:47] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:50:48] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:50:48] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:50:48] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:50:48] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:50:48] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:50:48] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:50:48] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:50:48] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:50:48] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:50:49] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:50:49] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:50:49] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:50:49] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 3 ms to minimize.
Problem TDEAD408 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD444 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/307 constraints. Problems are: Problem set: 29 solved, 438 unsolved
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 4 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:50:52] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:50:52] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:50:52] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:50:52] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 20/327 constraints. Problems are: Problem set: 29 solved, 438 unsolved
[2024-05-22 00:50:53] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:50:53] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:50:53] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:50:53] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:50:53] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:50:53] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:50:54] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:50:54] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:50:54] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:50:54] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:50:54] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:50:54] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:50:54] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:50:54] [INFO ] Deduced a trap composed of 121 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:50:55] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:50:55] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:50:55] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:50:55] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:50:55] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:50:55] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 20/347 constraints. Problems are: Problem set: 29 solved, 438 unsolved
[2024-05-22 00:50:56] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:50:56] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:50:56] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:50:56] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:50:56] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:50:57] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:50:57] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:50:57] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:50:57] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:50:57] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:50:57] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:50:57] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:50:57] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:50:57] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:50:58] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:50:58] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:50:58] [INFO ] Deduced a trap composed of 122 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:50:58] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:50:58] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:50:58] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 20/367 constraints. Problems are: Problem set: 29 solved, 438 unsolved
[2024-05-22 00:50:59] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:50:59] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:50:59] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:50:59] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:50:59] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:50:59] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:50:59] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:50:59] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:51:00] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:51:00] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:51:00] [INFO ] Deduced a trap composed of 108 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:51:00] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:51:00] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:51:00] [INFO ] Deduced a trap composed of 99 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:51:00] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:51:00] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:51:00] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:51:00] [INFO ] Deduced a trap composed of 107 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:51:01] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:51:01] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 20/387 constraints. Problems are: Problem set: 29 solved, 438 unsolved
[2024-05-22 00:51:01] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:51:01] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:51:02] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:51:02] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:51:02] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:51:02] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:51:02] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:51:02] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:51:02] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:51:02] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:51:03] [INFO ] Deduced a trap composed of 108 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:51:03] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:51:03] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:51:03] [INFO ] Deduced a trap composed of 108 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:51:03] [INFO ] Deduced a trap composed of 109 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:51:03] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:51:03] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:51:03] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:51:04] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:51:04] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 20/407 constraints. Problems are: Problem set: 29 solved, 438 unsolved
[2024-05-22 00:51:04] [INFO ] Deduced a trap composed of 117 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:51:04] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:51:05] [INFO ] Deduced a trap composed of 124 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:51:05] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:51:05] [INFO ] Deduced a trap composed of 139 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:51:05] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:51:05] [INFO ] Deduced a trap composed of 114 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:51:05] [INFO ] Deduced a trap composed of 123 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:51:05] [INFO ] Deduced a trap composed of 127 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:51:05] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 3 ms to minimize.
SMT process timed out in 60136ms, After SMT, problems are : Problem set: 29 solved, 438 unsolved
Search for dead transitions found 29 dead transitions in 60147ms
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 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 537 transition count 439
Applied a total of 2 rules in 9 ms. Remains 537 /539 variables (removed 2) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 537 cols
[2024-05-22 00:51:05] [INFO ] Computed 111 invariants in 3 ms
[2024-05-22 00:51:06] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-22 00:51:06] [INFO ] Invariant cache hit.
[2024-05-22 00:51:06] [INFO ] Implicit Places using invariants and state equation in 438 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 612 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 536/551 places, 439/480 transitions.
Applied a total of 0 rules in 11 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 61448 ms. Remains : 536/551 places, 439/480 transitions.
Stuttering acceptance computed with spot in 70 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 193 ms.
Product exploration explored 100000 steps with 50000 reset in 191 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.4 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 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 20 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 61943 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 49 ms. Remains 540 /551 variables (removed 11) and now considering 469/480 (removed 11) transitions.
// Phase 1: matrix 469 rows 540 cols
[2024-05-22 00:51:07] [INFO ] Computed 107 invariants in 7 ms
[2024-05-22 00:51:07] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 00:51:07] [INFO ] Invariant cache hit.
[2024-05-22 00:51:07] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2024-05-22 00:51:07] [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-05-22 00:51:19] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:51:19] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:51:19] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:51:19] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:51:19] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:51:19] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:51:19] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:51:19] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:51:19] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:51:20] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:51:20] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:51:20] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:51:20] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:51:20] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:51:20] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:51:20] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:51:20] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:51:20] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:51:20] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:51:21] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 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-05-22 00:51:21] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:51:21] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:51:21] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:51:21] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:51:21] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:51:21] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 3 ms to minimize.
[2024-05-22 00:51:22] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:51:22] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:51:22] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:51:22] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:51:22] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:51:22] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:51:22] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:51:22] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:51:22] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:51:22] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:51:23] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:51:23] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:51:23] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:51:23] [INFO ] Deduced a trap composed of 89 places in 85 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-05-22 00:51:23] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:51:23] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:51:23] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:51:23] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:51:24] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:51:24] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:51:24] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:51:24] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:51:24] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:51:24] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:51:24] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:51:24] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:51:25] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:51:25] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:51:25] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:51:25] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:51:25] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:51:25] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:51:26] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:51:26] [INFO ] Deduced a trap composed of 72 places in 119 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-05-22 00:51:30] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:51:30] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:51:30] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:51:30] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:51:30] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:51:30] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:51:30] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:51:30] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:51:30] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:51:30] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:51:31] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:51:31] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:51:31] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:51:31] [INFO ] Deduced a trap composed of 129 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:51:31] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:51:31] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:51:31] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:51:31] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:51:32] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:51:32] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/187 constraints. Problems are: Problem set: 6 solved, 462 unsolved
[2024-05-22 00:51:32] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:51:32] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:51:32] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:51:32] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:51:32] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:51:33] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:51:33] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:51:33] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:51:33] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:51:33] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:51:33] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:51:33] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:51:34] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:51:34] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:51:34] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:51:34] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:51:34] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:51:34] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:51:34] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:51:35] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 2 ms to minimize.
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/207 constraints. Problems are: Problem set: 9 solved, 459 unsolved
[2024-05-22 00:51:35] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:51:35] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:51:35] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:51:35] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:51:35] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:51:36] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:51:36] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:51:36] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:51:36] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:51:36] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:51:37] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:51:37] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:51:37] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:51:37] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:51:37] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:51:37] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:51:38] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1009 variables, and 224 constraints, problems are : Problem set: 9 solved, 459 unsolved in 30013 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: 117/117 constraints]
Escalating to Integer solving :Problem set: 9 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 41/41 constraints. Problems are: Problem set: 9 solved, 459 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/41 constraints. Problems are: Problem set: 9 solved, 459 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 65/106 constraints. Problems are: Problem set: 9 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 1/107 constraints. Problems are: Problem set: 9 solved, 459 unsolved
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 117/224 constraints. Problems are: Problem set: 15 solved, 453 unsolved
[2024-05-22 00:51:42] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:51:42] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:51:43] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:51:43] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:51:43] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:51:43] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:51:43] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:51:43] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:51:44] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:51:44] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:51:44] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:51:44] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:51:44] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:51:45] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:51:45] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:51:45] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:51:45] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:51:45] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:51:45] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:51:45] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/244 constraints. Problems are: Problem set: 17 solved, 451 unsolved
[2024-05-22 00:51:46] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:51:46] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:51:46] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:51:46] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:51:47] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:51:47] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:51:47] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:51:47] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:51:47] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:51:47] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:51:47] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:51:48] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:51:48] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:51:48] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:51:48] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:51:48] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:51:48] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:51:48] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:51:49] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:51:49] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/264 constraints. Problems are: Problem set: 17 solved, 451 unsolved
[2024-05-22 00:51:49] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:51:49] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:51:49] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:51:50] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:51:50] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:51:50] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:51:50] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:51:50] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:51:50] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:51:50] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:51:51] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:51:51] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:51:51] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:51:51] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:51:51] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:51:51] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 3 ms to minimize.
[2024-05-22 00:51:51] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:51:52] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:51:52] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:51:52] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/284 constraints. Problems are: Problem set: 22 solved, 446 unsolved
[2024-05-22 00:51:52] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:51:52] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:51:53] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:51:53] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:51:53] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:51:53] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:51:53] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:51:53] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:51:53] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:51:54] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:51:54] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:51:54] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:51:54] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:51:54] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:51:54] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:51:54] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:51:54] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:51:55] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:51:55] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:51:55] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/304 constraints. Problems are: Problem set: 30 solved, 438 unsolved
[2024-05-22 00:51:56] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:51:56] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:51:56] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:51:56] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:51:57] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:51:57] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:51:57] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:51:57] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:51:57] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:51:58] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:51:58] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:51:58] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:51:58] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:51:58] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:51:58] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:51:59] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:51:59] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:51:59] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:51:59] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:51:59] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
Problem TDEAD442 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 20/324 constraints. Problems are: Problem set: 31 solved, 437 unsolved
[2024-05-22 00:52:00] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:52:00] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:52:00] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:52:00] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:52:01] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:52:01] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:52:01] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:52:01] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:52:01] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:52:01] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:52:01] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:52:02] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:52:02] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:52:02] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:52:02] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:52:02] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:52:02] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:52:02] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:52:02] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:52:03] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 20/344 constraints. Problems are: Problem set: 31 solved, 437 unsolved
[2024-05-22 00:52:03] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:52:03] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:52:04] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:52:04] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:52:04] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:52:04] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:52:04] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:52:04] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:52:04] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:52:05] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:52:05] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:52:05] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:52:05] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:52:05] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:52:05] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:52:06] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:52:06] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:52:06] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:52:06] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:52:06] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
Problem TDEAD444 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 20/364 constraints. Problems are: Problem set: 32 solved, 436 unsolved
[2024-05-22 00:52:07] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1009 variables, and 365 constraints, problems are : Problem set: 32 solved, 436 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/540 constraints, PredecessorRefiner: 0/468 constraints, Known Traps: 258/258 constraints]
After SMT, in 60108ms problems are : Problem set: 32 solved, 436 unsolved
Search for dead transitions found 32 dead transitions in 60113ms
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 : 540/551 places, 437/480 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 537 transition count 437
Applied a total of 3 rules in 11 ms. Remains 537 /540 variables (removed 3) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 537 cols
[2024-05-22 00:52:08] [INFO ] Computed 113 invariants in 4 ms
[2024-05-22 00:52:08] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-22 00:52:08] [INFO ] Invariant cache hit.
[2024-05-22 00:52:08] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 537/551 places, 437/480 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61648 ms. Remains : 537/551 places, 437/480 transitions.
Stuttering acceptance computed with spot in 157 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 61827 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 39 ms. Remains 540 /551 variables (removed 11) and now considering 469/480 (removed 11) transitions.
// Phase 1: matrix 469 rows 540 cols
[2024-05-22 00:52:08] [INFO ] Computed 107 invariants in 7 ms
[2024-05-22 00:52:09] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-22 00:52:09] [INFO ] Invariant cache hit.
[2024-05-22 00:52:09] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2024-05-22 00:52:09] [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-05-22 00:52:21] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:52:21] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:52:21] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:52:22] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:52:22] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:52:22] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:52:22] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:52:22] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:52:22] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:52:22] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:52:22] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:52:23] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:52:23] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:52:23] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:52:23] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:52:23] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:52:23] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:52:23] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:52:23] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:52:23] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 468 unsolved
[2024-05-22 00:52:24] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:52:24] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:52:24] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:52:24] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:52:24] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:52:24] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:52:24] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:52:24] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:52:24] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:52:24] [INFO ] Deduced a trap composed of 92 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:52:25] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:52:25] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:52:25] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:52:25] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:52:25] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:52:25] [INFO ] Deduced a trap composed of 89 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:52:25] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:52:25] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:52:25] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:52:25] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 2 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-05-22 00:52:26] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:52:26] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:52:26] [INFO ] Deduced a trap composed of 119 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:52:26] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:52:26] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:52:26] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:52:26] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:52:26] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:52:27] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:52:27] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:52:27] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:52:27] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:52:27] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:52:27] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:52:27] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:52:27] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:52:27] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:52:27] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:52:28] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:52:28] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 2 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-05-22 00:52:31] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:52:31] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:52:31] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:52:31] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:52:31] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:52:31] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:52:32] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:52:32] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:52:32] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:52:32] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:52:32] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:52:32] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:52:32] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:52:32] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:52:32] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:52:33] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:52:33] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:52:33] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:52:33] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:52:33] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 2 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-05-22 00:52:33] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:52:33] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:52:33] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:52:34] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:52:34] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:52:34] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:52:34] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:52:34] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:52:34] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:52:34] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:52:34] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:52:34] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:52:35] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:52:35] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:52:35] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:52:35] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:52:35] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:52:35] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:52:35] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:52:35] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/207 constraints. Problems are: Problem set: 8 solved, 460 unsolved
[2024-05-22 00:52:36] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:52:36] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:52:36] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:52:36] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:52:36] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:52:36] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:52:36] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:52:36] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:52:37] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:52:37] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:52:37] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:52:37] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:52:37] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:52:37] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:52:37] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:52:37] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:52:38] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:52:38] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:52:38] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:52:38] [INFO ] Deduced a trap composed of 106 places in 88 ms of which 2 ms to minimize.
Problem TDEAD431 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 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/540 variables, 20/227 constraints. Problems are: Problem set: 11 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1009 variables, and 227 constraints, problems are : Problem set: 11 solved, 457 unsolved in 30013 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: 11 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 41/41 constraints. Problems are: Problem set: 11 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/41 constraints. Problems are: Problem set: 11 solved, 457 unsolved
At refinement iteration 2 (OVERLAPS) 1/540 variables, 65/106 constraints. Problems are: Problem set: 11 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/540 variables, 1/107 constraints. Problems are: Problem set: 11 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 120/227 constraints. Problems are: Problem set: 11 solved, 457 unsolved
[2024-05-22 00:52:44] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:52:44] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:52:44] [INFO ] Deduced a trap composed of 129 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:52:44] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:52:44] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:52:44] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:52:44] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:52:44] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:52:44] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:52:45] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:52:45] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:52:45] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:52:45] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:52:45] [INFO ] Deduced a trap composed of 112 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:52:45] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:52:45] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:52:45] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:52:46] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:52:46] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:52:46] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
Problem TDEAD420 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/247 constraints. Problems are: Problem set: 21 solved, 447 unsolved
[2024-05-22 00:52:46] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:52:46] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:52:47] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:52:47] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:52:47] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:52:47] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:52:47] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:52:47] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:52:47] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:52:47] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:52:48] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:52:48] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:52:48] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:52:48] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:52:48] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:52:48] [INFO ] Deduced a trap composed of 116 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:52:48] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:52:49] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:52:49] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:52:49] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 20/267 constraints. Problems are: Problem set: 21 solved, 447 unsolved
[2024-05-22 00:52:49] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:52:50] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:52:50] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:52:50] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:52:50] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:52:50] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:52:50] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:52:51] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:52:51] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:52:51] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:52:51] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:52:51] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:52:51] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:52:51] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:52:52] [INFO ] Deduced a trap composed of 96 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:52:52] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:52:52] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:52:52] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:52:52] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:52:52] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
Problem TDEAD448 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 20/287 constraints. Problems are: Problem set: 25 solved, 443 unsolved
[2024-05-22 00:52:53] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:52:53] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:52:53] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:52:53] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:52:53] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:52:53] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:52:54] [INFO ] Deduced a trap composed of 92 places in 174 ms of which 4 ms to minimize.
[2024-05-22 00:52:54] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:52:54] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:52:54] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:52:54] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:52:54] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:52:55] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:52:55] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:52:55] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:52:55] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:52:55] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:52:55] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:52:55] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:52:55] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
Problem TDEAD439 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 20/307 constraints. Problems are: Problem set: 26 solved, 442 unsolved
[2024-05-22 00:52:56] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:52:56] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:52:56] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:52:56] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:52:56] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:52:56] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:52:57] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:52:57] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:52:57] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:52:57] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:52:57] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:52:57] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:52:57] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:52:57] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:52:58] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:52:58] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:52:58] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:52:58] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:52:58] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:52:58] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
Problem TDEAD444 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 20/327 constraints. Problems are: Problem set: 27 solved, 441 unsolved
[2024-05-22 00:52:59] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:52:59] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:52:59] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:52:59] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:53:00] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:53:00] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:53:00] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:53:00] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:53:00] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:53:00] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:53:01] [INFO ] Deduced a trap composed of 87 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:53:01] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:53:01] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:53:01] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:53:01] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:53:01] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:53:01] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:53:01] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:53:01] [INFO ] Deduced a trap composed of 59 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:53:02] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 20/347 constraints. Problems are: Problem set: 27 solved, 441 unsolved
[2024-05-22 00:53:03] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:53:03] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:53:03] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:53:03] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:53:03] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:53:03] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:53:04] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:53:04] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:53:04] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:53:04] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:53:04] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:53:04] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:53:05] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:53:05] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:53:05] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:53:05] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:53:05] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:53:05] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:53:05] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:53:05] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 20/367 constraints. Problems are: Problem set: 27 solved, 441 unsolved
[2024-05-22 00:53:06] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:53:07] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:53:07] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:53:07] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:53:07] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:53:07] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:53:07] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:53:08] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:53:08] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:53:08] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:53:08] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:53:08] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:53:08] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:53:08] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:53:08] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:53:09] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:53:09] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:53:09] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:53:09] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:53:09] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 20/387 constraints. Problems are: Problem set: 27 solved, 441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1009 variables, and 387 constraints, problems are : Problem set: 27 solved, 441 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/540 constraints, PredecessorRefiner: 0/468 constraints, Known Traps: 280/280 constraints]
After SMT, in 60112ms problems are : Problem set: 27 solved, 441 unsolved
Search for dead transitions found 27 dead transitions in 60117ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 540/551 places, 442/480 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 539 transition count 442
Applied a total of 1 rules in 12 ms. Remains 539 /540 variables (removed 1) and now considering 442/442 (removed 0) transitions.
// Phase 1: matrix 442 rows 539 cols
[2024-05-22 00:53:09] [INFO ] Computed 110 invariants in 4 ms
[2024-05-22 00:53:10] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-22 00:53:10] [INFO ] Invariant cache hit.
[2024-05-22 00:53:10] [INFO ] Implicit Places using invariants and state equation in 426 ms returned [60, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 628 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 537/551 places, 442/480 transitions.
Applied a total of 0 rules in 8 ms. Remains 537 /537 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61543 ms. Remains : 537/551 places, 442/480 transitions.
Stuttering acceptance computed with spot in 257 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 423 steps with 1 reset in 2 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-12 finished in 61824 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 30 ms. Remains 539 /551 variables (removed 12) and now considering 468/480 (removed 12) transitions.
// Phase 1: matrix 468 rows 539 cols
[2024-05-22 00:53:10] [INFO ] Computed 107 invariants in 6 ms
[2024-05-22 00:53:11] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 00:53:11] [INFO ] Invariant cache hit.
[2024-05-22 00:53:11] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-05-22 00:53:11] [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-05-22 00:53:23] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:53:23] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:53:23] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:53:23] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:53:23] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:53:23] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:53:23] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:53:23] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:53:23] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:53:24] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:53:24] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:53:24] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:53:24] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:53:24] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:53:24] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:53:24] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:53:24] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:53:24] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:53:25] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:53:25] [INFO ] Deduced a trap composed of 93 places in 92 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-05-22 00:53:25] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:53:25] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:53:25] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:53:25] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:53:25] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:53:25] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:53:25] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:53:26] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:53:26] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:53:26] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:53:26] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:53:26] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:53:26] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:53:26] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:53:26] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:53:26] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:53:26] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:53:26] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:53:27] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:53:27] [INFO ] Deduced a trap composed of 89 places in 79 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-05-22 00:53:27] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:53:27] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:53:27] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:53:27] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:53:27] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:53:27] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:53:27] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:53:28] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:53:28] [INFO ] Deduced a trap composed of 93 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:53:28] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:53:28] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:53:28] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:53:28] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:53:28] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:53:28] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:53:28] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:53:28] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:53:29] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:53:29] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:53:29] [INFO ] Deduced a trap composed of 79 places in 135 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-05-22 00:53:33] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:53:33] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:53:33] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:53:33] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:53:33] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:53:34] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:53:34] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:53:34] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:53:34] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:53:34] [INFO ] Deduced a trap composed of 126 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:53:34] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:53:34] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:53:34] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:53:35] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:53:35] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:53:35] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:53:35] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:53:35] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:53:35] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:53:35] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 3 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-05-22 00:53:36] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:53:36] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:53:36] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:53:36] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:53:36] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:53:36] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:53:37] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:53:37] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:53:37] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:53:37] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:53:37] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:53:37] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:53:37] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:53:37] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:53:38] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:53:38] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:53:38] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:53:38] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:53:38] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:53:38] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 20/207 constraints. Problems are: Problem set: 25 solved, 442 unsolved
[2024-05-22 00:53:39] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:53:39] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:53:39] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:53:39] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:53:39] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:53:39] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:53:40] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:53:40] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:53:40] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:53:40] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:53:40] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:53:40] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:53:40] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:53:41] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:53:41] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:53:41] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:53:41] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:53:41] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:53:41] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:53:41] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 2 ms to minimize.
SMT process timed out in 30156ms, After SMT, problems are : Problem set: 25 solved, 442 unsolved
Search for dead transitions found 25 dead transitions in 30161ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 539/551 places, 443/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 443
Applied a total of 1 rules in 8 ms. Remains 538 /539 variables (removed 1) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 538 cols
[2024-05-22 00:53:41] [INFO ] Computed 111 invariants in 3 ms
[2024-05-22 00:53:41] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-22 00:53:41] [INFO ] Invariant cache hit.
[2024-05-22 00:53:42] [INFO ] Implicit Places using invariants and state equation in 351 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 488 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 537/551 places, 443/480 transitions.
Applied a total of 0 rules in 7 ms. Remains 537 /537 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31456 ms. Remains : 537/551 places, 443/480 transitions.
Stuttering acceptance computed with spot in 126 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 505 reset in 185 ms.
Product exploration explored 100000 steps with 508 reset in 206 ms.
Computed a total of 469 stabilizing places and 385 stable transitions
Graph (complete) has 1144 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 469 stabilizing places and 385 stable transitions
Detected a total of 469/537 stabilizing places and 385/443 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (198 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 337 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (33 resets) in 419 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (36 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 112 ms. (354 steps per ms) remains 1/4 properties
// Phase 1: matrix 443 rows 537 cols
[2024-05-22 00:53:43] [INFO ] Computed 110 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 280/404 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:53:43] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:53:43] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:53:43] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:53:43] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:53:44] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:53:44] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:53:44] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:53:44] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:53:44] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 126/530 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 438/968 variables, 530/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:53:44] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:53:44] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/968 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/979 variables, 6/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:53:44] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/979 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/979 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/980 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/980 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/980 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 659 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1390 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 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) 121/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 280/404 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:53:45] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:53:45] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:53:45] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:53:45] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:53:45] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:53:45] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:53:45] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:53:45] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:53:45] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 3 ms to minimize.
[2024-05-22 00:53:45] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:53:45] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 11/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 126/530 variables, 45/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:53:46] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 438/968 variables, 530/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/968 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:53:46] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/968 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/968 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/979 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/979 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:53:46] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:53:46] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/979 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/979 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/980 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/980 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/980 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 980/980 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints]
After SMT, in 3197ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16028 steps, including 109 resets, run visited all 1 properties in 71 ms. (steps per millisecond=225 )
Parikh walk visited 1 properties in 88 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 361 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[false, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 443/443 transitions.
Graph (trivial) has 251 edges and 537 vertex of which 6 / 537 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1138 edges and 532 vertex of which 530 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 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 367
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 462 transition count 367
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 136 place count 462 transition count 256
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 380 place count 329 transition count 256
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 290 rules applied. Total rules applied 670 place count 180 transition count 115
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 674 place count 178 transition count 122
Applied a total of 674 rules in 49 ms. Remains 178 /537 variables (removed 359) and now considering 122/443 (removed 321) transitions.
[2024-05-22 00:53:47] [INFO ] Flow matrix only has 121 transitions (discarded 1 similar events)
// Phase 1: matrix 121 rows 178 cols
[2024-05-22 00:53:47] [INFO ] Computed 80 invariants in 2 ms
[2024-05-22 00:53:47] [INFO ] Implicit Places using invariants in 146 ms returned [23, 24, 25, 26, 27, 32, 33, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 155 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/537 places, 122/443 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 154/537 places, 122/443 transitions.
Computed a total of 81 stabilizing places and 70 stable transitions
Computed a total of 81 stabilizing places and 70 stable transitions
Detected a total of 81/154 stabilizing places and 70/122 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 288 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 33741 steps (5069 resets) in 885 ms. (38 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 505 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13444 reset in 391 ms.
Product exploration explored 100000 steps with 13539 reset in 317 ms.
Built C files in :
/tmp/ltsmin12681091207599026546
[2024-05-22 00:53:49] [INFO ] Computing symmetric may disable matrix : 122 transitions.
[2024-05-22 00:53:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:53:49] [INFO ] Computing symmetric may enable matrix : 122 transitions.
[2024-05-22 00:53:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:53:49] [INFO ] Computing Do-Not-Accords matrix : 122 transitions.
[2024-05-22 00:53:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:53:49] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12681091207599026546
Running compilation step : cd /tmp/ltsmin12681091207599026546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 436 ms.
Running link step : cd /tmp/ltsmin12681091207599026546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin12681091207599026546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11354557820403351281.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 154 /154 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-22 00:54:04] [INFO ] Flow matrix only has 121 transitions (discarded 1 similar events)
// Phase 1: matrix 121 rows 154 cols
[2024-05-22 00:54:04] [INFO ] Computed 56 invariants in 1 ms
[2024-05-22 00:54:04] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 00:54:04] [INFO ] Flow matrix only has 121 transitions (discarded 1 similar events)
[2024-05-22 00:54:04] [INFO ] Invariant cache hit.
[2024-05-22 00:54:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:54:05] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [6, 40, 42, 44, 53, 87, 89, 91, 93, 95, 97, 99, 134]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 256 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/154 places, 122/122 transitions.
Graph (complete) has 447 edges and 141 vertex of which 132 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 132 transition count 114
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 128 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 126 transition count 111
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 126 transition count 111
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 126 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 125 transition count 110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 124 transition count 109
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 124 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 19 place count 124 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 20 place count 123 transition count 107
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 26 place count 120 transition count 104
Applied a total of 26 rules in 9 ms. Remains 120 /141 variables (removed 21) and now considering 104/122 (removed 18) transitions.
[2024-05-22 00:54:05] [INFO ] Flow matrix only has 103 transitions (discarded 1 similar events)
// Phase 1: matrix 103 rows 120 cols
[2024-05-22 00:54:05] [INFO ] Computed 38 invariants in 1 ms
[2024-05-22 00:54:05] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 00:54:05] [INFO ] Flow matrix only has 103 transitions (discarded 1 similar events)
[2024-05-22 00:54:05] [INFO ] Invariant cache hit.
[2024-05-22 00:54:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:54:05] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 187 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/154 places, 104/122 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 117 transition count 102
Applied a total of 4 rules in 4 ms. Remains 117 /119 variables (removed 2) and now considering 102/104 (removed 2) transitions.
[2024-05-22 00:54:05] [INFO ] Flow matrix only has 101 transitions (discarded 1 similar events)
// Phase 1: matrix 101 rows 117 cols
[2024-05-22 00:54:05] [INFO ] Computed 37 invariants in 0 ms
[2024-05-22 00:54:05] [INFO ] Implicit Places using invariants in 52 ms returned [101, 112]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 115/154 places, 102/122 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 101
Applied a total of 2 rules in 3 ms. Remains 114 /115 variables (removed 1) and now considering 101/102 (removed 1) transitions.
[2024-05-22 00:54:05] [INFO ] Flow matrix only has 100 transitions (discarded 1 similar events)
// Phase 1: matrix 100 rows 114 cols
[2024-05-22 00:54:05] [INFO ] Computed 35 invariants in 1 ms
[2024-05-22 00:54:05] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 00:54:05] [INFO ] Flow matrix only has 100 transitions (discarded 1 similar events)
[2024-05-22 00:54:05] [INFO ] Invariant cache hit.
[2024-05-22 00:54:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:54:05] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 114/154 places, 101/122 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 705 ms. Remains : 114/154 places, 101/122 transitions.
Built C files in :
/tmp/ltsmin5748143421664582344
[2024-05-22 00:54:05] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-22 00:54:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:54:05] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-22 00:54:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:54:05] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-22 00:54:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:54:05] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5748143421664582344
Running compilation step : cd /tmp/ltsmin5748143421664582344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 208 ms.
Running link step : cd /tmp/ltsmin5748143421664582344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5748143421664582344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12519683314561092082.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:54:20] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:54:20] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:54:20] [INFO ] Time to serialize gal into /tmp/LTL2214473949557608681.gal : 2 ms
[2024-05-22 00:54:20] [INFO ] Time to serialize properties into /tmp/LTL9848846562295903017.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2214473949557608681.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11075657179738343900.hoa' '-atoms' '/tmp/LTL9848846562295903017.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9848846562295903017.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11075657179738343900.hoa
Detected timeout of ITS tools.
[2024-05-22 00:54:35] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:54:35] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:54:35] [INFO ] Time to serialize gal into /tmp/LTL3234330920083528036.gal : 2 ms
[2024-05-22 00:54:35] [INFO ] Time to serialize properties into /tmp/LTL5959658220889616174.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3234330920083528036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5959658220889616174.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G(("((p105!=1)||(p417!=1))")||(("(p764!=1)")||(X(F("(((p105==1)&&(p417==1))&&(p764==1))"))))))||((F(G("(p63!=1)")))&&(("((p105!=...240
Formula 0 simplified : X(F(!"((p105!=1)||(p417!=1))" & !"(p764!=1)" & XG!"(((p105==1)&&(p417==1))&&(p764==1))") & ((!"((p105!=1)||(p417!=1))" & !"(p764!=1)...218
Detected timeout of ITS tools.
[2024-05-22 00:54:50] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:54:50] [INFO ] Applying decomposition
[2024-05-22 00:54:50] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5108659895963737924.txt' '-o' '/tmp/graph5108659895963737924.bin' '-w' '/tmp/graph5108659895963737924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5108659895963737924.bin' '-l' '-1' '-v' '-w' '/tmp/graph5108659895963737924.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:54:50] [INFO ] Decomposing Gal with order
[2024-05-22 00:54:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:54:50] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-22 00:54:50] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:54:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 15 ms.
[2024-05-22 00:54:50] [INFO ] Time to serialize gal into /tmp/LTL1600673934170451329.gal : 3 ms
[2024-05-22 00:54:50] [INFO ] Time to serialize properties into /tmp/LTL12178369124321312560.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1600673934170451329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12178369124321312560.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G(("((i3.u2.p105!=1)||(i3.u13.p417!=1))")||(("(i3.u41.p764!=1)")||(X(F("(((i3.u2.p105==1)&&(i3.u13.p417==1))&&(i3.u41.p764==1))"...326
Formula 0 simplified : X(F(!"((i3.u2.p105!=1)||(i3.u13.p417!=1))" & !"(i3.u41.p764!=1)" & XG!"(((i3.u2.p105==1)&&(i3.u13.p417==1))&&(i3.u41.p764==1))") & (...304
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-20-LTLFireability-14 finished in 115234 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 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.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 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 411 place count 328 transition count 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 22 ms. Remains 184 /551 variables (removed 367) and now considering 146/480 (removed 334) transitions.
[2024-05-22 00:55:06] [INFO ] Flow matrix only has 145 transitions (discarded 1 similar events)
// Phase 1: matrix 145 rows 184 cols
[2024-05-22 00:55:06] [INFO ] Computed 82 invariants in 1 ms
[2024-05-22 00:55:06] [INFO ] Implicit Places using invariants in 171 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 177 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 202 ms. Remains : 159/551 places, 146/480 transitions.
Stuttering acceptance computed with spot in 24 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 235 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 126 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.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.
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 0 ms
Ensure Unique test removed 20 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 384 place count 342 transition count 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 402 place count 333 transition count 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 30 ms. Remains 187 /551 variables (removed 364) and now considering 148/480 (removed 332) transitions.
[2024-05-22 00:55:06] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 187 cols
[2024-05-22 00:55:06] [INFO ] Computed 83 invariants in 2 ms
[2024-05-22 00:55:06] [INFO ] Implicit Places using invariants in 132 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 145 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 3 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 178 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 16925 reset in 186 ms.
Product exploration explored 100000 steps with 16874 reset in 199 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 73 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 80 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 (6857 resets) in 682 ms. (58 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1690 resets) in 131 ms. (303 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (1669 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
[2024-05-22 00:55:07] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 162 cols
[2024-05-22 00:55:07] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 00:55:07] [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 91 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 91 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 187ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
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 202 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 92 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 131 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 1 ms. Remains 162 /162 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 00:55:08] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
[2024-05-22 00:55:08] [INFO ] Invariant cache hit.
[2024-05-22 00:55:08] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-22 00:55:08] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
[2024-05-22 00:55:08] [INFO ] Invariant cache hit.
[2024-05-22 00:55:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 00:55:08] [INFO ] Implicit Places using invariants and state equation in 157 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 264 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 3 ms. Remains 145 /149 variables (removed 4) and now considering 143/148 (removed 5) transitions.
[2024-05-22 00:55:08] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
// Phase 1: matrix 142 rows 145 cols
[2024-05-22 00:55:08] [INFO ] Computed 45 invariants in 5 ms
[2024-05-22 00:55:08] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 00:55:08] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
[2024-05-22 00:55:08] [INFO ] Invariant cache hit.
[2024-05-22 00:55:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 00:55:08] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 193 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 461 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 90 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 111 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 (6900 resets) in 877 ms. (45 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (1719 resets) in 58 ms. (678 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (1733 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1678 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1759 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
[2024-05-22 00:55:09] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
[2024-05-22 00:55:09] [INFO ] Invariant cache hit.
[2024-05-22 00:55:09] [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 140 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-05-22 00:55:09] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 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-05-22 00:55:09] [INFO ] Deduced a trap composed of 40 places in 39 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 278 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 422ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 59 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=59 )
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 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 315 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 140 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 118 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 121 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 16886 reset in 153 ms.
Product exploration explored 100000 steps with 16903 reset in 166 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 140 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.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 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 1 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 11 ms. Remains 129 /145 variables (removed 16) and now considering 112/143 (removed 31) transitions.
[2024-05-22 00:55:11] [INFO ] Redundant transitions in 1 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-22 00:55:11] [INFO ] Flow matrix only has 111 transitions (discarded 1 similar events)
// Phase 1: matrix 111 rows 129 cols
[2024-05-22 00:55:11] [INFO ] Computed 40 invariants in 1 ms
[2024-05-22 00:55:11] [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-05-22 00:55:12] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 30 places in 40 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-05-22 00:55:12] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 32 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:55:12] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 33 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 20/80 constraints. Problems are: Problem set: 2 solved, 103 unsolved
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:55:13] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:55:14] [INFO ] Deduced a trap composed of 31 places in 36 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-05-22 00:55:14] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 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-05-22 00:55:15] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 1/236 constraints. Problems are: Problem set: 12 solved, 93 unsolved
[2024-05-22 00:55:16] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:55:16] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:55:17] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:55:17] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:55:17] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:55:17] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:55:17] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:55:17] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 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 7123 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-05-22 00:55:18] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:55:18] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:55:18] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:55:18] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:55:18] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:55:18] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:55:18] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:55:19] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:55:19] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:55:19] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:55:19] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:55:19] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:55:19] [INFO ] Deduced a trap composed of 35 places in 40 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-05-22 00:55:21] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 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-05-22 00:55:25] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:55:25] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:55:25] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:55:25] [INFO ] Deduced a trap composed of 29 places in 57 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 15327 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 22532ms problems are : Problem set: 12 solved, 93 unsolved
Search for dead transitions found 12 dead transitions in 22534ms
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 2 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 22556 ms. Remains : 121/145 places, 100/143 transitions.
Built C files in :
/tmp/ltsmin783695156409758786
[2024-05-22 00:55:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin783695156409758786
Running compilation step : cd /tmp/ltsmin783695156409758786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 411 ms.
Running link step : cd /tmp/ltsmin783695156409758786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin783695156409758786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12242909554173429009.hoa' '--buchi-type=spotba'
LTSmin run took 1191 ms.
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 28984 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X((p1||X(p1))) U ((p2&&X((p1||X(p1))))||X(G((p1||X(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||X(F(p0))))||((!p0||X(F(p0)))&&F(G(p1))))))'
[2024-05-22 00:55:35] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16203198234154445738
[2024-05-22 00:55:35] [INFO ] Computing symmetric may disable matrix : 480 transitions.
[2024-05-22 00:55:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:55:35] [INFO ] Computing symmetric may enable matrix : 480 transitions.
[2024-05-22 00:55:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:55:35] [INFO ] Applying decomposition
[2024-05-22 00:55:35] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:55:35] [INFO ] Computing Do-Not-Accords matrix : 480 transitions.
[2024-05-22 00:55:35] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:55:35] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16203198234154445738
Running compilation step : cd /tmp/ltsmin16203198234154445738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5522435703338012215.txt' '-o' '/tmp/graph5522435703338012215.bin' '-w' '/tmp/graph5522435703338012215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5522435703338012215.bin' '-l' '-1' '-v' '-w' '/tmp/graph5522435703338012215.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:55:35] [INFO ] Decomposing Gal with order
[2024-05-22 00:55:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:55:35] [INFO ] Removed a total of 262 redundant transitions.
[2024-05-22 00:55:35] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:55:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 00:55:35] [INFO ] Time to serialize gal into /tmp/LTLFireability2146961670538877712.gal : 18 ms
[2024-05-22 00:55:35] [INFO ] Time to serialize properties into /tmp/LTLFireability15448208611587546675.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2146961670538877712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15448208611587546675.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G((X("((i0.i0.u155.p564==0)||(i5.i1.u196.p766==0))"))||(F(("(i0.i0.u155.p564!=1)")&&(X(("(i0.i0.u155.p564!=1)")U(("(i5.i1.u34.p75!=...196
Formula 0 simplified : F(X!"((i0.i0.u155.p564==0)||(i5.i1.u196.p766==0))" & G(!"(i0.i0.u155.p564!=1)" | X(!"(i0.i0.u155.p564!=1)" M !"(i5.i1.u34.p75!=1)"))...156
Compilation finished in 1147 ms.
Running link step : cd /tmp/ltsmin16203198234154445738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16203198234154445738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||<>(((LTLAPp1==true)&&X(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t215, t306, t324, t369, t383, t385, t386, t388, t390, t392, t393, t394, t397,...1629
Computing Next relation with stutter on 1.99596e+09 deadlock states
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin16203198234154445738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||<>(((LTLAPp1==true)&&X(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16203198234154445738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp7==true))||(X(((LTLAPp8==true)||X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(((LTLAPp8==true)||X((LTLAPp8==true)))))||X([](((LTLAPp8==true)||X((LTLAPp8==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin16203198234154445738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp7==true))||(X(((LTLAPp8==true)||X((LTLAPp8==true)))) U (((LTLAPp9==true)&&X(((LTLAPp8==true)||X((LTLAPp8==true)))))||X([](((LTLAPp8==true)||X((LTLAPp8==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16203198234154445738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((!(LTLAPp10==true)||X(<>((LTLAPp10==true)))))||((!(LTLAPp10==true)||X(<>((LTLAPp10==true))))&&<>([]((LTLAPp11==true))))))' '--buchi-type=spotba'
LTSmin run took 970 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin16203198234154445738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||<>(((LTLAPp1==true)&&X(((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))))))' '--buchi-type=spotba'
299 unique states visited
299 strongly connected components in search stack
300 transitions explored
299 items max in DFS search stack
64251 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,642.617,6212456,1,0,1.02881e+07,268119,8508,2.33627e+07,375,1.09452e+06,11180610
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-20-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F("(i6.i3.u137.p478==1)"))||((X(("(i14.i0.u169.p670!=1)")||(X("(i14.i0.u169.p670!=1)"))))U((("(i15.i0.u112.p352==1)")&&(X(("(i14.i...274
Formula 1 simplified : G!"(i6.i3.u137.p478==1)" & (X(!"(i14.i0.u169.p670!=1)" & X!"(i14.i0.u169.p670!=1)") R (XF(!"(i14.i0.u169.p670!=1)" & X!"(i14.i0.u169...255
Computing Next relation with stutter on 1.99596e+09 deadlock states
266 unique states visited
0 strongly connected components in search stack
266 transitions explored
134 items max in DFS search stack
206 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,644.685,6250536,1,0,1.03827e+07,268536,8604,2.34326e+07,377,1.09801e+06,11320793
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-20-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((G((!("(((i5.i1.u34.p105==1)&&(i5.i1.u127.p417==1))&&(i5.i2.u195.p764==1))"))||(X(F("(((i5.i1.u34.p105==1)&&(i5.i1.u127.p417==1))...373
Formula 2 simplified : X(F("(((i5.i1.u34.p105==1)&&(i5.i1.u127.p417==1))&&(i5.i2.u195.p764==1))" & XG!"(((i5.i1.u34.p105==1)&&(i5.i1.u127.p417==1))&&(i5.i2...347
Computing Next relation with stutter on 1.99596e+09 deadlock states
Detected timeout of ITS tools.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2842631 ms.

BK_STOP 1716340946367

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600