Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683760400132.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldIIPs-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760400132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 338K May 18 16:43 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 ShieldIIPs-PT-040A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716907102222

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 14:38:23] [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-28 14:38:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 14:38:23] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-05-28 14:38:23] [INFO ] Transformed 1003 places.
[2024-05-28 14:38:23] [INFO ] Transformed 963 transitions.
[2024-05-28 14:38:23] [INFO ] Found NUPN structural information;
[2024-05-28 14:38:23] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-040A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 90 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-28 14:38:23] [INFO ] Computed 361 invariants in 23 ms
[2024-05-28 14:38:24] [INFO ] Implicit Places using invariants in 813 ms returned []
[2024-05-28 14:38:24] [INFO ] Invariant cache hit.
[2024-05-28 14:38:25] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 14:38:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30038 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:39:10] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 8 ms to minimize.
[2024-05-28 14:39:10] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:39:10] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:39:10] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
[2024-05-28 14:39:11] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:39:11] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:39:11] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:39:11] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:39:11] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:39:12] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-28 14:39:12] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-28 14:39:12] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:39:12] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 14:39:13] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 14:39:13] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2024-05-28 14:39:13] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 14:39:13] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:39:14] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:39:14] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 14:39:14] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:39:17] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-28 14:39:17] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:39:18] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:39:19] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:39:19] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:39:19] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:39:20] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-28 14:39:20] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:39:20] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:39:21] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 3 ms to minimize.
[2024-05-28 14:39:21] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-05-28 14:39:22] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 4 ms to minimize.
[2024-05-28 14:39:22] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:39:22] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 4 ms to minimize.
[2024-05-28 14:39:23] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 3 ms to minimize.
[2024-05-28 14:39:23] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
[2024-05-28 14:39:24] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30017 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60513ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Finished structural reductions in LTL mode , in 1 iterations and 62651 ms. Remains : 1003/1003 places, 963/963 transitions.
Support contains 57 out of 1003 places after structural reductions.
[2024-05-28 14:39:26] [INFO ] Flatten gal took : 170 ms
[2024-05-28 14:39:26] [INFO ] Flatten gal took : 84 ms
[2024-05-28 14:39:27] [INFO ] Input system was already deterministic with 963 transitions.
Support contains 53 out of 1003 places (down from 57) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (16 resets) in 2464 ms. (16 steps per ms) remains 0/26 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 24 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-28 14:39:28] [INFO ] Invariant cache hit.
[2024-05-28 14:39:28] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-28 14:39:28] [INFO ] Invariant cache hit.
[2024-05-28 14:39:29] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 14:39:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:40:14] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
[2024-05-28 14:40:14] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:40:14] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:40:14] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:40:14] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:40:15] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:40:15] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:40:15] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:40:15] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:40:15] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 14:40:16] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:40:16] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:40:16] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 14:40:16] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 14:40:16] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 14:40:17] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 14:40:17] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:40:17] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:40:17] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:40:18] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:40:21] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:40:21] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-28 14:40:21] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-28 14:40:22] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:40:22] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 3 ms to minimize.
[2024-05-28 14:40:22] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-28 14:40:22] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-05-28 14:40:23] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 2 ms to minimize.
[2024-05-28 14:40:23] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-05-28 14:40:24] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2024-05-28 14:40:24] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:40:24] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-28 14:40:25] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-28 14:40:25] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:40:25] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:40:26] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 4 ms to minimize.
[2024-05-28 14:40:26] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:40:27] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 4 ms to minimize.
[2024-05-28 14:40:27] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 1)
(s361 0)
(s362 1)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 1)
(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 1)
(s410 1)
(s411 0)
(s412 1)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 1)
(s436 0)
(s437 1)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 1)
(s460 1)
(s461 0)
(s462 1)
(s463 0)
(s464 1)
(s465 0)
(s466 0)
(s467 0)
(s468 1)
(s469 0)
(s470 1)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 1)
(s486 0)
(s487 1)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 1)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 1)
(s502 0)
(s503 1)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 1)
(s510 1)
(s511 0)
(s512 1)
(s513 0)
(s514 1)
(s515 0)
(s516 0)
(s517 0)
(s518 1)
(s519 0)
(s520 1)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 1)
(s536 0)
(s537 1)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 1)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 1)
(s554 0)
(s555 0)
(s556 0)
(s557 1)
(s558 0)
(s559 1)
(s560 1)
(s561 0)
(s562 1)
(s563 0)
(s564 1)
(s565 0)
(s566 0)
(s567 0)
(s568 1)
(s569 0)
(s570 1)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 1)
(s577 0)
(s578 1)
(s579 0)
(s580 0)
(s581 0)
(s582 1)
(s583 0)
(s584 1)
(s585 1)
(s586 0)
(s587 1)
(s588 0)
(s589 1)
(s590 0)
(s591 0)
(s592 0)
(s593 1)
(s594 0)
(s595 1)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 1)
(s602 0)
(s603 1)
(s604 0)
(s605 0)
(s606 0)
(s607 1)
(s608 0)
(s609 1)
(s610 1)
(s611 0)
(s612 1)
(s613 0)
(s614 1)
(s615 0)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 1)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 1)
(s627 0)
(s628 1)
(s629 0)
(s630 0)
(s631 0)
(s632 1)
(s633 0)
(s634 1)
(s635 1)
(s636 0)
(s637 1)
(s638 0)
(s639 1)
(s640 0)
(s641 0)
(s642 0)
(s643 1)
(s644 0)
(s645 1)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 1)
(s652 0)
(s653 1)
(s654 0)
(s655 0)
(s656 0)
(s657 1)
(s658 0)
(s659 1)
(s660 1)
(s661 0)
(s662 1)
(s663 0)
(s664 1)
(s665 0)
(s666 0)
(s667 0)
(s668 1)
(s669 0)
(s670 1)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 1)
(s677 0)
(s678 1)
(s679 0)
(s680 0)
(s681 0)
(s682 1)
(s683 0)
(s684 1)
(s685 1)
(s686 0)
(s687 1)
(s688 0)
(s689 1)
(s690 0)
(s691 0)
(s692 0)
(s693 1)
(s694 0)
(s695 1)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 1)
(s702 0)
(s703 1)
(s704 0)
(s705 0)
(s706 0)
(s707 1)
(s708 0)
(s709 1)
(s710 1)
(s711 0)
(s712 1)
(s713 0)
(s714 1)
(s715 0)
(s716 0)
(s717 0)
(s718 1)
(s719 0)
(s720 1)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 1)
(s727 0)
(s728 1)
(s729 0)
(s730 0)
(s731 0)
(s732 1)
(s733 0)
(s734 1)
(s735 1)
(s736 0)
(s737 1)
(s738 0)
(s739 1)
(s740 0)
(s741 0)
(s742 0)
(s743 1)
(s744 0)
(s745 1)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 1)
(s752 0)
(s753 1)
(s754 0)
(s755 0)
(s756 0)
(s757 1)
(s758 0)
(s759 1)
(s760 1)
(s761 0)
(s762 1)
(s763 0)
(s764 1)
(s765 0)
(s766 0)
(s767 0)
(s768 1)
(s769 0)
(s770 1)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 1)
(s777 0)
(s778 1)
(s779 0)
(s780 0)
(s781 0)
(s782 1)
(s783 0)
(s784 1)
(s785 1)
(s786 0)
(s787 1)
(s788 0)
(s789 1)
(s790 0)
(s791 0)
(s792 0)
(s793 1)
(s794 0)
(s795 1)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 1)
(s802 0)
(s803 1)
(s804 0)
(s805 0)
(s806 0)
(s807 1)
(s808 0)
(s809 1)
(s810 1)
(s811 0)
(s812 1)
(s813 0)
(s814 1)
(s815 0)
(s816 0)
(s817 0)
(s818 1)
(s819 0)
(s820 1)
(s821 0)
(s822 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30025 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60337ms
Finished structural reductions in LTL mode , in 1 iterations and 61990 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-00
Stuttering criterion allowed to conclude after 22956 steps with 16 reset in 238 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-00 finished in 62532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 13 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-28 14:40:30] [INFO ] Invariant cache hit.
[2024-05-28 14:40:31] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-28 14:40:31] [INFO ] Invariant cache hit.
[2024-05-28 14:40:32] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 14:40:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30022 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:41:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:41:16] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:41:16] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 14:41:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:41:17] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:41:17] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:41:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:41:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:41:17] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:41:18] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-28 14:41:18] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:41:18] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-28 14:41:18] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:41:19] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 14:41:19] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 14:41:19] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 14:41:19] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 3 ms to minimize.
[2024-05-28 14:41:19] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 14:41:20] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 14:41:20] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:41:23] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 14:41:23] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:41:24] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:41:24] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-05-28 14:41:24] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:41:24] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-28 14:41:25] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:41:25] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-05-28 14:41:25] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-05-28 14:41:26] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-28 14:41:26] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
[2024-05-28 14:41:26] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-28 14:41:27] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-05-28 14:41:27] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:41:28] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:41:28] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:41:28] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:41:29] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 4 ms to minimize.
[2024-05-28 14:41:29] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30018 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60317ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Finished structural reductions in LTL mode , in 1 iterations and 61852 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-01 finished in 61949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p1 U (p2||G(!p1)))||p0))))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1002 transition count 961
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 999 transition count 960
Applied a total of 5 rules in 118 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2024-05-28 14:41:32] [INFO ] Computed 360 invariants in 4 ms
[2024-05-28 14:41:33] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-05-28 14:41:33] [INFO ] Invariant cache hit.
[2024-05-28 14:41:34] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
[2024-05-28 14:41:34] [INFO ] Redundant transitions in 215 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 958 sub problems to find dead transitions.
// Phase 1: matrix 959 rows 999 cols
[2024-05-28 14:41:34] [INFO ] Computed 360 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:41:48] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 14:41:48] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:41:48] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:41:48] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:41:49] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:41:49] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:41:49] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 14:41:49] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:41:49] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-28 14:41:50] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-28 14:41:51] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-28 14:41:51] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-28 14:41:51] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-28 14:41:51] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:41:52] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-28 14:41:52] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:41:55] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 14:41:55] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 14:41:55] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:41:56] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-28 14:41:56] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 3 ms to minimize.
[2024-05-28 14:41:56] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 3 ms to minimize.
[2024-05-28 14:41:57] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-28 14:41:57] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 3 ms to minimize.
[2024-05-28 14:41:57] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:41:58] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-05-28 14:41:58] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-05-28 14:41:58] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 2 ms to minimize.
[2024-05-28 14:41:59] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-05-28 14:41:59] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 3 ms to minimize.
[2024-05-28 14:41:59] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:42:00] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:42:00] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:42:01] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
[2024-05-28 14:42:01] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 1398 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30020 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:42:21] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 1/1399 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1958 variables, and 1399 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30015 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 40/40 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 999/1003 places, 959/963 transitions.
Applied a total of 0 rules in 38 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62133 ms. Remains : 999/1003 places, 959/963 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-02
Product exploration explored 100000 steps with 48 reset in 781 ms.
Product exploration explored 100000 steps with 48 reset in 959 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (16 resets) in 1136 ms. (35 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 1/1 properties
[2024-05-28 14:42:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 14/20 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/54 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 70/124 variables, 28/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 28/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/130 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/130 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/134 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/134 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/134 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 96/230 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 44/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/230 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/236 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/236 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/236 variables, 6/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/236 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/240 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/240 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/240 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 84/324 variables, 44/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/324 variables, 40/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/324 variables, 12/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/324 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 6/330 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/330 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/330 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/330 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 95/425 variables, 44/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/425 variables, 44/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/425 variables, 12/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/425 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 6/431 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/431 variables, 6/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/431 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/431 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/435 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/435 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/435 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 67/502 variables, 40/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/502 variables, 36/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/502 variables, 11/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/502 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 4/506 variables, 5/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/506 variables, 4/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/506 variables, 4/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/506 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 50/556 variables, 24/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/556 variables, 24/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/556 variables, 7/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/556 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 3/559 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/559 variables, 3/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/559 variables, 3/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/559 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 2/561 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/561 variables, 2/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/561 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 42/603 variables, 22/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/603 variables, 20/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/603 variables, 6/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/603 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 3/606 variables, 3/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/606 variables, 3/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/606 variables, 3/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/606 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 48/654 variables, 22/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/654 variables, 22/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/654 variables, 6/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/654 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 3/657 variables, 2/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/657 variables, 3/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/657 variables, 3/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/657 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 2/659 variables, 1/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/659 variables, 2/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/659 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 42/701 variables, 22/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/701 variables, 20/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/701 variables, 6/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/701 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 3/704 variables, 3/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/704 variables, 3/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/704 variables, 3/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/704 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 48/752 variables, 22/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/752 variables, 22/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/752 variables, 6/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/752 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 3/755 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/755 variables, 3/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/755 variables, 3/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/755 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 2/757 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/757 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/757 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 42/799 variables, 22/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/799 variables, 20/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/799 variables, 6/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/799 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 3/802 variables, 3/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/802 variables, 3/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/802 variables, 3/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/802 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 48/850 variables, 22/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/850 variables, 22/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/850 variables, 6/1003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/850 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 3/853 variables, 2/1005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/853 variables, 3/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/853 variables, 3/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/853 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 2/855 variables, 1/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/855 variables, 2/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/855 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 42/897 variables, 22/1036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/897 variables, 20/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/897 variables, 6/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/897 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 3/900 variables, 3/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/900 variables, 3/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/900 variables, 3/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/900 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 48/948 variables, 22/1093 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/948 variables, 22/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/948 variables, 6/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/948 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 3/951 variables, 2/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/951 variables, 3/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/951 variables, 3/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/951 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 2/953 variables, 1/1130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/953 variables, 2/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/953 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 42/995 variables, 22/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/995 variables, 20/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/995 variables, 6/1180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/995 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 3/998 variables, 3/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/998 variables, 3/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/998 variables, 3/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/998 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 48/1046 variables, 22/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1046 variables, 22/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1046 variables, 6/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1046 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (OVERLAPS) 3/1049 variables, 2/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1049 variables, 3/1244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1049 variables, 3/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1049 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 2/1051 variables, 1/1248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1051 variables, 2/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1051 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 42/1093 variables, 22/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1093 variables, 20/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1093 variables, 6/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1093 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (OVERLAPS) 3/1096 variables, 3/1301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1096 variables, 3/1304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1096 variables, 3/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1096 variables, 0/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (OVERLAPS) 48/1144 variables, 22/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1144 variables, 22/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1144 variables, 6/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1144 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (OVERLAPS) 3/1147 variables, 2/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1147 variables, 3/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1147 variables, 3/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1147 variables, 0/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (OVERLAPS) 2/1149 variables, 1/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1149 variables, 2/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/1149 variables, 0/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (OVERLAPS) 42/1191 variables, 22/1390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1191 variables, 20/1410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/1191 variables, 6/1416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1191 variables, 0/1416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (OVERLAPS) 3/1194 variables, 3/1419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1194 variables, 3/1422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1194 variables, 3/1425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1194 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (OVERLAPS) 45/1239 variables, 21/1446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1239 variables, 21/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1239 variables, 6/1473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1239 variables, 0/1473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (OVERLAPS) 3/1242 variables, 2/1475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1242 variables, 3/1478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/1242 variables, 3/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1242 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (OVERLAPS) 2/1244 variables, 1/1482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/1244 variables, 2/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1244 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (OVERLAPS) 33/1277 variables, 18/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1277 variables, 16/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1277 variables, 4/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1277 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (OVERLAPS) 3/1280 variables, 3/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1280 variables, 3/1528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/1280 variables, 3/1531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1280 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (OVERLAPS) 22/1302 variables, 12/1543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1302 variables, 12/1555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (INCLUDED_ONLY) 0/1302 variables, 4/1559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1302 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (OVERLAPS) 1/1303 variables, 1/1560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/1303 variables, 1/1561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/1303 variables, 1/1562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/1303 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (OVERLAPS) 2/1305 variables, 1/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1305 variables, 2/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/1305 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (OVERLAPS) 24/1329 variables, 12/1577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1329 variables, 10/1587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/1329 variables, 3/1590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/1329 variables, 0/1590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (OVERLAPS) 2/1331 variables, 1/1591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/1331 variables, 2/1593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/1331 variables, 2/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/1331 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (OVERLAPS) 20/1351 variables, 10/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/1351 variables, 10/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1351 variables, 3/1618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/1351 variables, 0/1618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (OVERLAPS) 1/1352 variables, 1/1619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1352 variables, 1/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1352 variables, 1/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (INCLUDED_ONLY) 0/1352 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (OVERLAPS) 2/1354 variables, 1/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1354 variables, 2/1624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/1354 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (OVERLAPS) 24/1378 variables, 12/1636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1378 variables, 10/1646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/1378 variables, 3/1649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/1378 variables, 0/1649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (OVERLAPS) 2/1380 variables, 1/1650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/1380 variables, 2/1652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1380 variables, 2/1654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/1380 variables, 0/1654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (OVERLAPS) 20/1400 variables, 10/1664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1400 variables, 10/1674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/1400 variables, 3/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/1400 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (OVERLAPS) 1/1401 variables, 1/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1401 variables, 1/1679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/1401 variables, 1/1680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/1401 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (OVERLAPS) 2/1403 variables, 1/1681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/1403 variables, 2/1683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/1403 variables, 0/1683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (OVERLAPS) 24/1427 variables, 12/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (INCLUDED_ONLY) 0/1427 variables, 10/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/1427 variables, 3/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/1427 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (OVERLAPS) 2/1429 variables, 1/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/1429 variables, 2/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/1429 variables, 2/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/1429 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (OVERLAPS) 20/1449 variables, 10/1723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (INCLUDED_ONLY) 0/1449 variables, 10/1733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/1449 variables, 3/1736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/1449 variables, 0/1736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (OVERLAPS) 1/1450 variables, 1/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (INCLUDED_ONLY) 0/1450 variables, 1/1738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/1450 variables, 1/1739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/1450 variables, 0/1739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (OVERLAPS) 2/1452 variables, 1/1740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/1452 variables, 2/1742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/1452 variables, 0/1742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (OVERLAPS) 24/1476 variables, 12/1754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/1476 variables, 10/1764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (INCLUDED_ONLY) 0/1476 variables, 3/1767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/1476 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (OVERLAPS) 2/1478 variables, 1/1768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/1478 variables, 2/1770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (INCLUDED_ONLY) 0/1478 variables, 2/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/1478 variables, 0/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (OVERLAPS) 20/1498 variables, 10/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/1498 variables, 10/1792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/1498 variables, 3/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/1498 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (OVERLAPS) 1/1499 variables, 1/1796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/1499 variables, 1/1797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (INCLUDED_ONLY) 0/1499 variables, 1/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (INCLUDED_ONLY) 0/1499 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (OVERLAPS) 2/1501 variables, 1/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/1501 variables, 2/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (INCLUDED_ONLY) 0/1501 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (OVERLAPS) 24/1525 variables, 12/1813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/1525 variables, 10/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (INCLUDED_ONLY) 0/1525 variables, 3/1826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/1525 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (OVERLAPS) 2/1527 variables, 1/1827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/1527 variables, 2/1829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/1527 variables, 2/1831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (INCLUDED_ONLY) 0/1527 variables, 0/1831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (OVERLAPS) 20/1547 variables, 10/1841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/1547 variables, 10/1851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/1547 variables, 3/1854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (INCLUDED_ONLY) 0/1547 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (OVERLAPS) 1/1548 variables, 1/1855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/1548 variables, 1/1856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (INCLUDED_ONLY) 0/1548 variables, 1/1857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (INCLUDED_ONLY) 0/1548 variables, 0/1857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (OVERLAPS) 2/1550 variables, 1/1858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (INCLUDED_ONLY) 0/1550 variables, 2/1860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/1550 variables, 0/1860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (OVERLAPS) 24/1574 variables, 12/1872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (INCLUDED_ONLY) 0/1574 variables, 10/1882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/1574 variables, 3/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (INCLUDED_ONLY) 0/1574 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (OVERLAPS) 2/1576 variables, 1/1886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/1576 variables, 2/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (INCLUDED_ONLY) 0/1576 variables, 2/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (INCLUDED_ONLY) 0/1576 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (OVERLAPS) 20/1596 variables, 10/1900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (INCLUDED_ONLY) 0/1596 variables, 10/1910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (INCLUDED_ONLY) 0/1596 variables, 3/1913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/1596 variables, 0/1913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (OVERLAPS) 1/1597 variables, 1/1914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (INCLUDED_ONLY) 0/1597 variables, 1/1915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/1597 variables, 1/1916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (INCLUDED_ONLY) 0/1597 variables, 0/1916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (OVERLAPS) 2/1599 variables, 1/1917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/1599 variables, 2/1919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (INCLUDED_ONLY) 0/1599 variables, 0/1919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (OVERLAPS) 24/1623 variables, 12/1931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/1623 variables, 10/1941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (INCLUDED_ONLY) 0/1623 variables, 3/1944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (INCLUDED_ONLY) 0/1623 variables, 0/1944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (OVERLAPS) 2/1625 variables, 1/1945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (INCLUDED_ONLY) 0/1625 variables, 2/1947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (INCLUDED_ONLY) 0/1625 variables, 2/1949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 341 (INCLUDED_ONLY) 0/1625 variables, 0/1949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 342 (OVERLAPS) 20/1645 variables, 10/1959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 343 (INCLUDED_ONLY) 0/1645 variables, 10/1969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/1645 variables, 3/1972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 345 (INCLUDED_ONLY) 0/1645 variables, 0/1972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 346 (OVERLAPS) 1/1646 variables, 1/1973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 347 (INCLUDED_ONLY) 0/1646 variables, 1/1974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 348 (INCLUDED_ONLY) 0/1646 variables, 1/1975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 349 (INCLUDED_ONLY) 0/1646 variables, 0/1975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 350 (OVERLAPS) 2/1648 variables, 1/1976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 351 (INCLUDED_ONLY) 0/1648 variables, 2/1978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 352 (INCLUDED_ONLY) 0/1648 variables, 0/1978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 353 (OVERLAPS) 24/1672 variables, 12/1990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 354 (INCLUDED_ONLY) 0/1672 variables, 10/2000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 355 (INCLUDED_ONLY) 0/1672 variables, 3/2003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 356 (INCLUDED_ONLY) 0/1672 variables, 0/2003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 357 (OVERLAPS) 2/1674 variables, 1/2004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 358 (INCLUDED_ONLY) 0/1674 variables, 2/2006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 359 (INCLUDED_ONLY) 0/1674 variables, 2/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 360 (INCLUDED_ONLY) 0/1674 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 361 (OVERLAPS) 20/1694 variables, 10/2018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 362 (INCLUDED_ONLY) 0/1694 variables, 10/2028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 363 (INCLUDED_ONLY) 0/1694 variables, 3/2031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 364 (INCLUDED_ONLY) 0/1694 variables, 0/2031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 365 (OVERLAPS) 1/1695 variables, 1/2032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 366 (INCLUDED_ONLY) 0/1695 variables, 1/2033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 367 (INCLUDED_ONLY) 0/1695 variables, 1/2034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 368 (INCLUDED_ONLY) 0/1695 variables, 0/2034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 369 (OVERLAPS) 2/1697 variables, 1/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 370 (INCLUDED_ONLY) 0/1697 variables, 2/2037 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 371 (INCLUDED_ONLY) 0/1697 variables, 0/2037 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 372 (OVERLAPS) 24/1721 variables, 12/2049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 373 (INCLUDED_ONLY) 0/1721 variables, 10/2059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 374 (INCLUDED_ONLY) 0/1721 variables, 3/2062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 375 (INCLUDED_ONLY) 0/1721 variables, 0/2062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 376 (OVERLAPS) 2/1723 variables, 1/2063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 377 (INCLUDED_ONLY) 0/1723 variables, 2/2065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 378 (INCLUDED_ONLY) 0/1723 variables, 2/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 379 (INCLUDED_ONLY) 0/1723 variables, 0/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 380 (OVERLAPS) 20/1743 variables, 10/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 381 (INCLUDED_ONLY) 0/1743 variables, 10/2087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 382 (INCLUDED_ONLY) 0/1743 variables, 3/2090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 383 (INCLUDED_ONLY) 0/1743 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 384 (OVERLAPS) 1/1744 variables, 1/2091 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 385 (INCLUDED_ONLY) 0/1744 variables, 1/2092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 386 (INCLUDED_ONLY) 0/1744 variables, 1/2093 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 387 (INCLUDED_ONLY) 0/1744 variables, 0/2093 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 388 (OVERLAPS) 2/1746 variables, 1/2094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 389 (INCLUDED_ONLY) 0/1746 variables, 2/2096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 390 (INCLUDED_ONLY) 0/1746 variables, 0/2096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 391 (OVERLAPS) 24/1770 variables, 12/2108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 392 (INCLUDED_ONLY) 0/1770 variables, 10/2118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 393 (INCLUDED_ONLY) 0/1770 variables, 3/2121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 394 (INCLUDED_ONLY) 0/1770 variables, 0/2121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 395 (OVERLAPS) 2/1772 variables, 1/2122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 396 (INCLUDED_ONLY) 0/1772 variables, 2/2124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 397 (INCLUDED_ONLY) 0/1772 variables, 2/2126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 398 (INCLUDED_ONLY) 0/1772 variables, 0/2126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 399 (OVERLAPS) 20/1792 variables, 10/2136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 400 (INCLUDED_ONLY) 0/1792 variables, 10/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 401 (INCLUDED_ONLY) 0/1792 variables, 3/2149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 402 (INCLUDED_ONLY) 0/1792 variables, 0/2149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 403 (OVERLAPS) 1/1793 variables, 1/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 404 (INCLUDED_ONLY) 0/1793 variables, 1/2151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 405 (INCLUDED_ONLY) 0/1793 variables, 1/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 406 (INCLUDED_ONLY) 0/1793 variables, 0/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 407 (OVERLAPS) 2/1795 variables, 1/2153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 408 (INCLUDED_ONLY) 0/1795 variables, 2/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 409 (INCLUDED_ONLY) 0/1795 variables, 0/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 410 (OVERLAPS) 24/1819 variables, 12/2167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 411 (INCLUDED_ONLY) 0/1819 variables, 10/2177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 412 (INCLUDED_ONLY) 0/1819 variables, 3/2180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 413 (INCLUDED_ONLY) 0/1819 variables, 0/2180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 414 (OVERLAPS) 2/1821 variables, 1/2181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 415 (INCLUDED_ONLY) 0/1821 variables, 2/2183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 416 (INCLUDED_ONLY) 0/1821 variables, 2/2185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 417 (INCLUDED_ONLY) 0/1821 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 418 (OVERLAPS) 20/1841 variables, 10/2195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 419 (INCLUDED_ONLY) 0/1841 variables, 10/2205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 420 (INCLUDED_ONLY) 0/1841 variables, 3/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 421 (INCLUDED_ONLY) 0/1841 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 422 (OVERLAPS) 1/1842 variables, 1/2209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 423 (INCLUDED_ONLY) 0/1842 variables, 1/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 424 (INCLUDED_ONLY) 0/1842 variables, 1/2211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 425 (INCLUDED_ONLY) 0/1842 variables, 0/2211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 426 (OVERLAPS) 2/1844 variables, 1/2212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 427 (INCLUDED_ONLY) 0/1844 variables, 2/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 428 (INCLUDED_ONLY) 0/1844 variables, 0/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 429 (OVERLAPS) 24/1868 variables, 12/2226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 430 (INCLUDED_ONLY) 0/1868 variables, 10/2236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 431 (INCLUDED_ONLY) 0/1868 variables, 3/2239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 432 (INCLUDED_ONLY) 0/1868 variables, 0/2239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 433 (OVERLAPS) 2/1870 variables, 1/2240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 434 (INCLUDED_ONLY) 0/1870 variables, 2/2242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 435 (INCLUDED_ONLY) 0/1870 variables, 2/2244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 436 (INCLUDED_ONLY) 0/1870 variables, 0/2244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 437 (OVERLAPS) 20/1890 variables, 10/2254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 438 (INCLUDED_ONLY) 0/1890 variables, 10/2264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 439 (INCLUDED_ONLY) 0/1890 variables, 3/2267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 440 (INCLUDED_ONLY) 0/1890 variables, 0/2267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 441 (OVERLAPS) 1/1891 variables, 1/2268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 442 (INCLUDED_ONLY) 0/1891 variables, 1/2269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 443 (INCLUDED_ONLY) 0/1891 variables, 1/2270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 444 (INCLUDED_ONLY) 0/1891 variables, 0/2270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 445 (OVERLAPS) 2/1893 variables, 1/2271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 446 (INCLUDED_ONLY) 0/1893 variables, 2/2273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 447 (INCLUDED_ONLY) 0/1893 variables, 0/2273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 448 (OVERLAPS) 24/1917 variables, 12/2285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 449 (INCLUDED_ONLY) 0/1917 variables, 10/2295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 450 (INCLUDED_ONLY) 0/1917 variables, 3/2298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 451 (INCLUDED_ONLY) 0/1917 variables, 0/2298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 452 (OVERLAPS) 2/1919 variables, 1/2299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 453 (INCLUDED_ONLY) 0/1919 variables, 2/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 454 (INCLUDED_ONLY) 0/1919 variables, 2/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 455 (INCLUDED_ONLY) 0/1919 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 456 (OVERLAPS) 20/1939 variables, 10/2313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 457 (INCLUDED_ONLY) 0/1939 variables, 10/2323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 458 (INCLUDED_ONLY) 0/1939 variables, 3/2326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 459 (INCLUDED_ONLY) 0/1939 variables, 0/2326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 460 (OVERLAPS) 1/1940 variables, 1/2327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 461 (INCLUDED_ONLY) 0/1940 variables, 1/2328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 462 (INCLUDED_ONLY) 0/1940 variables, 1/2329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 463 (INCLUDED_ONLY) 0/1940 variables, 0/2329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 464 (OVERLAPS) 2/1942 variables, 1/2330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 465 (INCLUDED_ONLY) 0/1942 variables, 2/2332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 466 (INCLUDED_ONLY) 0/1942 variables, 0/2332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 467 (OVERLAPS) 16/1958 variables, 12/2344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 468 (INCLUDED_ONLY) 0/1958 variables, 10/2354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 469 (INCLUDED_ONLY) 0/1958 variables, 4/2358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 470 (INCLUDED_ONLY) 0/1958 variables, 0/2358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 471 (OVERLAPS) 0/1958 variables, 0/2358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1958/1958 variables, and 2358 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2879 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 999/999 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/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 14/20 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/54 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 70/124 variables, 28/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 28/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/130 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/130 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/130 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/134 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/134 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/134 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/134 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 96/230 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/230 variables, 44/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/230 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/236 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/236 variables, 6/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/236 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/236 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/240 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/240 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/240 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 84/324 variables, 44/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/324 variables, 40/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/324 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/324 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 6/330 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/330 variables, 6/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/330 variables, 6/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/330 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 95/425 variables, 44/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/425 variables, 44/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/425 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/425 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 6/431 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/431 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/431 variables, 6/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/431 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 4/435 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/435 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/435 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 67/502 variables, 40/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/502 variables, 36/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/502 variables, 11/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/502 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 4/506 variables, 5/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/506 variables, 4/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/506 variables, 4/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/506 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 50/556 variables, 24/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/556 variables, 24/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/556 variables, 7/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/556 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 3/559 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/559 variables, 3/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/559 variables, 3/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/559 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 2/561 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/561 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/561 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 42/603 variables, 22/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/603 variables, 20/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/603 variables, 6/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/603 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 3/606 variables, 3/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/606 variables, 3/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/606 variables, 3/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/606 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 48/654 variables, 22/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/654 variables, 22/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/654 variables, 6/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/654 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 3/657 variables, 2/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/657 variables, 3/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/657 variables, 3/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/657 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 2/659 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/659 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/659 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 42/701 variables, 22/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/701 variables, 20/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/701 variables, 6/827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:42:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 14:42:40] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 91 (INCLUDED_ONLY) 0/701 variables, 2/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/701 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 3/704 variables, 3/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/704 variables, 3/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/704 variables, 3/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/704 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 48/752 variables, 22/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/752 variables, 22/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/752 variables, 6/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/752 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 3/755 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/755 variables, 3/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/755 variables, 3/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/755 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 2/757 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/757 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/757 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 42/799 variables, 22/921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/799 variables, 20/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/799 variables, 6/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/799 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 3/802 variables, 3/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/802 variables, 3/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/802 variables, 3/956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/802 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 48/850 variables, 22/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/850 variables, 22/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/850 variables, 6/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/850 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 3/853 variables, 2/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/853 variables, 3/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/853 variables, 3/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/853 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 2/855 variables, 1/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/855 variables, 2/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/855 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 42/897 variables, 22/1039 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/897 variables, 20/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/897 variables, 6/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/897 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 3/900 variables, 3/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/900 variables, 3/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/900 variables, 3/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/900 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 48/948 variables, 22/1096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/948 variables, 22/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/948 variables, 6/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/948 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 3/951 variables, 2/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/951 variables, 3/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/951 variables, 3/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/951 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 2/953 variables, 1/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/953 variables, 2/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/953 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 42/995 variables, 22/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/995 variables, 20/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/995 variables, 6/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/995 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 3/998 variables, 3/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/998 variables, 3/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/998 variables, 3/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/998 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 48/1046 variables, 22/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1046 variables, 22/1236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1046 variables, 6/1242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1046 variables, 0/1242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (OVERLAPS) 3/1049 variables, 2/1244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1049 variables, 3/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1049 variables, 3/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1049 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 2/1051 variables, 1/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1051 variables, 2/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1051 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 42/1093 variables, 22/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1093 variables, 20/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1093 variables, 6/1301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1093 variables, 0/1301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (OVERLAPS) 3/1096 variables, 3/1304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1096 variables, 3/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1096 variables, 3/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1096 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (OVERLAPS) 48/1144 variables, 22/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1144 variables, 22/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1144 variables, 6/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1144 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (OVERLAPS) 3/1147 variables, 2/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1147 variables, 3/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1147 variables, 3/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1147 variables, 0/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (OVERLAPS) 2/1149 variables, 1/1369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1149 variables, 2/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1149 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (OVERLAPS) 42/1191 variables, 22/1393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1191 variables, 20/1413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1191 variables, 6/1419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1191 variables, 0/1419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (OVERLAPS) 3/1194 variables, 3/1422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1194 variables, 3/1425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/1194 variables, 3/1428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1194 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (OVERLAPS) 45/1239 variables, 21/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1239 variables, 21/1470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1239 variables, 6/1476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1239 variables, 0/1476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (OVERLAPS) 3/1242 variables, 2/1478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1242 variables, 3/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1242 variables, 3/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/1242 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (OVERLAPS) 2/1244 variables, 1/1485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1244 variables, 2/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1244 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (OVERLAPS) 33/1277 variables, 18/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1277 variables, 16/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/1277 variables, 4/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1277 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (OVERLAPS) 3/1280 variables, 3/1528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1280 variables, 3/1531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1280 variables, 3/1534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1280 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (OVERLAPS) 22/1302 variables, 12/1546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1302 variables, 12/1558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1302 variables, 4/1562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/1302 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (OVERLAPS) 1/1303 variables, 1/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/1303 variables, 1/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/1303 variables, 1/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1303 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (OVERLAPS) 2/1305 variables, 1/1566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/1305 variables, 2/1568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1305 variables, 0/1568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (OVERLAPS) 24/1329 variables, 12/1580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/1329 variables, 10/1590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1329 variables, 3/1593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:42:42] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 225 (INCLUDED_ONLY) 0/1329 variables, 1/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/1329 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (OVERLAPS) 2/1331 variables, 1/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/1331 variables, 2/1597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/1331 variables, 2/1599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1331 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (OVERLAPS) 20/1351 variables, 10/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/1351 variables, 10/1619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1351 variables, 3/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1351 variables, 0/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (OVERLAPS) 1/1352 variables, 1/1623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1352 variables, 1/1624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1352 variables, 1/1625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/1352 variables, 0/1625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (OVERLAPS) 2/1354 variables, 1/1626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1354 variables, 2/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/1354 variables, 0/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (OVERLAPS) 24/1378 variables, 12/1640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/1378 variables, 10/1650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/1378 variables, 3/1653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1378 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (OVERLAPS) 2/1380 variables, 1/1654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/1380 variables, 2/1656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1380 variables, 2/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/1380 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (OVERLAPS) 20/1400 variables, 10/1668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (INCLUDED_ONLY) 0/1400 variables, 10/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1400 variables, 3/1681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/1400 variables, 0/1681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (OVERLAPS) 1/1401 variables, 1/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (INCLUDED_ONLY) 0/1401 variables, 1/1683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/1401 variables, 1/1684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/1401 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (OVERLAPS) 2/1403 variables, 1/1685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (INCLUDED_ONLY) 0/1403 variables, 2/1687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/1403 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (OVERLAPS) 24/1427 variables, 12/1699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/1427 variables, 10/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/1427 variables, 3/1712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/1427 variables, 0/1712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (OVERLAPS) 2/1429 variables, 1/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/1429 variables, 2/1715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (INCLUDED_ONLY) 0/1429 variables, 2/1717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/1429 variables, 0/1717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (OVERLAPS) 20/1449 variables, 10/1727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/1449 variables, 10/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (INCLUDED_ONLY) 0/1449 variables, 3/1740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/1449 variables, 0/1740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (OVERLAPS) 1/1450 variables, 1/1741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/1450 variables, 1/1742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/1450 variables, 1/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/1450 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (OVERLAPS) 2/1452 variables, 1/1744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/1452 variables, 2/1746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (INCLUDED_ONLY) 0/1452 variables, 0/1746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (OVERLAPS) 24/1476 variables, 12/1758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/1476 variables, 10/1768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/1476 variables, 3/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (INCLUDED_ONLY) 0/1476 variables, 0/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (OVERLAPS) 2/1478 variables, 1/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/1478 variables, 2/1774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/1478 variables, 2/1776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/1478 variables, 0/1776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (OVERLAPS) 20/1498 variables, 10/1786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (INCLUDED_ONLY) 0/1498 variables, 10/1796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/1498 variables, 3/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (INCLUDED_ONLY) 0/1498 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (OVERLAPS) 1/1499 variables, 1/1800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/1499 variables, 1/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/1499 variables, 1/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (INCLUDED_ONLY) 0/1499 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (OVERLAPS) 2/1501 variables, 1/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/1501 variables, 2/1805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (INCLUDED_ONLY) 0/1501 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (OVERLAPS) 24/1525 variables, 12/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/1525 variables, 10/1827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/1525 variables, 3/1830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/1525 variables, 0/1830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (OVERLAPS) 2/1527 variables, 1/1831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (INCLUDED_ONLY) 0/1527 variables, 2/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/1527 variables, 2/1835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/1527 variables, 0/1835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (OVERLAPS) 20/1547 variables, 10/1845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/1547 variables, 10/1855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/1547 variables, 3/1858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (INCLUDED_ONLY) 0/1547 variables, 0/1858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (OVERLAPS) 1/1548 variables, 1/1859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (INCLUDED_ONLY) 0/1548 variables, 1/1860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (INCLUDED_ONLY) 0/1548 variables, 1/1861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/1548 variables, 0/1861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (OVERLAPS) 2/1550 variables, 1/1862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (INCLUDED_ONLY) 0/1550 variables, 2/1864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/1550 variables, 0/1864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (OVERLAPS) 24/1574 variables, 12/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (INCLUDED_ONLY) 0/1574 variables, 10/1886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/1574 variables, 3/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (INCLUDED_ONLY) 0/1574 variables, 0/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (OVERLAPS) 2/1576 variables, 1/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (INCLUDED_ONLY) 0/1576 variables, 2/1892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (INCLUDED_ONLY) 0/1576 variables, 2/1894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (INCLUDED_ONLY) 0/1576 variables, 0/1894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (OVERLAPS) 20/1596 variables, 10/1904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (INCLUDED_ONLY) 0/1596 variables, 10/1914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (INCLUDED_ONLY) 0/1596 variables, 3/1917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/1596 variables, 0/1917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (OVERLAPS) 1/1597 variables, 1/1918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (INCLUDED_ONLY) 0/1597 variables, 1/1919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/1597 variables, 1/1920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (INCLUDED_ONLY) 0/1597 variables, 0/1920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (OVERLAPS) 2/1599 variables, 1/1921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/1599 variables, 2/1923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (INCLUDED_ONLY) 0/1599 variables, 0/1923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (OVERLAPS) 24/1623 variables, 12/1935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (INCLUDED_ONLY) 0/1623 variables, 10/1945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (INCLUDED_ONLY) 0/1623 variables, 3/1948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (INCLUDED_ONLY) 0/1623 variables, 0/1948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 341 (OVERLAPS) 2/1625 variables, 1/1949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 342 (INCLUDED_ONLY) 0/1625 variables, 2/1951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 343 (INCLUDED_ONLY) 0/1625 variables, 2/1953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/1625 variables, 0/1953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 345 (OVERLAPS) 20/1645 variables, 10/1963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 346 (INCLUDED_ONLY) 0/1645 variables, 10/1973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 347 (INCLUDED_ONLY) 0/1645 variables, 3/1976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 348 (INCLUDED_ONLY) 0/1645 variables, 0/1976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 349 (OVERLAPS) 1/1646 variables, 1/1977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 350 (INCLUDED_ONLY) 0/1646 variables, 1/1978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 351 (INCLUDED_ONLY) 0/1646 variables, 1/1979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 352 (INCLUDED_ONLY) 0/1646 variables, 0/1979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 353 (OVERLAPS) 2/1648 variables, 1/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 354 (INCLUDED_ONLY) 0/1648 variables, 2/1982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 355 (INCLUDED_ONLY) 0/1648 variables, 0/1982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 356 (OVERLAPS) 24/1672 variables, 12/1994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 357 (INCLUDED_ONLY) 0/1672 variables, 10/2004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 358 (INCLUDED_ONLY) 0/1672 variables, 3/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 359 (INCLUDED_ONLY) 0/1672 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 360 (OVERLAPS) 2/1674 variables, 1/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 361 (INCLUDED_ONLY) 0/1674 variables, 2/2010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 362 (INCLUDED_ONLY) 0/1674 variables, 2/2012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 363 (INCLUDED_ONLY) 0/1674 variables, 0/2012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 364 (OVERLAPS) 20/1694 variables, 10/2022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 365 (INCLUDED_ONLY) 0/1694 variables, 10/2032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 366 (INCLUDED_ONLY) 0/1694 variables, 3/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 367 (INCLUDED_ONLY) 0/1694 variables, 0/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 368 (OVERLAPS) 1/1695 variables, 1/2036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 369 (INCLUDED_ONLY) 0/1695 variables, 1/2037 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 370 (INCLUDED_ONLY) 0/1695 variables, 1/2038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 371 (INCLUDED_ONLY) 0/1695 variables, 0/2038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 372 (OVERLAPS) 2/1697 variables, 1/2039 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 373 (INCLUDED_ONLY) 0/1697 variables, 2/2041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 374 (INCLUDED_ONLY) 0/1697 variables, 0/2041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 375 (OVERLAPS) 24/1721 variables, 12/2053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 376 (INCLUDED_ONLY) 0/1721 variables, 10/2063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 377 (INCLUDED_ONLY) 0/1721 variables, 3/2066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:42:44] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 378 (INCLUDED_ONLY) 0/1721 variables, 1/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 379 (INCLUDED_ONLY) 0/1721 variables, 0/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 380 (OVERLAPS) 2/1723 variables, 1/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 381 (INCLUDED_ONLY) 0/1723 variables, 2/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 382 (INCLUDED_ONLY) 0/1723 variables, 2/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 383 (INCLUDED_ONLY) 0/1723 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 384 (OVERLAPS) 20/1743 variables, 10/2082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 385 (INCLUDED_ONLY) 0/1743 variables, 10/2092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 386 (INCLUDED_ONLY) 0/1743 variables, 3/2095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 387 (INCLUDED_ONLY) 0/1743 variables, 0/2095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 388 (OVERLAPS) 1/1744 variables, 1/2096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 389 (INCLUDED_ONLY) 0/1744 variables, 1/2097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 390 (INCLUDED_ONLY) 0/1744 variables, 1/2098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 391 (INCLUDED_ONLY) 0/1744 variables, 0/2098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 392 (OVERLAPS) 2/1746 variables, 1/2099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 393 (INCLUDED_ONLY) 0/1746 variables, 2/2101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 394 (INCLUDED_ONLY) 0/1746 variables, 0/2101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 395 (OVERLAPS) 24/1770 variables, 12/2113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 396 (INCLUDED_ONLY) 0/1770 variables, 10/2123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 397 (INCLUDED_ONLY) 0/1770 variables, 3/2126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:42:44] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 398 (INCLUDED_ONLY) 0/1770 variables, 1/2127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 399 (INCLUDED_ONLY) 0/1770 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 400 (OVERLAPS) 2/1772 variables, 1/2128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 401 (INCLUDED_ONLY) 0/1772 variables, 2/2130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 402 (INCLUDED_ONLY) 0/1772 variables, 2/2132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 403 (INCLUDED_ONLY) 0/1772 variables, 0/2132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 404 (OVERLAPS) 20/1792 variables, 10/2142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 405 (INCLUDED_ONLY) 0/1792 variables, 10/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 406 (INCLUDED_ONLY) 0/1792 variables, 3/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 407 (INCLUDED_ONLY) 0/1792 variables, 0/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 408 (OVERLAPS) 1/1793 variables, 1/2156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 409 (INCLUDED_ONLY) 0/1793 variables, 1/2157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 410 (INCLUDED_ONLY) 0/1793 variables, 1/2158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 411 (INCLUDED_ONLY) 0/1793 variables, 0/2158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 412 (OVERLAPS) 2/1795 variables, 1/2159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 413 (INCLUDED_ONLY) 0/1795 variables, 2/2161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 414 (INCLUDED_ONLY) 0/1795 variables, 0/2161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 415 (OVERLAPS) 24/1819 variables, 12/2173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 416 (INCLUDED_ONLY) 0/1819 variables, 10/2183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 417 (INCLUDED_ONLY) 0/1819 variables, 3/2186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 418 (INCLUDED_ONLY) 0/1819 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 419 (OVERLAPS) 2/1821 variables, 1/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 420 (INCLUDED_ONLY) 0/1821 variables, 2/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 421 (INCLUDED_ONLY) 0/1821 variables, 2/2191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 422 (INCLUDED_ONLY) 0/1821 variables, 0/2191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 423 (OVERLAPS) 20/1841 variables, 10/2201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 424 (INCLUDED_ONLY) 0/1841 variables, 10/2211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 425 (INCLUDED_ONLY) 0/1841 variables, 3/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 426 (INCLUDED_ONLY) 0/1841 variables, 0/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 427 (OVERLAPS) 1/1842 variables, 1/2215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 428 (INCLUDED_ONLY) 0/1842 variables, 1/2216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 429 (INCLUDED_ONLY) 0/1842 variables, 1/2217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 430 (INCLUDED_ONLY) 0/1842 variables, 0/2217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 431 (OVERLAPS) 2/1844 variables, 1/2218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 432 (INCLUDED_ONLY) 0/1844 variables, 2/2220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 433 (INCLUDED_ONLY) 0/1844 variables, 0/2220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 434 (OVERLAPS) 24/1868 variables, 12/2232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 435 (INCLUDED_ONLY) 0/1868 variables, 10/2242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 436 (INCLUDED_ONLY) 0/1868 variables, 3/2245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 437 (INCLUDED_ONLY) 0/1868 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 438 (OVERLAPS) 2/1870 variables, 1/2246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 439 (INCLUDED_ONLY) 0/1870 variables, 2/2248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 440 (INCLUDED_ONLY) 0/1870 variables, 2/2250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 441 (INCLUDED_ONLY) 0/1870 variables, 0/2250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 442 (OVERLAPS) 20/1890 variables, 10/2260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 443 (INCLUDED_ONLY) 0/1890 variables, 10/2270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 444 (INCLUDED_ONLY) 0/1890 variables, 3/2273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 445 (INCLUDED_ONLY) 0/1890 variables, 0/2273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 446 (OVERLAPS) 1/1891 variables, 1/2274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 447 (INCLUDED_ONLY) 0/1891 variables, 1/2275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 448 (INCLUDED_ONLY) 0/1891 variables, 1/2276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 449 (INCLUDED_ONLY) 0/1891 variables, 0/2276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 450 (OVERLAPS) 2/1893 variables, 1/2277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 451 (INCLUDED_ONLY) 0/1893 variables, 2/2279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 452 (INCLUDED_ONLY) 0/1893 variables, 0/2279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 453 (OVERLAPS) 24/1917 variables, 12/2291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 454 (INCLUDED_ONLY) 0/1917 variables, 10/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 455 (INCLUDED_ONLY) 0/1917 variables, 3/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1917/1958 variables, and 2304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5008 ms.
Refiners :[Domain max(s): 974/999 constraints, Positive P Invariants (semi-flows): 350/360 constraints, State Equation: 974/999 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 7898ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 959/959 transitions.
Partial Free-agglomeration rule applied 234 times.
Drop transitions (Partial Free agglomeration) removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 234 place count 999 transition count 959
Applied a total of 234 rules in 77 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 999/999 places, 959/959 transitions.
RANDOM walk for 37351 steps (8 resets) in 505 ms. (73 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 11 factoid took 285 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Support contains 6 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 959/959 transitions.
Applied a total of 0 rules in 31 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-05-28 14:42:45] [INFO ] Invariant cache hit.
[2024-05-28 14:42:46] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-28 14:42:46] [INFO ] Invariant cache hit.
[2024-05-28 14:42:47] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
[2024-05-28 14:42:47] [INFO ] Redundant transitions in 90 ms returned []
Running 958 sub problems to find dead transitions.
[2024-05-28 14:42:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:43:00] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:43:01] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:43:02] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:43:02] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-28 14:43:02] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:43:02] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:43:02] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-28 14:43:03] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:43:03] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:43:03] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-28 14:43:03] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 14:43:04] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-28 14:43:04] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2024-05-28 14:43:04] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-28 14:43:04] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:43:07] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:43:07] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-28 14:43:08] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:43:08] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:43:08] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-28 14:43:08] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:43:09] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:43:09] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:43:09] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:43:10] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 3 ms to minimize.
[2024-05-28 14:43:10] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:43:10] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-05-28 14:43:11] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-05-28 14:43:11] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 3 ms to minimize.
[2024-05-28 14:43:12] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 3 ms to minimize.
[2024-05-28 14:43:12] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-05-28 14:43:12] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:43:13] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:43:13] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 1.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 1.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 1.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 0.0)
(s558 1.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 1.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 1.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 1.0)
(s632 0.0)
(s633 1.0)
(s634 1.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 1.0)
(s651 0.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 1.0)
(s659 1.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 1.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 1.0)
(s682 0.0)
(s683 1.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 1398 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30023 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:43:34] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 1/1399 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1958 variables, and 1399 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30018 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 40/40 constraints]
After SMT, in 60210ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61786 ms. Remains : 999/999 places, 959/959 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 40000 steps (16 resets) in 630 ms. (63 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
[2024-05-28 14:43:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 14/20 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/54 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 70/124 variables, 28/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 28/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/130 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/130 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/134 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/134 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/134 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 96/230 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/230 variables, 44/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/230 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/236 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/236 variables, 6/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/236 variables, 6/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/236 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/240 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/240 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/240 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 84/324 variables, 44/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/324 variables, 40/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/324 variables, 12/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/324 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 6/330 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/330 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/330 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/330 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 95/425 variables, 44/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/425 variables, 44/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/425 variables, 12/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/425 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 6/431 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/431 variables, 6/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/431 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/431 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/435 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/435 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/435 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 67/502 variables, 40/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/502 variables, 36/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/502 variables, 11/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/502 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 4/506 variables, 5/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/506 variables, 4/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/506 variables, 4/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/506 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 50/556 variables, 24/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/556 variables, 24/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/556 variables, 7/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/556 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 3/559 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/559 variables, 3/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/559 variables, 3/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/559 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 2/561 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/561 variables, 2/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/561 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 42/603 variables, 22/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/603 variables, 20/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/603 variables, 6/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/603 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 3/606 variables, 3/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/606 variables, 3/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/606 variables, 3/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/606 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 48/654 variables, 22/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/654 variables, 22/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/654 variables, 6/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/654 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 3/657 variables, 2/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/657 variables, 3/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/657 variables, 3/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/657 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 2/659 variables, 1/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/659 variables, 2/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/659 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 42/701 variables, 22/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/701 variables, 20/820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/701 variables, 6/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/701 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 3/704 variables, 3/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/704 variables, 3/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/704 variables, 3/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/704 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 48/752 variables, 22/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/752 variables, 22/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/752 variables, 6/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/752 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 3/755 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/755 variables, 3/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/755 variables, 3/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/755 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 2/757 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/757 variables, 2/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/757 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 42/799 variables, 22/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/799 variables, 20/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/799 variables, 6/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/799 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 3/802 variables, 3/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/802 variables, 3/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/802 variables, 3/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/802 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 48/850 variables, 22/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/850 variables, 22/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/850 variables, 6/1003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/850 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 3/853 variables, 2/1005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/853 variables, 3/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/853 variables, 3/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/853 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 2/855 variables, 1/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/855 variables, 2/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/855 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 42/897 variables, 22/1036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/897 variables, 20/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/897 variables, 6/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/897 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 3/900 variables, 3/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/900 variables, 3/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/900 variables, 3/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/900 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 48/948 variables, 22/1093 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/948 variables, 22/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/948 variables, 6/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/948 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 3/951 variables, 2/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/951 variables, 3/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/951 variables, 3/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/951 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 2/953 variables, 1/1130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/953 variables, 2/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/953 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 42/995 variables, 22/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/995 variables, 20/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/995 variables, 6/1180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/995 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 3/998 variables, 3/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/998 variables, 3/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/998 variables, 3/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/998 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 48/1046 variables, 22/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1046 variables, 22/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1046 variables, 6/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1046 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (OVERLAPS) 3/1049 variables, 2/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1049 variables, 3/1244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1049 variables, 3/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1049 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 2/1051 variables, 1/1248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1051 variables, 2/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1051 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 42/1093 variables, 22/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1093 variables, 20/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1093 variables, 6/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1093 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (OVERLAPS) 3/1096 variables, 3/1301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1096 variables, 3/1304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1096 variables, 3/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1096 variables, 0/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (OVERLAPS) 48/1144 variables, 22/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1144 variables, 22/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1144 variables, 6/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1144 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (OVERLAPS) 3/1147 variables, 2/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1147 variables, 3/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1147 variables, 3/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1147 variables, 0/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (OVERLAPS) 2/1149 variables, 1/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1149 variables, 2/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/1149 variables, 0/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (OVERLAPS) 42/1191 variables, 22/1390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1191 variables, 20/1410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/1191 variables, 6/1416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1191 variables, 0/1416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (OVERLAPS) 3/1194 variables, 3/1419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1194 variables, 3/1422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1194 variables, 3/1425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1194 variables, 0/1425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (OVERLAPS) 45/1239 variables, 21/1446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1239 variables, 21/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1239 variables, 6/1473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1239 variables, 0/1473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (OVERLAPS) 3/1242 variables, 2/1475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1242 variables, 3/1478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/1242 variables, 3/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1242 variables, 0/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (OVERLAPS) 2/1244 variables, 1/1482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/1244 variables, 2/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1244 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (OVERLAPS) 33/1277 variables, 18/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1277 variables, 16/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1277 variables, 4/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1277 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (OVERLAPS) 3/1280 variables, 3/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1280 variables, 3/1528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/1280 variables, 3/1531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1280 variables, 0/1531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (OVERLAPS) 22/1302 variables, 12/1543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1302 variables, 12/1555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (INCLUDED_ONLY) 0/1302 variables, 4/1559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1302 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (OVERLAPS) 1/1303 variables, 1/1560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/1303 variables, 1/1561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/1303 variables, 1/1562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/1303 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (OVERLAPS) 2/1305 variables, 1/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1305 variables, 2/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/1305 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (OVERLAPS) 24/1329 variables, 12/1577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1329 variables, 10/1587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/1329 variables, 3/1590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/1329 variables, 0/1590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (OVERLAPS) 2/1331 variables, 1/1591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/1331 variables, 2/1593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/1331 variables, 2/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/1331 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (OVERLAPS) 20/1351 variables, 10/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/1351 variables, 10/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1351 variables, 3/1618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/1351 variables, 0/1618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (OVERLAPS) 1/1352 variables, 1/1619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1352 variables, 1/1620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1352 variables, 1/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (INCLUDED_ONLY) 0/1352 variables, 0/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (OVERLAPS) 2/1354 variables, 1/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1354 variables, 2/1624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/1354 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (OVERLAPS) 24/1378 variables, 12/1636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1378 variables, 10/1646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/1378 variables, 3/1649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/1378 variables, 0/1649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (OVERLAPS) 2/1380 variables, 1/1650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/1380 variables, 2/1652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1380 variables, 2/1654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/1380 variables, 0/1654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (OVERLAPS) 20/1400 variables, 10/1664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1400 variables, 10/1674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/1400 variables, 3/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/1400 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (OVERLAPS) 1/1401 variables, 1/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1401 variables, 1/1679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/1401 variables, 1/1680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/1401 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (OVERLAPS) 2/1403 variables, 1/1681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/1403 variables, 2/1683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/1403 variables, 0/1683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (OVERLAPS) 24/1427 variables, 12/1695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (INCLUDED_ONLY) 0/1427 variables, 10/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/1427 variables, 3/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/1427 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (OVERLAPS) 2/1429 variables, 1/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/1429 variables, 2/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/1429 variables, 2/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/1429 variables, 0/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (OVERLAPS) 20/1449 variables, 10/1723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (INCLUDED_ONLY) 0/1449 variables, 10/1733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/1449 variables, 3/1736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/1449 variables, 0/1736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (OVERLAPS) 1/1450 variables, 1/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (INCLUDED_ONLY) 0/1450 variables, 1/1738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/1450 variables, 1/1739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/1450 variables, 0/1739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (OVERLAPS) 2/1452 variables, 1/1740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/1452 variables, 2/1742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/1452 variables, 0/1742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (OVERLAPS) 24/1476 variables, 12/1754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/1476 variables, 10/1764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (INCLUDED_ONLY) 0/1476 variables, 3/1767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/1476 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (OVERLAPS) 2/1478 variables, 1/1768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/1478 variables, 2/1770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (INCLUDED_ONLY) 0/1478 variables, 2/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/1478 variables, 0/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (OVERLAPS) 20/1498 variables, 10/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/1498 variables, 10/1792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/1498 variables, 3/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/1498 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (OVERLAPS) 1/1499 variables, 1/1796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/1499 variables, 1/1797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (INCLUDED_ONLY) 0/1499 variables, 1/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (INCLUDED_ONLY) 0/1499 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (OVERLAPS) 2/1501 variables, 1/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/1501 variables, 2/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (INCLUDED_ONLY) 0/1501 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (OVERLAPS) 24/1525 variables, 12/1813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/1525 variables, 10/1823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (INCLUDED_ONLY) 0/1525 variables, 3/1826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/1525 variables, 0/1826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (OVERLAPS) 2/1527 variables, 1/1827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/1527 variables, 2/1829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/1527 variables, 2/1831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (INCLUDED_ONLY) 0/1527 variables, 0/1831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (OVERLAPS) 20/1547 variables, 10/1841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/1547 variables, 10/1851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/1547 variables, 3/1854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (INCLUDED_ONLY) 0/1547 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (OVERLAPS) 1/1548 variables, 1/1855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/1548 variables, 1/1856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (INCLUDED_ONLY) 0/1548 variables, 1/1857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (INCLUDED_ONLY) 0/1548 variables, 0/1857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (OVERLAPS) 2/1550 variables, 1/1858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (INCLUDED_ONLY) 0/1550 variables, 2/1860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/1550 variables, 0/1860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (OVERLAPS) 24/1574 variables, 12/1872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (INCLUDED_ONLY) 0/1574 variables, 10/1882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/1574 variables, 3/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (INCLUDED_ONLY) 0/1574 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (OVERLAPS) 2/1576 variables, 1/1886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/1576 variables, 2/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (INCLUDED_ONLY) 0/1576 variables, 2/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (INCLUDED_ONLY) 0/1576 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (OVERLAPS) 20/1596 variables, 10/1900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (INCLUDED_ONLY) 0/1596 variables, 10/1910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (INCLUDED_ONLY) 0/1596 variables, 3/1913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/1596 variables, 0/1913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (OVERLAPS) 1/1597 variables, 1/1914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (INCLUDED_ONLY) 0/1597 variables, 1/1915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/1597 variables, 1/1916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (INCLUDED_ONLY) 0/1597 variables, 0/1916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (OVERLAPS) 2/1599 variables, 1/1917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/1599 variables, 2/1919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (INCLUDED_ONLY) 0/1599 variables, 0/1919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (OVERLAPS) 24/1623 variables, 12/1931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/1623 variables, 10/1941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (INCLUDED_ONLY) 0/1623 variables, 3/1944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (INCLUDED_ONLY) 0/1623 variables, 0/1944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (OVERLAPS) 2/1625 variables, 1/1945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (INCLUDED_ONLY) 0/1625 variables, 2/1947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (INCLUDED_ONLY) 0/1625 variables, 2/1949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 341 (INCLUDED_ONLY) 0/1625 variables, 0/1949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 342 (OVERLAPS) 20/1645 variables, 10/1959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 343 (INCLUDED_ONLY) 0/1645 variables, 10/1969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/1645 variables, 3/1972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 345 (INCLUDED_ONLY) 0/1645 variables, 0/1972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 346 (OVERLAPS) 1/1646 variables, 1/1973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 347 (INCLUDED_ONLY) 0/1646 variables, 1/1974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 348 (INCLUDED_ONLY) 0/1646 variables, 1/1975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 349 (INCLUDED_ONLY) 0/1646 variables, 0/1975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 350 (OVERLAPS) 2/1648 variables, 1/1976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 351 (INCLUDED_ONLY) 0/1648 variables, 2/1978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 352 (INCLUDED_ONLY) 0/1648 variables, 0/1978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 353 (OVERLAPS) 24/1672 variables, 12/1990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 354 (INCLUDED_ONLY) 0/1672 variables, 10/2000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 355 (INCLUDED_ONLY) 0/1672 variables, 3/2003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 356 (INCLUDED_ONLY) 0/1672 variables, 0/2003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 357 (OVERLAPS) 2/1674 variables, 1/2004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 358 (INCLUDED_ONLY) 0/1674 variables, 2/2006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 359 (INCLUDED_ONLY) 0/1674 variables, 2/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 360 (INCLUDED_ONLY) 0/1674 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 361 (OVERLAPS) 20/1694 variables, 10/2018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 362 (INCLUDED_ONLY) 0/1694 variables, 10/2028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 363 (INCLUDED_ONLY) 0/1694 variables, 3/2031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 364 (INCLUDED_ONLY) 0/1694 variables, 0/2031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 365 (OVERLAPS) 1/1695 variables, 1/2032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 366 (INCLUDED_ONLY) 0/1695 variables, 1/2033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 367 (INCLUDED_ONLY) 0/1695 variables, 1/2034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 368 (INCLUDED_ONLY) 0/1695 variables, 0/2034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 369 (OVERLAPS) 2/1697 variables, 1/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 370 (INCLUDED_ONLY) 0/1697 variables, 2/2037 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 371 (INCLUDED_ONLY) 0/1697 variables, 0/2037 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 372 (OVERLAPS) 24/1721 variables, 12/2049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 373 (INCLUDED_ONLY) 0/1721 variables, 10/2059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 374 (INCLUDED_ONLY) 0/1721 variables, 3/2062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 375 (INCLUDED_ONLY) 0/1721 variables, 0/2062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 376 (OVERLAPS) 2/1723 variables, 1/2063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 377 (INCLUDED_ONLY) 0/1723 variables, 2/2065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 378 (INCLUDED_ONLY) 0/1723 variables, 2/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 379 (INCLUDED_ONLY) 0/1723 variables, 0/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 380 (OVERLAPS) 20/1743 variables, 10/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 381 (INCLUDED_ONLY) 0/1743 variables, 10/2087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 382 (INCLUDED_ONLY) 0/1743 variables, 3/2090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 383 (INCLUDED_ONLY) 0/1743 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 384 (OVERLAPS) 1/1744 variables, 1/2091 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 385 (INCLUDED_ONLY) 0/1744 variables, 1/2092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 386 (INCLUDED_ONLY) 0/1744 variables, 1/2093 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 387 (INCLUDED_ONLY) 0/1744 variables, 0/2093 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 388 (OVERLAPS) 2/1746 variables, 1/2094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 389 (INCLUDED_ONLY) 0/1746 variables, 2/2096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 390 (INCLUDED_ONLY) 0/1746 variables, 0/2096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 391 (OVERLAPS) 24/1770 variables, 12/2108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 392 (INCLUDED_ONLY) 0/1770 variables, 10/2118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 393 (INCLUDED_ONLY) 0/1770 variables, 3/2121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 394 (INCLUDED_ONLY) 0/1770 variables, 0/2121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 395 (OVERLAPS) 2/1772 variables, 1/2122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 396 (INCLUDED_ONLY) 0/1772 variables, 2/2124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 397 (INCLUDED_ONLY) 0/1772 variables, 2/2126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 398 (INCLUDED_ONLY) 0/1772 variables, 0/2126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 399 (OVERLAPS) 20/1792 variables, 10/2136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 400 (INCLUDED_ONLY) 0/1792 variables, 10/2146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 401 (INCLUDED_ONLY) 0/1792 variables, 3/2149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 402 (INCLUDED_ONLY) 0/1792 variables, 0/2149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 403 (OVERLAPS) 1/1793 variables, 1/2150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 404 (INCLUDED_ONLY) 0/1793 variables, 1/2151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 405 (INCLUDED_ONLY) 0/1793 variables, 1/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 406 (INCLUDED_ONLY) 0/1793 variables, 0/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 407 (OVERLAPS) 2/1795 variables, 1/2153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 408 (INCLUDED_ONLY) 0/1795 variables, 2/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 409 (INCLUDED_ONLY) 0/1795 variables, 0/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 410 (OVERLAPS) 24/1819 variables, 12/2167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 411 (INCLUDED_ONLY) 0/1819 variables, 10/2177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 412 (INCLUDED_ONLY) 0/1819 variables, 3/2180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 413 (INCLUDED_ONLY) 0/1819 variables, 0/2180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 414 (OVERLAPS) 2/1821 variables, 1/2181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 415 (INCLUDED_ONLY) 0/1821 variables, 2/2183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 416 (INCLUDED_ONLY) 0/1821 variables, 2/2185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 417 (INCLUDED_ONLY) 0/1821 variables, 0/2185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 418 (OVERLAPS) 20/1841 variables, 10/2195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 419 (INCLUDED_ONLY) 0/1841 variables, 10/2205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 420 (INCLUDED_ONLY) 0/1841 variables, 3/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 421 (INCLUDED_ONLY) 0/1841 variables, 0/2208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 422 (OVERLAPS) 1/1842 variables, 1/2209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 423 (INCLUDED_ONLY) 0/1842 variables, 1/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 424 (INCLUDED_ONLY) 0/1842 variables, 1/2211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 425 (INCLUDED_ONLY) 0/1842 variables, 0/2211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 426 (OVERLAPS) 2/1844 variables, 1/2212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 427 (INCLUDED_ONLY) 0/1844 variables, 2/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 428 (INCLUDED_ONLY) 0/1844 variables, 0/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 429 (OVERLAPS) 24/1868 variables, 12/2226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 430 (INCLUDED_ONLY) 0/1868 variables, 10/2236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 431 (INCLUDED_ONLY) 0/1868 variables, 3/2239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 432 (INCLUDED_ONLY) 0/1868 variables, 0/2239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 433 (OVERLAPS) 2/1870 variables, 1/2240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 434 (INCLUDED_ONLY) 0/1870 variables, 2/2242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 435 (INCLUDED_ONLY) 0/1870 variables, 2/2244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 436 (INCLUDED_ONLY) 0/1870 variables, 0/2244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 437 (OVERLAPS) 20/1890 variables, 10/2254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 438 (INCLUDED_ONLY) 0/1890 variables, 10/2264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 439 (INCLUDED_ONLY) 0/1890 variables, 3/2267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 440 (INCLUDED_ONLY) 0/1890 variables, 0/2267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 441 (OVERLAPS) 1/1891 variables, 1/2268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 442 (INCLUDED_ONLY) 0/1891 variables, 1/2269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 443 (INCLUDED_ONLY) 0/1891 variables, 1/2270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 444 (INCLUDED_ONLY) 0/1891 variables, 0/2270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 445 (OVERLAPS) 2/1893 variables, 1/2271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 446 (INCLUDED_ONLY) 0/1893 variables, 2/2273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 447 (INCLUDED_ONLY) 0/1893 variables, 0/2273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 448 (OVERLAPS) 24/1917 variables, 12/2285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 449 (INCLUDED_ONLY) 0/1917 variables, 10/2295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 450 (INCLUDED_ONLY) 0/1917 variables, 3/2298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 451 (INCLUDED_ONLY) 0/1917 variables, 0/2298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 452 (OVERLAPS) 2/1919 variables, 1/2299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 453 (INCLUDED_ONLY) 0/1919 variables, 2/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 454 (INCLUDED_ONLY) 0/1919 variables, 2/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 455 (INCLUDED_ONLY) 0/1919 variables, 0/2303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 456 (OVERLAPS) 20/1939 variables, 10/2313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 457 (INCLUDED_ONLY) 0/1939 variables, 10/2323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 458 (INCLUDED_ONLY) 0/1939 variables, 3/2326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 459 (INCLUDED_ONLY) 0/1939 variables, 0/2326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 460 (OVERLAPS) 1/1940 variables, 1/2327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 461 (INCLUDED_ONLY) 0/1940 variables, 1/2328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 462 (INCLUDED_ONLY) 0/1940 variables, 1/2329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 463 (INCLUDED_ONLY) 0/1940 variables, 0/2329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 464 (OVERLAPS) 2/1942 variables, 1/2330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 465 (INCLUDED_ONLY) 0/1942 variables, 2/2332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 466 (INCLUDED_ONLY) 0/1942 variables, 0/2332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 467 (OVERLAPS) 16/1958 variables, 12/2344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 468 (INCLUDED_ONLY) 0/1958 variables, 10/2354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 469 (INCLUDED_ONLY) 0/1958 variables, 4/2358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 470 (INCLUDED_ONLY) 0/1958 variables, 0/2358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 471 (OVERLAPS) 0/1958 variables, 0/2358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1958/1958 variables, and 2358 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2734 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 999/999 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/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 14/20 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/54 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 70/124 variables, 28/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 28/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/130 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/130 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/130 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/134 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/134 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/134 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/134 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 96/230 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/230 variables, 44/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/230 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/230 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/236 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/236 variables, 6/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/236 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/236 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/240 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/240 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/240 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 84/324 variables, 44/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/324 variables, 40/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/324 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/324 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 6/330 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/330 variables, 6/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/330 variables, 6/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/330 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 95/425 variables, 44/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/425 variables, 44/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/425 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/425 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 6/431 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/431 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/431 variables, 6/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/431 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 4/435 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/435 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/435 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 67/502 variables, 40/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/502 variables, 36/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/502 variables, 11/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/502 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 4/506 variables, 5/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/506 variables, 4/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/506 variables, 4/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/506 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 50/556 variables, 24/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/556 variables, 24/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/556 variables, 7/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/556 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 3/559 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/559 variables, 3/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/559 variables, 3/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/559 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 2/561 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/561 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/561 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 42/603 variables, 22/683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/603 variables, 20/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/603 variables, 6/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/603 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 3/606 variables, 3/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/606 variables, 3/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/606 variables, 3/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/606 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 48/654 variables, 22/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/654 variables, 22/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/654 variables, 6/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/654 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 3/657 variables, 2/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/657 variables, 3/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/657 variables, 3/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/657 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 2/659 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/659 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/659 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 42/701 variables, 22/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/701 variables, 20/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/701 variables, 6/827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:43:51] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 14:43:51] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
At refinement iteration 91 (INCLUDED_ONLY) 0/701 variables, 2/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/701 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 3/704 variables, 3/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/704 variables, 3/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/704 variables, 3/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/704 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 48/752 variables, 22/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/752 variables, 22/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/752 variables, 6/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/752 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 3/755 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/755 variables, 3/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/755 variables, 3/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/755 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 2/757 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/757 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/757 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 42/799 variables, 22/921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/799 variables, 20/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/799 variables, 6/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/799 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 3/802 variables, 3/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/802 variables, 3/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/802 variables, 3/956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/802 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 48/850 variables, 22/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/850 variables, 22/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/850 variables, 6/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/850 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 3/853 variables, 2/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/853 variables, 3/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/853 variables, 3/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/853 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 2/855 variables, 1/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/855 variables, 2/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/855 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 42/897 variables, 22/1039 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/897 variables, 20/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/897 variables, 6/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/897 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 3/900 variables, 3/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/900 variables, 3/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/900 variables, 3/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/900 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 48/948 variables, 22/1096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/948 variables, 22/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/948 variables, 6/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/948 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 3/951 variables, 2/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/951 variables, 3/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/951 variables, 3/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/951 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 2/953 variables, 1/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/953 variables, 2/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/953 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 42/995 variables, 22/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/995 variables, 20/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/995 variables, 6/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/995 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 3/998 variables, 3/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/998 variables, 3/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/998 variables, 3/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/998 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 48/1046 variables, 22/1214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1046 variables, 22/1236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1046 variables, 6/1242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1046 variables, 0/1242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (OVERLAPS) 3/1049 variables, 2/1244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1049 variables, 3/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1049 variables, 3/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1049 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 2/1051 variables, 1/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1051 variables, 2/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1051 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 42/1093 variables, 22/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1093 variables, 20/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1093 variables, 6/1301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1093 variables, 0/1301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (OVERLAPS) 3/1096 variables, 3/1304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1096 variables, 3/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1096 variables, 3/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1096 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (OVERLAPS) 48/1144 variables, 22/1332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1144 variables, 22/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1144 variables, 6/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1144 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (OVERLAPS) 3/1147 variables, 2/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1147 variables, 3/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1147 variables, 3/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1147 variables, 0/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (OVERLAPS) 2/1149 variables, 1/1369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1149 variables, 2/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1149 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (OVERLAPS) 42/1191 variables, 22/1393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1191 variables, 20/1413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1191 variables, 6/1419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1191 variables, 0/1419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (OVERLAPS) 3/1194 variables, 3/1422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1194 variables, 3/1425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/1194 variables, 3/1428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1194 variables, 0/1428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (OVERLAPS) 45/1239 variables, 21/1449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1239 variables, 21/1470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1239 variables, 6/1476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1239 variables, 0/1476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (OVERLAPS) 3/1242 variables, 2/1478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1242 variables, 3/1481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1242 variables, 3/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/1242 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (OVERLAPS) 2/1244 variables, 1/1485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1244 variables, 2/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1244 variables, 0/1487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (OVERLAPS) 33/1277 variables, 18/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1277 variables, 16/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/1277 variables, 4/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1277 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (OVERLAPS) 3/1280 variables, 3/1528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1280 variables, 3/1531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1280 variables, 3/1534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1280 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (OVERLAPS) 22/1302 variables, 12/1546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1302 variables, 12/1558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1302 variables, 4/1562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/1302 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (OVERLAPS) 1/1303 variables, 1/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/1303 variables, 1/1564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/1303 variables, 1/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1303 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (OVERLAPS) 2/1305 variables, 1/1566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/1305 variables, 2/1568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1305 variables, 0/1568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (OVERLAPS) 24/1329 variables, 12/1580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/1329 variables, 10/1590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1329 variables, 3/1593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:43:52] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 225 (INCLUDED_ONLY) 0/1329 variables, 1/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/1329 variables, 0/1594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (OVERLAPS) 2/1331 variables, 1/1595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/1331 variables, 2/1597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/1331 variables, 2/1599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1331 variables, 0/1599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (OVERLAPS) 20/1351 variables, 10/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/1351 variables, 10/1619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1351 variables, 3/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1351 variables, 0/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (OVERLAPS) 1/1352 variables, 1/1623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1352 variables, 1/1624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1352 variables, 1/1625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/1352 variables, 0/1625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (OVERLAPS) 2/1354 variables, 1/1626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1354 variables, 2/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/1354 variables, 0/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (OVERLAPS) 24/1378 variables, 12/1640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/1378 variables, 10/1650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/1378 variables, 3/1653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1378 variables, 0/1653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (OVERLAPS) 2/1380 variables, 1/1654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/1380 variables, 2/1656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1380 variables, 2/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/1380 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (OVERLAPS) 20/1400 variables, 10/1668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (INCLUDED_ONLY) 0/1400 variables, 10/1678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1400 variables, 3/1681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/1400 variables, 0/1681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (OVERLAPS) 1/1401 variables, 1/1682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (INCLUDED_ONLY) 0/1401 variables, 1/1683 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/1401 variables, 1/1684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/1401 variables, 0/1684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (OVERLAPS) 2/1403 variables, 1/1685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (INCLUDED_ONLY) 0/1403 variables, 2/1687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/1403 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (OVERLAPS) 24/1427 variables, 12/1699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/1427 variables, 10/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/1427 variables, 3/1712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/1427 variables, 0/1712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (OVERLAPS) 2/1429 variables, 1/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/1429 variables, 2/1715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (INCLUDED_ONLY) 0/1429 variables, 2/1717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/1429 variables, 0/1717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (OVERLAPS) 20/1449 variables, 10/1727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/1449 variables, 10/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (INCLUDED_ONLY) 0/1449 variables, 3/1740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/1449 variables, 0/1740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (OVERLAPS) 1/1450 variables, 1/1741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/1450 variables, 1/1742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/1450 variables, 1/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/1450 variables, 0/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (OVERLAPS) 2/1452 variables, 1/1744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/1452 variables, 2/1746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (INCLUDED_ONLY) 0/1452 variables, 0/1746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (OVERLAPS) 24/1476 variables, 12/1758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/1476 variables, 10/1768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/1476 variables, 3/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (INCLUDED_ONLY) 0/1476 variables, 0/1771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (OVERLAPS) 2/1478 variables, 1/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/1478 variables, 2/1774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/1478 variables, 2/1776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/1478 variables, 0/1776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (OVERLAPS) 20/1498 variables, 10/1786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (INCLUDED_ONLY) 0/1498 variables, 10/1796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/1498 variables, 3/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (INCLUDED_ONLY) 0/1498 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (OVERLAPS) 1/1499 variables, 1/1800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/1499 variables, 1/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/1499 variables, 1/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (INCLUDED_ONLY) 0/1499 variables, 0/1802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (OVERLAPS) 2/1501 variables, 1/1803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/1501 variables, 2/1805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (INCLUDED_ONLY) 0/1501 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (OVERLAPS) 24/1525 variables, 12/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/1525 variables, 10/1827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/1525 variables, 3/1830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/1525 variables, 0/1830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (OVERLAPS) 2/1527 variables, 1/1831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (INCLUDED_ONLY) 0/1527 variables, 2/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/1527 variables, 2/1835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/1527 variables, 0/1835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (OVERLAPS) 20/1547 variables, 10/1845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/1547 variables, 10/1855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/1547 variables, 3/1858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (INCLUDED_ONLY) 0/1547 variables, 0/1858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (OVERLAPS) 1/1548 variables, 1/1859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (INCLUDED_ONLY) 0/1548 variables, 1/1860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (INCLUDED_ONLY) 0/1548 variables, 1/1861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/1548 variables, 0/1861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (OVERLAPS) 2/1550 variables, 1/1862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (INCLUDED_ONLY) 0/1550 variables, 2/1864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/1550 variables, 0/1864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (OVERLAPS) 24/1574 variables, 12/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (INCLUDED_ONLY) 0/1574 variables, 10/1886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/1574 variables, 3/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (INCLUDED_ONLY) 0/1574 variables, 0/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (OVERLAPS) 2/1576 variables, 1/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (INCLUDED_ONLY) 0/1576 variables, 2/1892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (INCLUDED_ONLY) 0/1576 variables, 2/1894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (INCLUDED_ONLY) 0/1576 variables, 0/1894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (OVERLAPS) 20/1596 variables, 10/1904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (INCLUDED_ONLY) 0/1596 variables, 10/1914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (INCLUDED_ONLY) 0/1596 variables, 3/1917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/1596 variables, 0/1917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (OVERLAPS) 1/1597 variables, 1/1918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (INCLUDED_ONLY) 0/1597 variables, 1/1919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/1597 variables, 1/1920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (INCLUDED_ONLY) 0/1597 variables, 0/1920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (OVERLAPS) 2/1599 variables, 1/1921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/1599 variables, 2/1923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (INCLUDED_ONLY) 0/1599 variables, 0/1923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (OVERLAPS) 24/1623 variables, 12/1935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (INCLUDED_ONLY) 0/1623 variables, 10/1945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (INCLUDED_ONLY) 0/1623 variables, 3/1948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (INCLUDED_ONLY) 0/1623 variables, 0/1948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 341 (OVERLAPS) 2/1625 variables, 1/1949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 342 (INCLUDED_ONLY) 0/1625 variables, 2/1951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 343 (INCLUDED_ONLY) 0/1625 variables, 2/1953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/1625 variables, 0/1953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 345 (OVERLAPS) 20/1645 variables, 10/1963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 346 (INCLUDED_ONLY) 0/1645 variables, 10/1973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 347 (INCLUDED_ONLY) 0/1645 variables, 3/1976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 348 (INCLUDED_ONLY) 0/1645 variables, 0/1976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 349 (OVERLAPS) 1/1646 variables, 1/1977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 350 (INCLUDED_ONLY) 0/1646 variables, 1/1978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 351 (INCLUDED_ONLY) 0/1646 variables, 1/1979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 352 (INCLUDED_ONLY) 0/1646 variables, 0/1979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 353 (OVERLAPS) 2/1648 variables, 1/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 354 (INCLUDED_ONLY) 0/1648 variables, 2/1982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 355 (INCLUDED_ONLY) 0/1648 variables, 0/1982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 356 (OVERLAPS) 24/1672 variables, 12/1994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 357 (INCLUDED_ONLY) 0/1672 variables, 10/2004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 358 (INCLUDED_ONLY) 0/1672 variables, 3/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 359 (INCLUDED_ONLY) 0/1672 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 360 (OVERLAPS) 2/1674 variables, 1/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 361 (INCLUDED_ONLY) 0/1674 variables, 2/2010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 362 (INCLUDED_ONLY) 0/1674 variables, 2/2012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 363 (INCLUDED_ONLY) 0/1674 variables, 0/2012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 364 (OVERLAPS) 20/1694 variables, 10/2022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 365 (INCLUDED_ONLY) 0/1694 variables, 10/2032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 366 (INCLUDED_ONLY) 0/1694 variables, 3/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 367 (INCLUDED_ONLY) 0/1694 variables, 0/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 368 (OVERLAPS) 1/1695 variables, 1/2036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 369 (INCLUDED_ONLY) 0/1695 variables, 1/2037 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 370 (INCLUDED_ONLY) 0/1695 variables, 1/2038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 371 (INCLUDED_ONLY) 0/1695 variables, 0/2038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 372 (OVERLAPS) 2/1697 variables, 1/2039 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 373 (INCLUDED_ONLY) 0/1697 variables, 2/2041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 374 (INCLUDED_ONLY) 0/1697 variables, 0/2041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 375 (OVERLAPS) 24/1721 variables, 12/2053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 376 (INCLUDED_ONLY) 0/1721 variables, 10/2063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 377 (INCLUDED_ONLY) 0/1721 variables, 3/2066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:43:54] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 378 (INCLUDED_ONLY) 0/1721 variables, 1/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 379 (INCLUDED_ONLY) 0/1721 variables, 0/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 380 (OVERLAPS) 2/1723 variables, 1/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 381 (INCLUDED_ONLY) 0/1723 variables, 2/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 382 (INCLUDED_ONLY) 0/1723 variables, 2/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 383 (INCLUDED_ONLY) 0/1723 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 384 (OVERLAPS) 20/1743 variables, 10/2082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 385 (INCLUDED_ONLY) 0/1743 variables, 10/2092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 386 (INCLUDED_ONLY) 0/1743 variables, 3/2095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 387 (INCLUDED_ONLY) 0/1743 variables, 0/2095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 388 (OVERLAPS) 1/1744 variables, 1/2096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 389 (INCLUDED_ONLY) 0/1744 variables, 1/2097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 390 (INCLUDED_ONLY) 0/1744 variables, 1/2098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 391 (INCLUDED_ONLY) 0/1744 variables, 0/2098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 392 (OVERLAPS) 2/1746 variables, 1/2099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 393 (INCLUDED_ONLY) 0/1746 variables, 2/2101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 394 (INCLUDED_ONLY) 0/1746 variables, 0/2101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 395 (OVERLAPS) 24/1770 variables, 12/2113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 396 (INCLUDED_ONLY) 0/1770 variables, 10/2123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 397 (INCLUDED_ONLY) 0/1770 variables, 3/2126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 14:43:54] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 398 (INCLUDED_ONLY) 0/1770 variables, 1/2127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 399 (INCLUDED_ONLY) 0/1770 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 400 (OVERLAPS) 2/1772 variables, 1/2128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 401 (INCLUDED_ONLY) 0/1772 variables, 2/2130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 402 (INCLUDED_ONLY) 0/1772 variables, 2/2132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 403 (INCLUDED_ONLY) 0/1772 variables, 0/2132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 404 (OVERLAPS) 20/1792 variables, 10/2142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 405 (INCLUDED_ONLY) 0/1792 variables, 10/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 406 (INCLUDED_ONLY) 0/1792 variables, 3/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 407 (INCLUDED_ONLY) 0/1792 variables, 0/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 408 (OVERLAPS) 1/1793 variables, 1/2156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 409 (INCLUDED_ONLY) 0/1793 variables, 1/2157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 410 (INCLUDED_ONLY) 0/1793 variables, 1/2158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 411 (INCLUDED_ONLY) 0/1793 variables, 0/2158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 412 (OVERLAPS) 2/1795 variables, 1/2159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 413 (INCLUDED_ONLY) 0/1795 variables, 2/2161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 414 (INCLUDED_ONLY) 0/1795 variables, 0/2161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 415 (OVERLAPS) 24/1819 variables, 12/2173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 416 (INCLUDED_ONLY) 0/1819 variables, 10/2183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 417 (INCLUDED_ONLY) 0/1819 variables, 3/2186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 418 (INCLUDED_ONLY) 0/1819 variables, 0/2186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 419 (OVERLAPS) 2/1821 variables, 1/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 420 (INCLUDED_ONLY) 0/1821 variables, 2/2189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 421 (INCLUDED_ONLY) 0/1821 variables, 2/2191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 422 (INCLUDED_ONLY) 0/1821 variables, 0/2191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 423 (OVERLAPS) 20/1841 variables, 10/2201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 424 (INCLUDED_ONLY) 0/1841 variables, 10/2211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 425 (INCLUDED_ONLY) 0/1841 variables, 3/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 426 (INCLUDED_ONLY) 0/1841 variables, 0/2214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 427 (OVERLAPS) 1/1842 variables, 1/2215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 428 (INCLUDED_ONLY) 0/1842 variables, 1/2216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 429 (INCLUDED_ONLY) 0/1842 variables, 1/2217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 430 (INCLUDED_ONLY) 0/1842 variables, 0/2217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 431 (OVERLAPS) 2/1844 variables, 1/2218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 432 (INCLUDED_ONLY) 0/1844 variables, 2/2220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 433 (INCLUDED_ONLY) 0/1844 variables, 0/2220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 434 (OVERLAPS) 24/1868 variables, 12/2232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 435 (INCLUDED_ONLY) 0/1868 variables, 10/2242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 436 (INCLUDED_ONLY) 0/1868 variables, 3/2245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 437 (INCLUDED_ONLY) 0/1868 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 438 (OVERLAPS) 2/1870 variables, 1/2246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 439 (INCLUDED_ONLY) 0/1870 variables, 2/2248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 440 (INCLUDED_ONLY) 0/1870 variables, 2/2250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 441 (INCLUDED_ONLY) 0/1870 variables, 0/2250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 442 (OVERLAPS) 20/1890 variables, 10/2260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 443 (INCLUDED_ONLY) 0/1890 variables, 10/2270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 444 (INCLUDED_ONLY) 0/1890 variables, 3/2273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 445 (INCLUDED_ONLY) 0/1890 variables, 0/2273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 446 (OVERLAPS) 1/1891 variables, 1/2274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 447 (INCLUDED_ONLY) 0/1891 variables, 1/2275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 448 (INCLUDED_ONLY) 0/1891 variables, 1/2276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 449 (INCLUDED_ONLY) 0/1891 variables, 0/2276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 450 (OVERLAPS) 2/1893 variables, 1/2277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 451 (INCLUDED_ONLY) 0/1893 variables, 2/2279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 452 (INCLUDED_ONLY) 0/1893 variables, 0/2279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 453 (OVERLAPS) 24/1917 variables, 12/2291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 454 (INCLUDED_ONLY) 0/1917 variables, 10/2301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 455 (INCLUDED_ONLY) 0/1917 variables, 3/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 456 (INCLUDED_ONLY) 0/1917 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 457 (OVERLAPS) 2/1919 variables, 1/2305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 458 (INCLUDED_ONLY) 0/1919 variables, 2/2307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 459 (INCLUDED_ONLY) 0/1919 variables, 2/2309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 460 (INCLUDED_ONLY) 0/1919 variables, 0/2309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 461 (OVERLAPS) 20/1939 variables, 10/2319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 462 (INCLUDED_ONLY) 0/1939 variables, 10/2329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 463 (INCLUDED_ONLY) 0/1939 variables, 3/2332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 464 (INCLUDED_ONLY) 0/1939 variables, 0/2332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 465 (OVERLAPS) 1/1940 variables, 1/2333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 466 (INCLUDED_ONLY) 0/1940 variables, 1/2334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 467 (INCLUDED_ONLY) 0/1940 variables, 1/2335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 468 (INCLUDED_ONLY) 0/1940 variables, 0/2335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 469 (OVERLAPS) 2/1942 variables, 1/2336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 470 (INCLUDED_ONLY) 0/1942 variables, 2/2338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1942/1958 variables, and 2338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5011 ms.
Refiners :[Domain max(s): 989/999 constraints, Positive P Invariants (semi-flows): 356/360 constraints, State Equation: 987/999 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 7754ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 959/959 transitions.
Partial Free-agglomeration rule applied 234 times.
Drop transitions (Partial Free agglomeration) removed 234 transitions
Iterating global reduction 0 with 234 rules applied. Total rules applied 234 place count 999 transition count 959
Applied a total of 234 rules in 68 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 999/999 places, 959/959 transitions.
RANDOM walk for 40000 steps (8 resets) in 682 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 131843 steps, run visited all 1 properties in 1387 ms. (steps per millisecond=95 )
Probabilistic random walk after 131843 steps, saw 128396 distinct states, run finished after 1390 ms. (steps per millisecond=94 ) properties seen :1
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 11 factoid took 241 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 48 reset in 800 ms.
Product exploration explored 100000 steps with 48 reset in 957 ms.
Built C files in :
/tmp/ltsmin587785827759212646
[2024-05-28 14:43:59] [INFO ] Computing symmetric may disable matrix : 959 transitions.
[2024-05-28 14:43:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:43:59] [INFO ] Computing symmetric may enable matrix : 959 transitions.
[2024-05-28 14:43:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:44:00] [INFO ] Computing Do-Not-Accords matrix : 959 transitions.
[2024-05-28 14:44:00] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:44:00] [INFO ] Built C files in 194ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin587785827759212646
Running compilation step : cd /tmp/ltsmin587785827759212646;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin587785827759212646;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin587785827759212646;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 959/959 transitions.
Applied a total of 0 rules in 25 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-05-28 14:44:03] [INFO ] Invariant cache hit.
[2024-05-28 14:44:03] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-28 14:44:03] [INFO ] Invariant cache hit.
[2024-05-28 14:44:04] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
[2024-05-28 14:44:04] [INFO ] Redundant transitions in 139 ms returned []
Running 958 sub problems to find dead transitions.
[2024-05-28 14:44:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:44:18] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 14:44:18] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:44:18] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 14:44:18] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:44:19] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:44:19] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:44:19] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:44:19] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:44:19] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:44:19] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:44:20] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:44:20] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 14:44:20] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-05-28 14:44:20] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-28 14:44:21] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-28 14:44:21] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 14:44:21] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 14:44:21] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-28 14:44:21] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 14:44:22] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:44:25] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:44:25] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:44:25] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 3 ms to minimize.
[2024-05-28 14:44:26] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-28 14:44:26] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 3 ms to minimize.
[2024-05-28 14:44:26] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-05-28 14:44:26] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2024-05-28 14:44:27] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-05-28 14:44:27] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 3 ms to minimize.
[2024-05-28 14:44:27] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-28 14:44:28] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-28 14:44:28] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-28 14:44:29] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
[2024-05-28 14:44:29] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 3 ms to minimize.
[2024-05-28 14:44:29] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 3 ms to minimize.
[2024-05-28 14:44:30] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:44:30] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:44:31] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:44:31] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 1398 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30019 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:44:52] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 1/1399 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1958 variables, and 1399 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30019 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 40/40 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61848 ms. Remains : 999/999 places, 959/959 transitions.
Built C files in :
/tmp/ltsmin13867495161327493892
[2024-05-28 14:45:05] [INFO ] Computing symmetric may disable matrix : 959 transitions.
[2024-05-28 14:45:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:45:05] [INFO ] Computing symmetric may enable matrix : 959 transitions.
[2024-05-28 14:45:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:45:05] [INFO ] Computing Do-Not-Accords matrix : 959 transitions.
[2024-05-28 14:45:05] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 14:45:05] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13867495161327493892
Running compilation step : cd /tmp/ltsmin13867495161327493892;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13867495161327493892;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13867495161327493892;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 14:45:08] [INFO ] Flatten gal took : 48 ms
[2024-05-28 14:45:08] [INFO ] Flatten gal took : 45 ms
[2024-05-28 14:45:08] [INFO ] Time to serialize gal into /tmp/LTL3668412016890824646.gal : 13 ms
[2024-05-28 14:45:08] [INFO ] Time to serialize properties into /tmp/LTL14778886328529998082.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/LTL3668412016890824646.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4668655185313669992.hoa' '-atoms' '/tmp/LTL14778886328529998082.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/LTL14778886328529998082.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4668655185313669992.hoa
Detected timeout of ITS tools.
[2024-05-28 14:45:23] [INFO ] Flatten gal took : 39 ms
[2024-05-28 14:45:23] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:45:23] [INFO ] Time to serialize gal into /tmp/LTL1191128236898450393.gal : 9 ms
[2024-05-28 14:45:23] [INFO ] Time to serialize properties into /tmp/LTL12121585297840773289.ltl : 3 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/LTL1191128236898450393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12121585297840773289.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(F(("((p611==0)||(p615==0))")||(("(p626==0)")||((!("(((p736==1)&&(p740==1))&&(p751==1))"))U(("((!(((p611==1)&&(p615==1))&&(p626==1...255
Formula 0 simplified : FG(!"((p611==0)||(p615==0))" & !"(p626==0)" & ("(((p736==1)&&(p740==1))&&(p751==1))" M !"((!(((p611==1)&&(p615==1))&&(p626==1)))&&(!...195
Detected timeout of ITS tools.
[2024-05-28 14:45:38] [INFO ] Flatten gal took : 37 ms
[2024-05-28 14:45:38] [INFO ] Applying decomposition
[2024-05-28 14:45:38] [INFO ] Flatten gal took : 37 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/graph16980518547912795024.txt' '-o' '/tmp/graph16980518547912795024.bin' '-w' '/tmp/graph16980518547912795024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16980518547912795024.bin' '-l' '-1' '-v' '-w' '/tmp/graph16980518547912795024.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:45:38] [INFO ] Decomposing Gal with order
[2024-05-28 14:45:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:45:39] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-28 14:45:39] [INFO ] Flatten gal took : 105 ms
[2024-05-28 14:45:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 624 labels/synchronizations in 43 ms.
[2024-05-28 14:45:39] [INFO ] Time to serialize gal into /tmp/LTL18097139711565625083.gal : 15 ms
[2024-05-28 14:45:39] [INFO ] Time to serialize properties into /tmp/LTL17464190141758466511.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/LTL18097139711565625083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17464190141758466511.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 : !((G(F(("((i24.i1.u220.p611==0)||(i24.i1.u222.p615==0))")||(("(i24.i2.u225.p626==0)")||((!("(((i29.i2.u265.p736==1)&&(i29.i2.u267.p740...435
Formula 0 simplified : FG(!"((i24.i1.u220.p611==0)||(i24.i1.u222.p615==0))" & !"(i24.i2.u225.p626==0)" & ("(((i29.i2.u265.p736==1)&&(i29.i2.u267.p740==1))&...339
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-02 finished in 261778 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(!p0)&&p1)||X(G(!p0))))))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 30 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-28 14:45:54] [INFO ] Computed 361 invariants in 6 ms
[2024-05-28 14:45:54] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-28 14:45:54] [INFO ] Invariant cache hit.
[2024-05-28 14:45:55] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 14:45:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30017 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:46:39] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
[2024-05-28 14:46:40] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 14:46:40] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 14:46:40] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:46:40] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
[2024-05-28 14:46:40] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 14:46:41] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:46:41] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-28 14:46:41] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 4 ms to minimize.
[2024-05-28 14:46:41] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:46:41] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-28 14:46:42] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-28 14:46:42] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:46:42] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 14:46:42] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-28 14:46:42] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-28 14:46:43] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-28 14:46:43] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 14:46:43] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-05-28 14:46:43] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:46:46] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:46:47] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:46:47] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 4 ms to minimize.
[2024-05-28 14:46:47] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-28 14:46:48] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-28 14:46:48] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-05-28 14:46:48] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-28 14:46:48] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-28 14:46:49] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:46:49] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2024-05-28 14:46:49] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:46:50] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-28 14:46:50] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-05-28 14:46:51] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:46:51] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:46:51] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 3 ms to minimize.
[2024-05-28 14:46:52] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:46:52] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:46:53] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60350ms
Finished structural reductions in LTL mode , in 1 iterations and 61964 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 124 ms :[p0, p0, p0]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-03
Product exploration explored 100000 steps with 53 reset in 834 ms.
Product exploration explored 100000 steps with 50 reset in 1000 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, p0, p0]
RANDOM walk for 19333 steps (7 resets) in 198 ms. (97 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 180 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 104 ms :[p0, p0, p0]
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-28 14:46:59] [INFO ] Invariant cache hit.
[2024-05-28 14:46:59] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-28 14:46:59] [INFO ] Invariant cache hit.
[2024-05-28 14:47:00] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 14:47:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30018 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:47:44] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 14:47:44] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:47:44] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:47:45] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:47:45] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-28 14:47:45] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-28 14:47:45] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:47:45] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:47:46] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:47:46] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 14:47:46] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:47:46] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-28 14:47:46] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 14:47:47] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-28 14:47:47] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-28 14:47:47] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:47:47] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 14:47:48] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 14:47:48] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 14:47:48] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:47:51] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:47:51] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:47:52] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:47:52] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-28 14:47:52] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-28 14:47:53] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-05-28 14:47:53] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-05-28 14:47:53] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-05-28 14:47:54] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-05-28 14:47:55] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 4 ms to minimize.
[2024-05-28 14:47:55] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-05-28 14:47:55] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:47:56] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:47:56] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:47:57] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:47:57] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 4 ms to minimize.
[2024-05-28 14:47:58] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30018 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60318ms
Finished structural reductions in LTL mode , in 1 iterations and 61866 ms. Remains : 1003/1003 places, 963/963 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[p0, p0, p0]
RANDOM walk for 35389 steps (14 resets) in 670 ms. (52 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 202 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 50 reset in 768 ms.
Product exploration explored 100000 steps with 54 reset in 927 ms.
Built C files in :
/tmp/ltsmin14836212584692714180
[2024-05-28 14:48:03] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14836212584692714180
Running compilation step : cd /tmp/ltsmin14836212584692714180;'/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 2127 ms.
Running link step : cd /tmp/ltsmin14836212584692714180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14836212584692714180;'/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/stateBased1961001623959622832.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 18 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-28 14:48:18] [INFO ] Invariant cache hit.
[2024-05-28 14:48:19] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-28 14:48:19] [INFO ] Invariant cache hit.
[2024-05-28 14:48:20] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 14:48:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 1.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 1.0)
(s629 0.0)
(s630 0.0)
(s631 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30027 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:49:04] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:49:05] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:49:06] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:49:06] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:49:06] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:49:06] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 14:49:06] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:49:07] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:49:07] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 14:49:07] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 14:49:07] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 14:49:08] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:49:08] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-28 14:49:08] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-28 14:49:08] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:49:11] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:49:12] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-28 14:49:12] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-28 14:49:12] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:49:12] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-28 14:49:13] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-28 14:49:13] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-05-28 14:49:13] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
[2024-05-28 14:49:14] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-05-28 14:49:14] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:49:14] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 2 ms to minimize.
[2024-05-28 14:49:15] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 2 ms to minimize.
[2024-05-28 14:49:15] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-05-28 14:49:16] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:49:16] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
[2024-05-28 14:49:16] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 3 ms to minimize.
[2024-05-28 14:49:17] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 4 ms to minimize.
[2024-05-28 14:49:17] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 4 ms to minimize.
[2024-05-28 14:49:18] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30019 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60317ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Finished structural reductions in LTL mode , in 1 iterations and 61853 ms. Remains : 1003/1003 places, 963/963 transitions.
Built C files in :
/tmp/ltsmin3266461178552912657
[2024-05-28 14:49:20] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3266461178552912657
Running compilation step : cd /tmp/ltsmin3266461178552912657;'/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 2150 ms.
Running link step : cd /tmp/ltsmin3266461178552912657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3266461178552912657;'/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/stateBased17507869176914400458.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 14:49:36] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:49:36] [INFO ] Flatten gal took : 41 ms
[2024-05-28 14:49:36] [INFO ] Time to serialize gal into /tmp/LTL5727184188993137432.gal : 6 ms
[2024-05-28 14:49:36] [INFO ] Time to serialize properties into /tmp/LTL7750674860019903495.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/LTL5727184188993137432.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14560660632093342252.hoa' '-atoms' '/tmp/LTL7750674860019903495.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/LTL7750674860019903495.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14560660632093342252.hoa
Detected timeout of ITS tools.
[2024-05-28 14:49:51] [INFO ] Flatten gal took : 39 ms
[2024-05-28 14:49:51] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:49:51] [INFO ] Time to serialize gal into /tmp/LTL1689292390214730064.gal : 5 ms
[2024-05-28 14:49:51] [INFO ] Time to serialize properties into /tmp/LTL13053077404105477337.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/LTL1689292390214730064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13053077404105477337.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(("(((p688==0)||(p698==0))||(p702==0))")&&((X(G("(((p688==0)||(p698==0))||(p702==0))")))||(("((p386==1)&&(p390==1))")&&(("(p401==1...208
Formula 0 simplified : G(!"(((p688==0)||(p698==0))||(p702==0))" | (XF!"(((p688==0)||(p698==0))||(p702==0))" & (!"((p386==1)&&(p390==1))" | !"(p401==1)" | X...196
Detected timeout of ITS tools.
[2024-05-28 14:50:06] [INFO ] Flatten gal took : 38 ms
[2024-05-28 14:50:06] [INFO ] Applying decomposition
[2024-05-28 14:50:06] [INFO ] Flatten gal took : 38 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/graph1044383661053686977.txt' '-o' '/tmp/graph1044383661053686977.bin' '-w' '/tmp/graph1044383661053686977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1044383661053686977.bin' '-l' '-1' '-v' '-w' '/tmp/graph1044383661053686977.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:50:06] [INFO ] Decomposing Gal with order
[2024-05-28 14:50:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:50:06] [INFO ] Removed a total of 640 redundant transitions.
[2024-05-28 14:50:06] [INFO ] Flatten gal took : 56 ms
[2024-05-28 14:50:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 76 ms.
[2024-05-28 14:50:06] [INFO ] Time to serialize gal into /tmp/LTL2291328321917461758.gal : 11 ms
[2024-05-28 14:50:06] [INFO ] Time to serialize properties into /tmp/LTL5917821219873517985.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/LTL2291328321917461758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5917821219873517985.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...254
Read 1 LTL properties
Checking formula 0 : !((F(("(((i27.i0.u248.p688==0)||(i27.i0.u251.p698==0))||(i27.i0.u252.p702==0))")&&((X(G("(((i27.i0.u248.p688==0)||(i27.i0.u251.p698==0...352
Formula 0 simplified : G(!"(((i27.i0.u248.p688==0)||(i27.i0.u251.p698==0))||(i27.i0.u252.p702==0))" | (XF!"(((i27.i0.u248.p688==0)||(i27.i0.u251.p698==0))|...340
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-03 finished in 267358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(X((p2&&G(F(p3))))&&p1)))))'
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-28 14:50:21] [INFO ] Invariant cache hit.
[2024-05-28 14:50:22] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-28 14:50:22] [INFO ] Invariant cache hit.
[2024-05-28 14:50:23] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 14:50:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:51:06] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 14:51:07] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 14:51:07] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 14:51:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:51:07] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:51:07] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:51:07] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:51:08] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:51:08] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-05-28 14:51:08] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:51:08] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:51:08] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-28 14:51:09] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:51:09] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:51:09] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 14:51:09] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-28 14:51:09] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 14:51:10] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:51:10] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 14:51:10] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:51:13] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 14:51:13] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:51:14] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-28 14:51:14] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-28 14:51:14] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-28 14:51:14] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
[2024-05-28 14:51:15] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-28 14:51:15] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
[2024-05-28 14:51:15] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
[2024-05-28 14:51:16] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-05-28 14:51:16] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-05-28 14:51:16] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:51:17] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:51:17] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 3 ms to minimize.
[2024-05-28 14:51:18] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:51:18] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:51:18] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 3 ms to minimize.
[2024-05-28 14:51:19] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 3 ms to minimize.
[2024-05-28 14:51:19] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Finished structural reductions in LTL mode , in 1 iterations and 61813 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-05
Stuttering criterion allowed to conclude after 2033 steps with 0 reset in 17 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-05 finished in 62064 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)))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-28 14:51:23] [INFO ] Invariant cache hit.
[2024-05-28 14:51:24] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-28 14:51:24] [INFO ] Invariant cache hit.
[2024-05-28 14:51:25] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 14:51:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30025 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:52:09] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 14:52:09] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:52:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 14:52:09] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:52:10] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-28 14:52:10] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-28 14:52:10] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:52:10] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 14:52:10] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:52:10] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 14:52:11] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 14:52:11] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-28 14:52:11] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-28 14:52:11] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:52:11] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 14:52:12] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 14:52:12] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 14:52:12] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 14:52:12] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 14:52:13] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:52:16] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 14:52:16] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-28 14:52:16] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-28 14:52:16] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-28 14:52:17] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-28 14:52:17] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-05-28 14:52:17] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-05-28 14:52:18] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-05-28 14:52:18] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-05-28 14:52:18] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-28 14:52:19] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2024-05-28 14:52:19] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-28 14:52:19] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:52:20] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:52:20] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-28 14:52:21] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:52:21] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:52:21] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
[2024-05-28 14:52:22] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30023 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Finished structural reductions in LTL mode , in 1 iterations and 61804 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-06
Product exploration explored 100000 steps with 98 reset in 742 ms.
Product exploration explored 100000 steps with 99 reset in 883 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3883 steps (0 resets) in 43 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 14:52:27] [INFO ] Invariant cache hit.
[2024-05-28 14:52:28] [INFO ] [Real]Absence check using 361 positive place invariants in 180 ms returned sat
[2024-05-28 14:52:31] [INFO ] [Real]Absence check using state equation in 2266 ms returned sat
[2024-05-28 14:52:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:52:31] [INFO ] [Nat]Absence check using 361 positive place invariants in 149 ms returned sat
[2024-05-28 14:52:33] [INFO ] [Nat]Absence check using state equation in 1891 ms returned sat
[2024-05-28 14:52:33] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 58 ms.
Could not prove EG (NOT p0)
Support contains 1 out of 1003 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-28 14:52:46] [INFO ] Invariant cache hit.
[2024-05-28 14:52:46] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-28 14:52:46] [INFO ] Invariant cache hit.
[2024-05-28 14:52:47] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 14:52:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30018 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:53:31] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 14:53:31] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:53:32] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 14:53:32] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:53:32] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 14:53:32] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:53:32] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:53:32] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:53:33] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 14:53:33] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:53:33] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-28 14:53:33] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-28 14:53:33] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:53:34] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:53:34] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 14:53:34] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-28 14:53:34] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 14:53:35] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 14:53:35] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 14:53:35] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:53:38] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-28 14:53:38] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-28 14:53:39] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-28 14:53:39] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:53:39] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-28 14:53:39] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-05-28 14:53:40] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-05-28 14:53:40] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-05-28 14:53:40] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:53:41] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-05-28 14:53:41] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2024-05-28 14:53:41] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-28 14:53:42] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:53:42] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-28 14:53:43] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 4 ms to minimize.
[2024-05-28 14:53:43] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:53:43] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 3 ms to minimize.
[2024-05-28 14:53:44] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 4 ms to minimize.
[2024-05-28 14:53:44] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Finished structural reductions in LTL mode , in 1 iterations and 61818 ms. Remains : 1003/1003 places, 963/963 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4106 steps (0 resets) in 51 ms. (78 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 14:53:48] [INFO ] Invariant cache hit.
[2024-05-28 14:53:49] [INFO ] [Real]Absence check using 361 positive place invariants in 178 ms returned sat
[2024-05-28 14:53:51] [INFO ] [Real]Absence check using state equation in 2161 ms returned sat
[2024-05-28 14:53:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:53:52] [INFO ] [Nat]Absence check using 361 positive place invariants in 151 ms returned sat
[2024-05-28 14:53:53] [INFO ] [Nat]Absence check using state equation in 1857 ms returned sat
[2024-05-28 14:53:54] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 52 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 14:54:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 98 reset in 708 ms.
Product exploration explored 100000 steps with 100 reset in 853 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1003 transition count 963
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 106 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-28 14:54:08] [INFO ] Redundant transitions in 112 ms returned [955]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 961 sub problems to find dead transitions.
// Phase 1: matrix 962 rows 1003 cols
[2024-05-28 14:54:08] [INFO ] Computed 361 invariants in 4 ms
[2024-05-28 14:54:08] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 961 unsolved
(s994 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 1.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 1.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 1.0)
(s642 0.0)
(s643 1.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 1.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 1.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 1.0)
(s733 0.0)
(s734 1.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 1.0)
(s742 0.0)
(s743 1.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 1.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 1.0)
(s752 0.0)
(s753 1.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 1.0)
(s758 0.0)
(s759 1.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 1.0)
(s764 0.0)
(s765 0.0)
(s766 1.0)
(s767 0.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 1.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 0.0)
(s778 1.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 0.0)
(s784 1.0)
(s785 0.0)
(s786 1.0)
(s787 0.0)
(s788 1.0)
(s789 0.0)
(s790 0.0)
(s791 1.0)
(s792 0.0)
(s793 1.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 1.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 1.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 1.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 1.0)
(s812 0.0)
(s813 1.0)
(s814 0.0)
(s815 1.0)
(s816 0.0)
(s817 0.0)
(s818 1.0)
(s819 0.0)
(s820 0.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 1.0)
(s828 1.0)
(s829 0.0)
(s830 1.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 1.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 1.0)
(s844 0.0)
(s845 0.0)
(s846 1.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 1.0)
(s853 1.0)
(s854 0.0)
(s855 1.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 1.0)
(s862 0.0)
(s863 1.0)
(s864 0.0)
(s865 1.0)
(s866 0.0)
(s867 0.0)
(s868 1.0)
(s869 0.0)
(s870 0.0)
(s871 1.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 1.0)
(s878 1.0)
(s879 0.0)
(s880 1.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 1.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 0.0)
(s893 1.0)
(s894 0.0)
(s895 0.0)
(s896 1.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 1.0)
(s903 1.0)
(s904 0.0)
(s905 1.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 1.0)
(s912 0.0)
(s913 1.0)
(s914 0.0)
(s915 1.0)
(s916 0.0)
(s917 0.0)
(s918 1.0)
(s919 0.0)
(s920 0.0)
(s921 1.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 1.0)
(s928 1.0)
(s929 0.0)
(s930 1.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 1.0)
(s937 0.0)
(s938 1.0)
(s939 0.0)
(s940 1.0)
(s941 0.0)
(s942 0.0)
(s943 1.0)
(s944 0.0)
(s945 0.0)
(s946 1.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 1.0)
(s953 1.0)
(s954 0.0)
(s955 1.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 1.0)
(s962 0.0)
(s963 1.0)
(s964 0.0)
(s965 1.0)
(s966 0.0)
(s967 0.0)
(s968 1.0)
(s969 0.0)
(s970 0.0)
(s971 1.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 1.0)
(s978 1.0)
(s979 0.0)
(s980 0.0)
(s981 1.0)
(s982 0.0)
(s983 1.0)
(s984 0.0)
(s985 0.0)
(s986 1.0)
(s987 0.0)
(s988 1.0)
(s989 0.0)
(s990 1.0)
(s991 0.0)
(s992 0.0)
(s993 1.0)
(s994 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1965 variables, and 1364 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30026 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 14:54:52] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 14:54:52] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 14:54:52] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:54:52] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 14:54:53] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 14:54:53] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:54:53] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:54:53] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 14:54:53] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:54:54] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:54:54] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:54:54] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-28 14:54:54] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-28 14:54:54] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 14:54:55] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-28 14:54:55] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 14:54:55] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-28 14:54:55] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 14:54:56] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 14:54:56] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 14:54:59] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:54:59] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-28 14:54:59] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-28 14:55:00] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-28 14:55:00] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-05-28 14:55:00] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
[2024-05-28 14:55:00] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:55:01] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-05-28 14:55:01] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
[2024-05-28 14:55:02] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
[2024-05-28 14:55:02] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 5 ms to minimize.
[2024-05-28 14:55:02] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-28 14:55:03] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 2 ms to minimize.
[2024-05-28 14:55:03] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:55:03] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-28 14:55:04] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:55:04] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:55:05] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-05-28 14:55:05] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 3 ms to minimize.
[2024-05-28 14:55:05] [INFO ] Deduced a trap composed of 2 places in 196 ms of which 3 ms to minimize.
Problem TDEAD278 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1003 variables, 20/1404 constraints. Problems are: Problem set: 1 solved, 960 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1965 variables, and 1404 constraints, problems are : Problem set: 1 solved, 960 unsolved in 30026 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 40/40 constraints]
After SMT, in 60320ms problems are : Problem set: 1 solved, 960 unsolved
Search for dead transitions found 1 dead transitions in 60328ms
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 SI_LTL mode, iteration 1 : 1003/1003 places, 961/963 transitions.
Graph (complete) has 3520 edges and 1003 vertex of which 1002 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 45 ms. Remains 1002 /1003 variables (removed 1) and now considering 961/961 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1002/1003 places, 961/963 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60597 ms. Remains : 1002/1003 places, 961/963 transitions.
Built C files in :
/tmp/ltsmin9024453527433891639
[2024-05-28 14:55:08] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9024453527433891639
Running compilation step : cd /tmp/ltsmin9024453527433891639;'/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 2113 ms.
Running link step : cd /tmp/ltsmin9024453527433891639;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9024453527433891639;'/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/stateBased13573070338464936612.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 23 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-28 14:55:23] [INFO ] Computed 361 invariants in 7 ms
[2024-05-28 14:55:24] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-05-28 14:55:24] [INFO ] Invariant cache hit.
[2024-05-28 14:55:25] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1525 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 14:55:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30021 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:56:09] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 14:56:10] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:56:10] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:56:10] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-28 14:56:10] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 14:56:10] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 14:56:10] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 14:56:11] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 14:56:11] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:56:11] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 14:56:11] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 14:56:11] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-28 14:56:12] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 14:56:12] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:56:12] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 14:56:12] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 14:56:13] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-28 14:56:13] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:56:13] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 14:56:13] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:56:16] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-28 14:56:16] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-28 14:56:17] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:56:17] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-05-28 14:56:17] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:56:18] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-05-28 14:56:18] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-28 14:56:18] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-28 14:56:19] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2024-05-28 14:56:19] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 3 ms to minimize.
[2024-05-28 14:56:19] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-05-28 14:56:20] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:56:20] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-28 14:56:20] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:56:21] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 3 ms to minimize.
[2024-05-28 14:56:21] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 3 ms to minimize.
[2024-05-28 14:56:22] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 3 ms to minimize.
[2024-05-28 14:56:22] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 3 ms to minimize.
[2024-05-28 14:56:23] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30021 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Finished structural reductions in LTL mode , in 1 iterations and 61843 ms. Remains : 1003/1003 places, 963/963 transitions.
Built C files in :
/tmp/ltsmin17991655566586623273
[2024-05-28 14:56:25] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17991655566586623273
Running compilation step : cd /tmp/ltsmin17991655566586623273;'/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 2246 ms.
Running link step : cd /tmp/ltsmin17991655566586623273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17991655566586623273;'/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/stateBased4104689544859305709.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 14:56:40] [INFO ] Flatten gal took : 41 ms
[2024-05-28 14:56:40] [INFO ] Flatten gal took : 39 ms
[2024-05-28 14:56:41] [INFO ] Time to serialize gal into /tmp/LTL12197570935285961055.gal : 7 ms
[2024-05-28 14:56:41] [INFO ] Time to serialize properties into /tmp/LTL8109586866708355879.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/LTL12197570935285961055.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6739899225501062605.hoa' '-atoms' '/tmp/LTL8109586866708355879.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/LTL8109586866708355879.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6739899225501062605.hoa
Detected timeout of ITS tools.
[2024-05-28 14:56:56] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:56:56] [INFO ] Flatten gal took : 36 ms
[2024-05-28 14:56:56] [INFO ] Time to serialize gal into /tmp/LTL11175999027593788362.gal : 5 ms
[2024-05-28 14:56:56] [INFO ] Time to serialize properties into /tmp/LTL5203380056869834673.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/LTL11175999027593788362.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5203380056869834673.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("(p465==1)"))||(X("(((p863==1)&&(p871==1))&&(p875==1))"))))
Formula 0 simplified : G!"(p465==1)" & X!"(((p863==1)&&(p871==1))&&(p875==1))"
Detected timeout of ITS tools.
[2024-05-28 14:57:11] [INFO ] Flatten gal took : 42 ms
[2024-05-28 14:57:11] [INFO ] Applying decomposition
[2024-05-28 14:57:11] [INFO ] Flatten gal took : 38 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/graph5414772912811922152.txt' '-o' '/tmp/graph5414772912811922152.bin' '-w' '/tmp/graph5414772912811922152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5414772912811922152.bin' '-l' '-1' '-v' '-w' '/tmp/graph5414772912811922152.weights' '-q' '0' '-e' '0.001'
[2024-05-28 14:57:11] [INFO ] Decomposing Gal with order
[2024-05-28 14:57:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 14:57:11] [INFO ] Removed a total of 640 redundant transitions.
[2024-05-28 14:57:11] [INFO ] Flatten gal took : 54 ms
[2024-05-28 14:57:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 620 labels/synchronizations in 40 ms.
[2024-05-28 14:57:11] [INFO ] Time to serialize gal into /tmp/LTL13018225714012116963.gal : 11 ms
[2024-05-28 14:57:11] [INFO ] Time to serialize properties into /tmp/LTL17055779826471972301.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/LTL13018225714012116963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17055779826471972301.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("(i18.i1.u168.p465==1)"))||(X("(((i34.i2.u311.p863==1)&&(i34.i2.u314.p871==1))&&(i34.i2.u315.p875==1))"))))
Formula 0 simplified : G!"(i18.i1.u168.p465==1)" & X!"(((i34.i2.u311.p863==1)&&(i34.i2.u314.p871==1))&&(i34.i2.u315.p875==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-06 finished in 362783 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 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-28 14:57:26] [INFO ] Invariant cache hit.
[2024-05-28 14:57:27] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-05-28 14:57:27] [INFO ] Invariant cache hit.
[2024-05-28 14:57:28] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 14:57:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30021 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:58:12] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 5 ms to minimize.
[2024-05-28 14:58:12] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 14:58:12] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 14:58:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-28 14:58:12] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 14:58:12] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:58:13] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 14:58:13] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 14:58:13] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 14:58:13] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 14:58:13] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-28 14:58:14] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-28 14:58:14] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 14:58:14] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-28 14:58:14] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 14:58:15] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 14:58:15] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:58:15] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 14:58:15] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 14:58:16] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 14:58:19] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:58:19] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:58:19] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-28 14:58:20] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 14:58:20] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-05-28 14:58:20] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-05-28 14:58:21] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-05-28 14:58:21] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-05-28 14:58:21] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-05-28 14:58:22] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-28 14:58:22] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-05-28 14:58:22] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
[2024-05-28 14:58:23] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-05-28 14:58:23] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-28 14:58:23] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 3 ms to minimize.
[2024-05-28 14:58:24] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-05-28 14:58:24] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 4 ms to minimize.
[2024-05-28 14:58:25] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 4 ms to minimize.
[2024-05-28 14:58:25] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60314ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Finished structural reductions in LTL mode , in 1 iterations and 61911 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 2591 ms.
Product exploration explored 100000 steps with 50000 reset in 2674 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040A-LTLFireability-07 finished in 67311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1002 transition count 961
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 999 transition count 960
Applied a total of 5 rules in 49 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2024-05-28 14:58:33] [INFO ] Computed 360 invariants in 6 ms
[2024-05-28 14:58:34] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-28 14:58:34] [INFO ] Invariant cache hit.
[2024-05-28 14:58:35] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1559 ms to find 0 implicit places.
[2024-05-28 14:58:35] [INFO ] Redundant transitions in 100 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 958 sub problems to find dead transitions.
// Phase 1: matrix 959 rows 999 cols
[2024-05-28 14:58:35] [INFO ] Computed 360 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:58:49] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 14:58:49] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 14:58:49] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 14:58:49] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 14:58:50] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 14:58:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 14:58:50] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 14:58:50] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-28 14:58:50] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 14:58:51] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 14:58:51] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-28 14:58:51] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 14:58:51] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 14:58:51] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-28 14:58:52] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 14:58:52] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-28 14:58:52] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-05-28 14:58:52] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-28 14:58:53] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 14:58:53] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:58:56] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-28 14:58:56] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-05-28 14:58:57] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 14:58:57] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-28 14:58:57] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-05-28 14:58:58] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 14:58:58] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-05-28 14:58:58] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-05-28 14:58:59] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-05-28 14:58:59] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-05-28 14:58:59] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-28 14:59:00] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-05-28 14:59:00] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-28 14:59:00] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 4 ms to minimize.
[2024-05-28 14:59:01] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 3 ms to minimize.
[2024-05-28 14:59:01] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-28 14:59:02] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 3 ms to minimize.
[2024-05-28 14:59:02] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 4 ms to minimize.
[2024-05-28 14:59:02] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 1398 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30022 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 14:59:23] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 1/1399 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 1)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 1)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 1)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 1)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 1)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 1)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 1)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 1)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 1)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 1)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 1)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 1)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 1)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 1)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 0)
(s431 1)
(s432 0)
(s433 1)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 0)
(s442 1)
(s443 0)
(s444 1)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 1)
(s451 0)
(s452 1)
(s453 0)
(s454 1)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 1)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 1)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 1)
(s473 0)
(s474 1)
(s475 0)
(s476 0)
(s477 1)
(s478 0)
(s479 1)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 1)
(s486 0)
(s487 1)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 1)
(s493 0)
(s494 0)
(s495 1)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 1)
(s502 1)
(s503 0)
(s504 1)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 1)
(s511 0)
(s512 1)
(s513 0)
(s514 1)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 0)
(s520 1)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 1)
(s528 0)
(s529 1)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 1)
(s536 0)
(s537 1)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 1)
(s543 0)
(s544 0)
(s545 1)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 1)
(s552 1)
(s553 0)
(s554 1)
(s555 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1958 variables, and 1399 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30025 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 40/40 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Starting structural reductions in SI_LTL mode, iteration 1 : 999/1003 places, 959/963 transitions.
Applied a total of 0 rules in 40 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61992 ms. Remains : 999/1003 places, 959/963 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-08
Stuttering criterion allowed to conclude after 6437 steps with 5 reset in 54 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-08 finished in 62142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 53 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 14:59:36] [INFO ] Computed 361 invariants in 9 ms
[2024-05-28 14:59:36] [INFO ] Implicit Places using invariants in 521 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 523 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 598 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-09
Stuttering criterion allowed to conclude after 2054 steps with 0 reset in 20 ms.
FORMULA ShieldIIPs-PT-040A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLFireability-09 finished in 673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||X(p2))))))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 43 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
[2024-05-28 14:59:36] [INFO ] Invariant cache hit.
[2024-05-28 14:59:37] [INFO ] Implicit Places using invariants in 507 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 508 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 572 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-10
Product exploration explored 100000 steps with 99 reset in 742 ms.
Product exploration explored 100000 steps with 98 reset in 885 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
RANDOM walk for 7158 steps (0 resets) in 95 ms. (74 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 301 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 961 rows 1000 cols
[2024-05-28 14:59:39] [INFO ] Computed 360 invariants in 7 ms
[2024-05-28 14:59:40] [INFO ] [Real]Absence check using 360 positive place invariants in 208 ms returned sat
[2024-05-28 14:59:43] [INFO ] [Real]Absence check using state equation in 2489 ms returned sat
[2024-05-28 14:59:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 14:59:44] [INFO ] [Nat]Absence check using 360 positive place invariants in 211 ms returned sat
[2024-05-28 14:59:45] [INFO ] [Nat]Absence check using state equation in 1793 ms returned sat
[2024-05-28 14:59:46] [INFO ] Computed and/alt/rep : 882/3061/882 causal constraints (skipped 78 transitions) in 53 ms.
[2024-05-28 14:59:58] [INFO ] Added : 645 causal constraints over 129 iterations in 12326 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 28 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 14:59:58] [INFO ] Invariant cache hit.
[2024-05-28 14:59:58] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-28 14:59:58] [INFO ] Invariant cache hit.
[2024-05-28 14:59:59] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1513 ms to find 0 implicit places.
[2024-05-28 14:59:59] [INFO ] Redundant transitions in 87 ms returned [953]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 959 sub problems to find dead transitions.
// Phase 1: matrix 960 rows 1000 cols
[2024-05-28 14:59:59] [INFO ] Computed 360 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 1360 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:00:44] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:00:44] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:00:44] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:00:44] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 15:00:45] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:00:45] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:00:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:00:45] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:00:45] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-28 15:00:45] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:00:46] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:00:46] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:00:46] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 15:00:46] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:00:47] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:00:47] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:00:47] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:00:47] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:00:48] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:00:48] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:00:51] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:00:51] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:00:51] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:00:52] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:00:52] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:00:52] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-05-28 15:00:53] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:00:53] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-05-28 15:00:53] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-05-28 15:00:54] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-05-28 15:00:54] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 4 ms to minimize.
[2024-05-28 15:00:54] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 3 ms to minimize.
[2024-05-28 15:00:55] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:00:55] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
[2024-05-28 15:00:56] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:00:56] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
[2024-05-28 15:00:56] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-05-28 15:00:57] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 3 ms to minimize.
[2024-05-28 15:00:57] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 1399 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 39/39 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 960/961 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61971 ms. Remains : 1000/1000 places, 960/961 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
RANDOM walk for 7029 steps (0 resets) in 106 ms. (65 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2024-05-28 15:01:01] [INFO ] Invariant cache hit.
[2024-05-28 15:01:01] [INFO ] [Real]Absence check using 360 positive place invariants in 201 ms returned sat
[2024-05-28 15:01:04] [INFO ] [Real]Absence check using state equation in 2109 ms returned sat
[2024-05-28 15:01:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:01:04] [INFO ] [Nat]Absence check using 360 positive place invariants in 195 ms returned sat
[2024-05-28 15:01:06] [INFO ] [Nat]Absence check using state equation in 1467 ms returned sat
[2024-05-28 15:01:06] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:01:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2024-05-28 15:01:06] [INFO ] Computed and/alt/rep : 882/3066/882 causal constraints (skipped 77 transitions) in 54 ms.
[2024-05-28 15:01:19] [INFO ] Added : 655 causal constraints over 131 iterations in 12541 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 97 reset in 718 ms.
Product exploration explored 100000 steps with 98 reset in 871 ms.
Built C files in :
/tmp/ltsmin2432140523367065408
[2024-05-28 15:01:20] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-28 15:01:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:01:20] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-28 15:01:20] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:01:20] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-28 15:01:20] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:01:20] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2432140523367065408
Running compilation step : cd /tmp/ltsmin2432140523367065408;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2432140523367065408;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2432140523367065408;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-05-28 15:01:23] [INFO ] Invariant cache hit.
[2024-05-28 15:01:24] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-05-28 15:01:24] [INFO ] Invariant cache hit.
[2024-05-28 15:01:25] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2024-05-28 15:01:25] [INFO ] Redundant transitions in 87 ms returned []
Running 959 sub problems to find dead transitions.
[2024-05-28 15:01:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 1360 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30018 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:02:09] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:02:09] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:02:09] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:02:10] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:02:10] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-28 15:02:10] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:02:10] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:02:10] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:02:10] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:02:11] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:02:11] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:02:11] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:02:11] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-28 15:02:11] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:02:12] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:02:12] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:02:12] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:02:12] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:02:13] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:02:13] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:02:16] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:02:16] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:02:16] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-28 15:02:17] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:02:17] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-28 15:02:17] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:02:18] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-28 15:02:18] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-05-28 15:02:18] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:02:19] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-05-28 15:02:19] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-05-28 15:02:19] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-28 15:02:20] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:02:20] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:02:20] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-05-28 15:02:21] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-05-28 15:02:21] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2024-05-28 15:02:22] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-05-28 15:02:22] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 1399 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30024 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 39/39 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60335ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61931 ms. Remains : 1000/1000 places, 960/960 transitions.
Built C files in :
/tmp/ltsmin15734574113838465200
[2024-05-28 15:02:25] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-28 15:02:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:02:25] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-28 15:02:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:02:26] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-28 15:02:26] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:02:26] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15734574113838465200
Running compilation step : cd /tmp/ltsmin15734574113838465200;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15734574113838465200;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15734574113838465200;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:02:29] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:02:29] [INFO ] Flatten gal took : 34 ms
[2024-05-28 15:02:29] [INFO ] Time to serialize gal into /tmp/LTL11749651646337097594.gal : 4 ms
[2024-05-28 15:02:29] [INFO ] Time to serialize properties into /tmp/LTL13011728072826454519.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/LTL11749651646337097594.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17827913256784212837.hoa' '-atoms' '/tmp/LTL13011728072826454519.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/LTL13011728072826454519.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17827913256784212837.hoa
Detected timeout of ITS tools.
[2024-05-28 15:02:44] [INFO ] Flatten gal took : 34 ms
[2024-05-28 15:02:44] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:02:44] [INFO ] Time to serialize gal into /tmp/LTL12584683115739299099.gal : 4 ms
[2024-05-28 15:02:44] [INFO ] Time to serialize properties into /tmp/LTL13783829821973668453.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/LTL12584683115739299099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13783829821973668453.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("((p56==0)||(p67==0))"))&&(F(("((p364==1)&&(p385==1))")||(X("((p457==1)&&(p459==1))")))))))
Formula 0 simplified : F(G!"((p56==0)||(p67==0))" | G(!"((p364==1)&&(p385==1))" & X!"((p457==1)&&(p459==1))"))
Detected timeout of ITS tools.
[2024-05-28 15:02:59] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:02:59] [INFO ] Applying decomposition
[2024-05-28 15:02:59] [INFO ] Flatten gal took : 35 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/graph14770191100750225007.txt' '-o' '/tmp/graph14770191100750225007.bin' '-w' '/tmp/graph14770191100750225007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14770191100750225007.bin' '-l' '-1' '-v' '-w' '/tmp/graph14770191100750225007.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:02:59] [INFO ] Decomposing Gal with order
[2024-05-28 15:02:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:02:59] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-28 15:02:59] [INFO ] Flatten gal took : 60 ms
[2024-05-28 15:02:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 33 ms.
[2024-05-28 15:02:59] [INFO ] Time to serialize gal into /tmp/LTL13758405561454544260.gal : 10 ms
[2024-05-28 15:02:59] [INFO ] Time to serialize properties into /tmp/LTL1918401458169293881.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/LTL13758405561454544260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1918401458169293881.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((F("((i2.i2.u20.p56==0)||(i2.i2.u24.p67==0))"))&&(F(("((i14.i1.u132.p364==1)&&(i15.i2.u139.p385==1))")||(X("((i18.i2.u164.p457==1...188
Formula 0 simplified : F(G!"((i2.i2.u20.p56==0)||(i2.i2.u24.p67==0))" | G(!"((i14.i1.u132.p364==1)&&(i15.i2.u139.p385==1))" & X!"((i18.i2.u164.p457==1)&&(i...178
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-10 finished in 218008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(!p1)))) U p2))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 41 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 15:03:14] [INFO ] Computed 361 invariants in 2 ms
[2024-05-28 15:03:15] [INFO ] Implicit Places using invariants in 479 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 480 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 539 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-13
Product exploration explored 100000 steps with 80 reset in 724 ms.
Product exploration explored 100000 steps with 80 reset in 858 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 113 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
RANDOM walk for 11508 steps (2 resets) in 137 ms. (83 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 p0))), (F p2), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 282 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
// Phase 1: matrix 961 rows 1000 cols
[2024-05-28 15:03:18] [INFO ] Computed 360 invariants in 5 ms
[2024-05-28 15:03:18] [INFO ] [Real]Absence check using 360 positive place invariants in 289 ms returned sat
[2024-05-28 15:03:21] [INFO ] [Real]Absence check using state equation in 2212 ms returned sat
[2024-05-28 15:03:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:03:21] [INFO ] [Nat]Absence check using 360 positive place invariants in 194 ms returned sat
[2024-05-28 15:03:24] [INFO ] [Nat]Absence check using state equation in 2068 ms returned sat
[2024-05-28 15:03:24] [INFO ] Computed and/alt/rep : 882/3061/882 causal constraints (skipped 78 transitions) in 54 ms.
[2024-05-28 15:03:36] [INFO ] Added : 660 causal constraints over 132 iterations in 12098 ms. Result :unknown
Could not prove EG (NOT p2)
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:03:36] [INFO ] Invariant cache hit.
[2024-05-28 15:03:36] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-28 15:03:36] [INFO ] Invariant cache hit.
[2024-05-28 15:03:37] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1558 ms to find 0 implicit places.
[2024-05-28 15:03:37] [INFO ] Redundant transitions in 88 ms returned [953]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 959 sub problems to find dead transitions.
// Phase 1: matrix 960 rows 1000 cols
[2024-05-28 15:03:37] [INFO ] Computed 360 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 1360 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30020 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:04:21] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:04:22] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:04:22] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:04:22] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:04:22] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:04:22] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:04:22] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:04:23] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:04:23] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:04:23] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:04:23] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:04:23] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:04:24] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:04:24] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 15:04:24] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:04:24] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:04:25] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-28 15:04:25] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:04:25] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:04:25] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:04:28] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 3 ms to minimize.
[2024-05-28 15:04:28] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:04:29] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-28 15:04:29] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:04:29] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-05-28 15:04:30] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:04:30] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-05-28 15:04:30] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-05-28 15:04:31] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-05-28 15:04:31] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-05-28 15:04:31] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:04:32] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-28 15:04:32] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:04:32] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-05-28 15:04:33] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:04:33] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-28 15:04:34] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 3 ms to minimize.
[2024-05-28 15:04:34] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-05-28 15:04:34] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 1399 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30018 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 39/39 constraints]
After SMT, in 60305ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60313ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 960/961 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62003 ms. Remains : 1000/1000 places, 960/961 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 113 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
RANDOM walk for 11326 steps (2 resets) in 140 ms. (80 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 p0))), (F p2), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 276 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
[2024-05-28 15:04:39] [INFO ] Invariant cache hit.
[2024-05-28 15:04:39] [INFO ] [Real]Absence check using 360 positive place invariants in 276 ms returned sat
[2024-05-28 15:04:45] [INFO ] [Real]Absence check using state equation in 5113 ms returned sat
[2024-05-28 15:04:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:04:45] [INFO ] [Nat]Absence check using 360 positive place invariants in 198 ms returned sat
[2024-05-28 15:04:47] [INFO ] [Nat]Absence check using state equation in 1847 ms returned sat
[2024-05-28 15:04:47] [INFO ] Computed and/alt/rep : 882/3066/882 causal constraints (skipped 77 transitions) in 45 ms.
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p0), p1, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 80 reset in 691 ms.
Product exploration explored 100000 steps with 81 reset in 838 ms.
Built C files in :
/tmp/ltsmin9137697173743613537
[2024-05-28 15:05:01] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-28 15:05:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:05:01] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-28 15:05:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:05:01] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-28 15:05:01] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:05:01] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9137697173743613537
Running compilation step : cd /tmp/ltsmin9137697173743613537;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9137697173743613537;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9137697173743613537;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-05-28 15:05:05] [INFO ] Invariant cache hit.
[2024-05-28 15:05:05] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-28 15:05:05] [INFO ] Invariant cache hit.
[2024-05-28 15:05:06] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
[2024-05-28 15:05:06] [INFO ] Redundant transitions in 87 ms returned []
Running 959 sub problems to find dead transitions.
[2024-05-28 15:05:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 1360 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30020 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:05:50] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 15:05:50] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:05:50] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:05:51] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:05:51] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:05:51] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:05:51] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:05:51] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:05:51] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:05:52] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:05:52] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:05:52] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:05:52] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:05:52] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:05:53] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:05:53] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:05:53] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:05:53] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-28 15:05:54] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:05:54] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:05:57] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:05:57] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-28 15:05:57] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:05:58] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:05:58] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-05-28 15:05:58] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:05:58] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-05-28 15:05:59] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-28 15:05:59] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-28 15:05:59] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2024-05-28 15:06:00] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:06:00] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:06:01] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-05-28 15:06:01] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-05-28 15:06:01] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 4 ms to minimize.
[2024-05-28 15:06:02] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-05-28 15:06:02] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 4 ms to minimize.
[2024-05-28 15:06:02] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
[2024-05-28 15:06:03] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 1399 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30019 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 39/39 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61819 ms. Remains : 1000/1000 places, 960/960 transitions.
Built C files in :
/tmp/ltsmin16529869433644963821
[2024-05-28 15:06:06] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-28 15:06:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:06:06] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-28 15:06:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:06:06] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-28 15:06:06] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:06:06] [INFO ] Built C files in 144ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16529869433644963821
Running compilation step : cd /tmp/ltsmin16529869433644963821;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16529869433644963821;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16529869433644963821;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:06:10] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:06:10] [INFO ] Flatten gal took : 36 ms
[2024-05-28 15:06:10] [INFO ] Time to serialize gal into /tmp/LTL13883598934390760074.gal : 5 ms
[2024-05-28 15:06:10] [INFO ] Time to serialize properties into /tmp/LTL1332818460606513071.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/LTL13883598934390760074.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1188134739486972604.hoa' '-atoms' '/tmp/LTL1332818460606513071.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/LTL1332818460606513071.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1188134739486972604.hoa
Detected timeout of ITS tools.
[2024-05-28 15:06:25] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:06:25] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:06:25] [INFO ] Time to serialize gal into /tmp/LTL6537200241290762265.gal : 4 ms
[2024-05-28 15:06:25] [INFO ] Time to serialize properties into /tmp/LTL2351198636311081514.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/LTL6537200241290762265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2351198636311081514.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((F("(p326==0)"))&&(F(G(!("(((p88==1)&&(p96==1))&&(p102==1))"))))))U("((p754==1)&&(p769==1))")))
Formula 0 simplified : F(G!"(p326==0)" | GF"(((p88==1)&&(p96==1))&&(p102==1))") R !"((p754==1)&&(p769==1))"
Detected timeout of ITS tools.
[2024-05-28 15:06:40] [INFO ] Flatten gal took : 36 ms
[2024-05-28 15:06:40] [INFO ] Applying decomposition
[2024-05-28 15:06:40] [INFO ] Flatten gal took : 35 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/graph16613668710159968675.txt' '-o' '/tmp/graph16613668710159968675.bin' '-w' '/tmp/graph16613668710159968675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16613668710159968675.bin' '-l' '-1' '-v' '-w' '/tmp/graph16613668710159968675.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:06:40] [INFO ] Decomposing Gal with order
[2024-05-28 15:06:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:06:40] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-28 15:06:40] [INFO ] Flatten gal took : 48 ms
[2024-05-28 15:06:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 620 labels/synchronizations in 34 ms.
[2024-05-28 15:06:40] [INFO ] Time to serialize gal into /tmp/LTL4809664312151171510.gal : 12 ms
[2024-05-28 15:06:40] [INFO ] Time to serialize properties into /tmp/LTL12843511839123572994.ltl : 51 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/LTL4809664312151171510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12843511839123572994.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((F("(i12.i2.u117.p326==0)"))&&(F(G(!("(((i3.i0.u32.p88==1)&&(i3.i0.u35.p96==1))&&(i3.i0.u36.p102==1))"))))))U("((i30.i0.u271.p75...188
Formula 0 simplified : F(G!"(i12.i2.u117.p326==0)" | GF"(((i3.i0.u32.p88==1)&&(i3.i0.u35.p96==1))&&(i3.i0.u36.p102==1))") R !"((i30.i0.u271.p754==1)&&(i30....173
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-13 finished in 220990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (G(!p1)||(!p1&&G(F(!p2)))||G(!p0))))))))'
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 15 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-28 15:06:55] [INFO ] Computed 361 invariants in 4 ms
[2024-05-28 15:06:56] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-28 15:06:56] [INFO ] Invariant cache hit.
[2024-05-28 15:06:57] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 15:06:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30022 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 15:07:41] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:07:41] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:07:41] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:07:41] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 15:07:41] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 15:07:41] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-28 15:07:42] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:07:42] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:07:42] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:07:42] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:07:42] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:07:43] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:07:43] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:07:43] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:07:43] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 15:07:44] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 15:07:44] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:07:44] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-28 15:07:44] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:07:44] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 15:07:47] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:07:48] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:07:48] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:07:48] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:07:48] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:07:49] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:07:49] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-28 15:07:49] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:07:50] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:07:50] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-05-28 15:07:50] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-05-28 15:07:51] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-28 15:07:51] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:07:51] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:07:52] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:07:52] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:07:53] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2024-05-28 15:07:53] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
[2024-05-28 15:07:53] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30019 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Finished structural reductions in LTL mode , in 1 iterations and 61794 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 375 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-14
Product exploration explored 100000 steps with 100 reset in 742 ms.
Product exploration explored 100000 steps with 87 reset in 897 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 131 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
RANDOM walk for 40000 steps (16 resets) in 2123 ms. (18 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 429 ms. (93 steps per ms) remains 4/4 properties
[2024-05-28 15:08:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 979/1003 variables, 354/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 979/1364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 963/1966 variables, 1003/2367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1966 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1966 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1966/1966 variables, and 2367 constraints, problems are : Problem set: 0 solved, 4 unsolved in 630 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 979/1003 variables, 354/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 979/1364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 15:08:02] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:08:02] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-28 15:08:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:08:02] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:08:02] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:08:02] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:08:02] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 7/1371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 963/1966 variables, 1003/2374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1966 variables, 4/2378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 15:08:02] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1966 variables, 1/2379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1966 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1966 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1966/1966 variables, and 2379 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2464 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 3103ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 29819 ms.
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Partial Free-agglomeration rule applied 276 times.
Drop transitions (Partial Free agglomeration) removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 280 place count 1001 transition count 961
Applied a total of 280 rules in 57 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1001/1003 places, 961/963 transitions.
RANDOM walk for 40000 steps (8 resets) in 457 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 193348 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 1
Probabilistic random walk after 193348 steps, saw 159211 distinct states, run finished after 3004 ms. (steps per millisecond=64 ) properties seen :0
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 15:08:37] [INFO ] Computed 361 invariants in 43 ms
[2024-05-28 15:08:37] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 973/997 variables, 352/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 973/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/997 variables, 0/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/1001 variables, 2/1358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 4/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 961/1962 variables, 1001/2363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1962 variables, 4/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 2367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 973/997 variables, 352/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 973/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:08:38] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/997 variables, 1/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/997 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/1001 variables, 2/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 4/1363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1001 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 961/1962 variables, 1001/2364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 4/2368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1962 variables, 1/2369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:08:38] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 2 ms to minimize.
[2024-05-28 15:08:38] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2024-05-28 15:08:39] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:08:39] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2024-05-28 15:08:39] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 2 ms to minimize.
[2024-05-28 15:08:39] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 2 ms to minimize.
[2024-05-28 15:08:39] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:08:39] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:08:40] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-28 15:08:40] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:08:40] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-28 15:08:40] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:08:40] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:08:40] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1962 variables, 14/2383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:08:40] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1962 variables, 1/2384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1962 variables, 0/2384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1962 variables, 0/2384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 2384 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3102 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 3630ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1326 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1001/1001 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 20 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:08:42] [INFO ] Invariant cache hit.
[2024-05-28 15:08:42] [INFO ] Implicit Places using invariants in 580 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 581 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 961/961 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 620 ms. Remains : 1000/1001 places, 961/961 transitions.
RANDOM walk for 32690 steps (6 resets) in 325 ms. (100 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 21 factoid took 624 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 397 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-28 15:08:44] [INFO ] Computed 361 invariants in 13 ms
[2024-05-28 15:08:45] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-28 15:08:45] [INFO ] Invariant cache hit.
[2024-05-28 15:08:46] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 15:08:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30021 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 15:09:29] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:09:30] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:09:30] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 15:09:30] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:09:30] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-28 15:09:30] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:09:30] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:09:31] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:09:31] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:09:31] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:09:31] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-28 15:09:31] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-28 15:09:32] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:09:32] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:09:32] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:09:32] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:09:32] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:09:33] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:09:33] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-05-28 15:09:33] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 15:09:36] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:09:36] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:09:37] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:09:37] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:09:37] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:09:38] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 3 ms to minimize.
[2024-05-28 15:09:38] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-05-28 15:09:38] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 5 ms to minimize.
[2024-05-28 15:09:38] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-05-28 15:09:39] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:09:39] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:09:40] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2024-05-28 15:09:40] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:09:40] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:09:41] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 3 ms to minimize.
[2024-05-28 15:09:41] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:09:41] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2024-05-28 15:09:42] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-05-28 15:09:42] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30019 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60305ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Finished structural reductions in LTL mode , in 1 iterations and 61898 ms. Remains : 1003/1003 places, 963/963 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 134 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
RANDOM walk for 40000 steps (16 resets) in 2701 ms. (14 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 460 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 500 ms. (79 steps per ms) remains 4/4 properties
[2024-05-28 15:09:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 979/1003 variables, 354/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 979/1364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 963/1966 variables, 1003/2367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1966 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1966 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1966/1966 variables, and 2367 constraints, problems are : Problem set: 0 solved, 4 unsolved in 653 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 979/1003 variables, 354/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 979/1364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 15:09:49] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:09:49] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:09:49] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:09:49] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:09:49] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 15:09:49] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 15:09:49] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 7/1371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 963/1966 variables, 1003/2374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1966 variables, 4/2378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 15:09:49] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1966 variables, 1/2379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1966 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1966 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1966/1966 variables, and 2379 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2300 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 2966ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 23376 ms.
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Partial Free-agglomeration rule applied 276 times.
Drop transitions (Partial Free agglomeration) removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 280 place count 1001 transition count 961
Applied a total of 280 rules in 54 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1001/1003 places, 961/963 transitions.
RANDOM walk for 40000 steps (8 resets) in 874 ms. (45 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 15:10:14] [INFO ] Computed 361 invariants in 24 ms
[2024-05-28 15:10:14] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 973/997 variables, 352/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 973/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/997 variables, 0/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/1001 variables, 2/1358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 4/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 961/1962 variables, 1001/2363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1962 variables, 4/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 2367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 502 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 973/997 variables, 352/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 973/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:10:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/997 variables, 1/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/997 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/1001 variables, 2/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 4/1363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1001 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 961/1962 variables, 1001/2364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 4/2368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1962 variables, 1/2369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:10:16] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:10:16] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-05-28 15:10:16] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:10:16] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 3 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-28 15:10:17] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:10:18] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1962 variables, 14/2383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:10:18] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1962 variables, 1/2384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1962 variables, 0/2384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1962 variables, 0/2384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 2384 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3013 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 3552ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1337 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1001/1001 places, 961/961 transitions.
RANDOM walk for 40000 steps (8 resets) in 440 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 194633 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 1
Probabilistic random walk after 194633 steps, saw 159944 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-28 15:10:23] [INFO ] Invariant cache hit.
[2024-05-28 15:10:23] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 973/997 variables, 352/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 973/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/997 variables, 0/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/1001 variables, 2/1358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 4/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 961/1962 variables, 1001/2363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1962 variables, 4/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1962 variables, 0/2367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1962/1962 variables, and 2367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 973/997 variables, 352/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 973/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:10:23] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:10:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:10:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/997 variables, 3/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/997 variables, 0/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/1001 variables, 2/1361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 4/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1001 variables, 0/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 961/1962 variables, 1001/2366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1962 variables, 4/2370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1962 variables, 1/2371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:10:24] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:10:24] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:10:24] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-28 15:10:24] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:10:24] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:10:25] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-28 15:10:25] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:10:25] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:10:25] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1962 variables, 9/2380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:10:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1962 variables, 1/2381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1962 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1962 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1962/1962 variables, and 2381 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2316 ms.
Refiners :[Domain max(s): 1001/1001 constraints, Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1001/1001 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 2811ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1309 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1001/1001 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 26 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:10:27] [INFO ] Invariant cache hit.
[2024-05-28 15:10:27] [INFO ] Implicit Places using invariants in 577 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 578 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 961/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 622 ms. Remains : 1000/1001 places, 961/961 transitions.
RANDOM walk for 40000 steps (9 resets) in 391 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198324 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198324 steps, saw 161622 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 961 rows 1000 cols
[2024-05-28 15:10:31] [INFO ] Computed 360 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 972/996 variables, 351/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/996 variables, 972/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/996 variables, 0/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/1000 variables, 2/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 4/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 961/1961 variables, 1000/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1961 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1961 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1961/1961 variables, and 2360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 358/358 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1000/1000 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 972/996 variables, 351/382 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/996 variables, 972/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:10:31] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:10:31] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-28 15:10:31] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:10:31] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/996 variables, 4/1358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/996 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/1000 variables, 2/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 4/1364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1000 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 961/1961 variables, 1000/2364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1961 variables, 1/2365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:10:32] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:10:32] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:10:32] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:10:32] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:10:32] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-28 15:10:32] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:10:32] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:10:33] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1961 variables, 8/2373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1961 variables, 0/2373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1961 variables, 0/2373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1961/1961 variables, and 2373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1778 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 358/358 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 2254ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1226 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1000/1000 places, 961/961 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:10:34] [INFO ] Invariant cache hit.
[2024-05-28 15:10:35] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-28 15:10:35] [INFO ] Invariant cache hit.
[2024-05-28 15:10:36] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1822 ms to find 0 implicit places.
[2024-05-28 15:10:36] [INFO ] Redundant transitions in 14 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-28 15:10:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 2/1001 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (OVERLAPS) 1/1000 variables, 358/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
SMT process timed out in 30341ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 30350ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32208 ms. Remains : 1000/1000 places, 961/961 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 21 factoid took 558 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 385 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 328 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 101 reset in 746 ms.
Product exploration explored 100000 steps with 80 reset in 896 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 356 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1003 transition count 963
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 32 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-28 15:11:10] [INFO ] Redundant transitions in 89 ms returned [955]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 961 sub problems to find dead transitions.
// Phase 1: matrix 962 rows 1003 cols
[2024-05-28 15:11:10] [INFO ] Computed 361 invariants in 2 ms
[2024-05-28 15:11:10] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1965 variables, and 1364 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30021 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 15:11:54] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:11:54] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:11:54] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:11:54] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:11:55] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-28 15:11:55] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:11:55] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:11:55] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:11:55] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:11:56] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:11:56] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:11:56] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:11:56] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:11:56] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-28 15:11:57] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:11:57] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:11:57] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:11:57] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:11:58] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:11:58] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-28 15:12:01] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:12:01] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:12:01] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:12:02] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:12:02] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-28 15:12:02] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:12:03] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-05-28 15:12:03] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-28 15:12:03] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:12:04] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-05-28 15:12:04] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:12:04] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:12:05] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:12:05] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 4 ms to minimize.
[2024-05-28 15:12:05] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:12:06] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 4 ms to minimize.
[2024-05-28 15:12:06] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 3 ms to minimize.
[2024-05-28 15:12:07] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 4 ms to minimize.
[2024-05-28 15:12:07] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 4 ms to minimize.
[2024-05-28 15:12:07] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 3 ms to minimize.
Problem TDEAD278 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1003 variables, 20/1404 constraints. Problems are: Problem set: 1 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1965 variables, and 1404 constraints, problems are : Problem set: 1 solved, 960 unsolved in 30022 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 40/40 constraints]
After SMT, in 60320ms problems are : Problem set: 1 solved, 960 unsolved
Search for dead transitions found 1 dead transitions in 60328ms
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 SI_LTL mode, iteration 1 : 1003/1003 places, 961/963 transitions.
Graph (complete) has 3520 edges and 1003 vertex of which 1002 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 21 ms. Remains 1002 /1003 variables (removed 1) and now considering 961/961 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1002/1003 places, 961/963 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60480 ms. Remains : 1002/1003 places, 961/963 transitions.
Built C files in :
/tmp/ltsmin16827360314414548144
[2024-05-28 15:12:11] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16827360314414548144
Running compilation step : cd /tmp/ltsmin16827360314414548144;'/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 2101 ms.
Running link step : cd /tmp/ltsmin16827360314414548144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16827360314414548144;'/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/stateBased3017816274207747441.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-28 15:12:26] [INFO ] Computed 361 invariants in 4 ms
[2024-05-28 15:12:26] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-28 15:12:26] [INFO ] Invariant cache hit.
[2024-05-28 15:12:27] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1628 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-28 15:12:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 timeout
1.0)
(s392 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30021 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 15:13:11] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:13:11] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:13:11] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:13:12] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:13:12] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:13:12] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:13:12] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:13:12] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:13:12] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:13:13] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:13:13] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:13:13] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:13:13] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:13:13] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:13:14] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:13:14] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 4 ms to minimize.
[2024-05-28 15:13:14] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-28 15:13:14] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:13:15] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:13:15] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 15:13:18] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:13:18] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:13:19] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:13:19] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:13:19] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:13:19] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:13:20] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-05-28 15:13:20] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-05-28 15:13:20] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-28 15:13:21] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:13:21] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-05-28 15:13:21] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-28 15:13:22] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:13:22] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-05-28 15:13:22] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:13:23] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:13:23] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 4 ms to minimize.
[2024-05-28 15:13:24] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 4 ms to minimize.
[2024-05-28 15:13:24] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 1)
(s361 0)
(s362 1)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 1)
(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 1)
(s410 1)
(s411 0)
(s412 1)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 1)
(s436 0)
(s437 1)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 1)
(s460 1)
(s461 0)
(s462 1)
(s463 0)
(s464 1)
(s465 0)
(s466 0)
(s467 0)
(s468 1)
(s469 0)
(s470 1)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30024 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Finished structural reductions in LTL mode , in 1 iterations and 61959 ms. Remains : 1003/1003 places, 963/963 transitions.
Built C files in :
/tmp/ltsmin13092973188342339127
[2024-05-28 15:13:28] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13092973188342339127
Running compilation step : cd /tmp/ltsmin13092973188342339127;'/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 2110 ms.
Running link step : cd /tmp/ltsmin13092973188342339127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13092973188342339127;'/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/stateBased18060001020292983143.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 15:13:43] [INFO ] Flatten gal took : 36 ms
[2024-05-28 15:13:43] [INFO ] Flatten gal took : 37 ms
[2024-05-28 15:13:43] [INFO ] Time to serialize gal into /tmp/LTL3610013941848768084.gal : 5 ms
[2024-05-28 15:13:43] [INFO ] Time to serialize properties into /tmp/LTL5742852624310359334.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/LTL3610013941848768084.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10514643388276839450.hoa' '-atoms' '/tmp/LTL5742852624310359334.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/LTL5742852624310359334.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10514643388276839450.hoa
Detected timeout of ITS tools.
[2024-05-28 15:13:58] [INFO ] Flatten gal took : 36 ms
[2024-05-28 15:13:58] [INFO ] Flatten gal took : 36 ms
[2024-05-28 15:13:58] [INFO ] Time to serialize gal into /tmp/LTL1580472071276681245.gal : 5 ms
[2024-05-28 15:13:58] [INFO ] Time to serialize properties into /tmp/LTL15014834948987774994.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/LTL1580472071276681245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15014834948987774994.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(F((X((!("(((p113==1)&&(p123==1))&&(p127==1))"))U(((G(!("((p833==1)&&(p848==1))")))||((!("((p833==1)&&(p848==1))"))&&(G(F(!("((p73...274
Formula 0 simplified : FG(!"(((p113==0)||(p123==0))||(p127==0))" | X("(((p113==1)&&(p123==1))&&(p127==1))" M (F"((p833==1)&&(p848==1))" & ("((p833==1)&&(p8...196
Detected timeout of ITS tools.
[2024-05-28 15:14:13] [INFO ] Flatten gal took : 36 ms
[2024-05-28 15:14:13] [INFO ] Applying decomposition
[2024-05-28 15:14:13] [INFO ] Flatten gal took : 36 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/graph2575792008967157061.txt' '-o' '/tmp/graph2575792008967157061.bin' '-w' '/tmp/graph2575792008967157061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2575792008967157061.bin' '-l' '-1' '-v' '-w' '/tmp/graph2575792008967157061.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:14:13] [INFO ] Decomposing Gal with order
[2024-05-28 15:14:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:14:13] [INFO ] Removed a total of 640 redundant transitions.
[2024-05-28 15:14:13] [INFO ] Flatten gal took : 54 ms
[2024-05-28 15:14:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 620 labels/synchronizations in 33 ms.
[2024-05-28 15:14:13] [INFO ] Time to serialize gal into /tmp/LTL857722859406151617.gal : 10 ms
[2024-05-28 15:14:13] [INFO ] Time to serialize properties into /tmp/LTL10295379427742542886.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/LTL857722859406151617.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10295379427742542886.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("(((i4.i2.u41.p113==1)&&(i4.i2.u44.p123==1))&&(i4.i2.u45.p127==1))"))U(((G(!("((i33.i2.u300.p833==1)&&(i33.i2.u305.p848==...436
Formula 0 simplified : FG(!"(((i4.i2.u41.p113==0)||(i4.i2.u44.p123==0))||(i4.i2.u45.p127==0))" | X("(((i4.i2.u41.p113==1)&&(i4.i2.u44.p123==1))&&(i4.i2.u45...328
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-14 finished in 453129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 41 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 15:14:28] [INFO ] Computed 361 invariants in 6 ms
[2024-05-28 15:14:29] [INFO ] Implicit Places using invariants in 536 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 537 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 595 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-15
Product exploration explored 100000 steps with 52 reset in 787 ms.
Product exploration explored 100000 steps with 52 reset in 925 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7546 steps (0 resets) in 91 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-28 15:14:31] [INFO ] Computed 360 invariants in 4 ms
[2024-05-28 15:14:32] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-28 15:14:32] [INFO ] Invariant cache hit.
[2024-05-28 15:14:33] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1574 ms to find 0 implicit places.
[2024-05-28 15:14:33] [INFO ] Redundant transitions in 99 ms returned [953]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 959 sub problems to find dead transitions.
// Phase 1: matrix 960 rows 1000 cols
[2024-05-28 15:14:33] [INFO ] Computed 360 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 1360 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30020 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:15:17] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 15:15:17] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:15:17] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:15:17] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:15:18] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-28 15:15:18] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:15:18] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:15:18] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:15:18] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:15:18] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:15:19] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:15:19] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:15:19] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:15:19] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-28 15:15:19] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:15:20] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:15:20] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:15:20] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:15:20] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:15:21] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:15:24] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:15:24] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-28 15:15:24] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:15:24] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:15:25] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-05-28 15:15:25] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:15:25] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-05-28 15:15:26] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-28 15:15:26] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:15:26] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:15:27] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-05-28 15:15:27] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-28 15:15:27] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-05-28 15:15:28] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-05-28 15:15:28] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
[2024-05-28 15:15:29] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 3 ms to minimize.
[2024-05-28 15:15:29] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 3 ms to minimize.
[2024-05-28 15:15:30] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 4 ms to minimize.
[2024-05-28 15:15:30] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 1399 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30022 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 39/39 constraints]
After SMT, in 60307ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60316ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 960/961 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62034 ms. Remains : 1000/1000 places, 960/961 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7419 steps (0 resets) in 87 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 52 reset in 755 ms.
Product exploration explored 100000 steps with 52 reset in 907 ms.
Built C files in :
/tmp/ltsmin12328946497278017782
[2024-05-28 15:15:35] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-28 15:15:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:15:35] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-28 15:15:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:15:36] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-28 15:15:36] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:15:36] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12328946497278017782
Running compilation step : cd /tmp/ltsmin12328946497278017782;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12328946497278017782;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12328946497278017782;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 960/960 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-05-28 15:15:39] [INFO ] Invariant cache hit.
[2024-05-28 15:15:39] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-28 15:15:39] [INFO ] Invariant cache hit.
[2024-05-28 15:15:40] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2024-05-28 15:15:40] [INFO ] Redundant transitions in 88 ms returned []
Running 959 sub problems to find dead transitions.
[2024-05-28 15:15:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 1360 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-28 15:16:25] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:16:26] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:16:26] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:16:26] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:16:26] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:16:26] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:16:27] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:16:27] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:16:27] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:16:27] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:16:28] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-28 15:16:28] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:16:28] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:16:28] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:16:29] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:16:31] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:16:32] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:16:32] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-28 15:16:32] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:16:33] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:16:33] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:16:33] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-05-28 15:16:33] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:16:34] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-05-28 15:16:34] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 2 ms to minimize.
[2024-05-28 15:16:35] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
[2024-05-28 15:16:35] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-28 15:16:35] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-05-28 15:16:36] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:16:36] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:16:36] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 4 ms to minimize.
[2024-05-28 15:16:37] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 3 ms to minimize.
[2024-05-28 15:16:37] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
[2024-05-28 15:16:38] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 timeout
0)
(s148 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 1399 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30022 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 39/39 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61977 ms. Remains : 1000/1000 places, 960/960 transitions.
Built C files in :
/tmp/ltsmin13952326570047800668
[2024-05-28 15:16:41] [INFO ] Computing symmetric may disable matrix : 960 transitions.
[2024-05-28 15:16:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:16:41] [INFO ] Computing symmetric may enable matrix : 960 transitions.
[2024-05-28 15:16:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:16:41] [INFO ] Computing Do-Not-Accords matrix : 960 transitions.
[2024-05-28 15:16:41] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:16:41] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13952326570047800668
Running compilation step : cd /tmp/ltsmin13952326570047800668;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13952326570047800668;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13952326570047800668;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:16:44] [INFO ] Flatten gal took : 40 ms
[2024-05-28 15:16:44] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:16:44] [INFO ] Time to serialize gal into /tmp/LTL2977109878230083760.gal : 5 ms
[2024-05-28 15:16:44] [INFO ] Time to serialize properties into /tmp/LTL1033200976602737226.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/LTL2977109878230083760.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17315249556383744827.hoa' '-atoms' '/tmp/LTL1033200976602737226.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/LTL1033200976602737226.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17315249556383744827.hoa
Detected timeout of ITS tools.
[2024-05-28 15:16:59] [INFO ] Flatten gal took : 38 ms
[2024-05-28 15:16:59] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:16:59] [INFO ] Time to serialize gal into /tmp/LTL3327288760457540250.gal : 6 ms
[2024-05-28 15:16:59] [INFO ] Time to serialize properties into /tmp/LTL12978112083694577065.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/LTL3327288760457540250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12978112083694577065.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(F("((p14==0)||(p35==0))"))))
Formula 0 simplified : FG!"((p14==0)||(p35==0))"
Detected timeout of ITS tools.
[2024-05-28 15:17:14] [INFO ] Flatten gal took : 36 ms
[2024-05-28 15:17:14] [INFO ] Applying decomposition
[2024-05-28 15:17:14] [INFO ] Flatten gal took : 35 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/graph2511091157705382043.txt' '-o' '/tmp/graph2511091157705382043.bin' '-w' '/tmp/graph2511091157705382043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2511091157705382043.bin' '-l' '-1' '-v' '-w' '/tmp/graph2511091157705382043.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:17:14] [INFO ] Decomposing Gal with order
[2024-05-28 15:17:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:17:14] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-28 15:17:14] [INFO ] Flatten gal took : 45 ms
[2024-05-28 15:17:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 604 labels/synchronizations in 34 ms.
[2024-05-28 15:17:14] [INFO ] Time to serialize gal into /tmp/LTL13457753604610650035.gal : 10 ms
[2024-05-28 15:17:14] [INFO ] Time to serialize properties into /tmp/LTL5554981216895996961.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/LTL13457753604610650035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5554981216895996961.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(F("((i0.i2.u6.p14==0)||(i1.i1.u13.p35==0))"))))
Formula 0 simplified : FG!"((i0.i2.u6.p14==0)||(i1.i1.u13.p35==0))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-15 finished in 181097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p1 U (p2||G(!p1)))||p0))))'
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(!p0)&&p1)||X(G(!p0))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-040A-LTLFireability-03
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0]
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 56 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 15:17:30] [INFO ] Computed 361 invariants in 3 ms
[2024-05-28 15:17:30] [INFO ] Implicit Places using invariants in 559 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 560 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 634 ms. Remains : 1000/1003 places, 961/963 transitions.
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-03
Product exploration explored 100000 steps with 52 reset in 772 ms.
Product exploration explored 100000 steps with 51 reset in 919 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0]
RANDOM walk for 26775 steps (10 resets) in 717 ms. (37 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 266 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 158 ms :[p0, p0, p0]
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-28 15:17:33] [INFO ] Computed 360 invariants in 2 ms
[2024-05-28 15:17:34] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-28 15:17:34] [INFO ] Invariant cache hit.
[2024-05-28 15:17:35] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-05-28 15:17:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1961 variables, and 1360 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30019 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:18:18] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:18:19] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:18:19] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:18:19] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:18:19] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:18:19] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:18:19] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:18:20] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:18:20] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:18:20] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:18:20] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:18:20] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:18:21] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:18:21] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:18:21] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:18:21] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:18:22] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:18:22] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:18:22] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-28 15:18:22] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:18:25] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:18:26] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:18:26] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:18:26] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:18:27] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-28 15:18:27] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:18:27] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-05-28 15:18:28] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-28 15:18:28] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-05-28 15:18:28] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:18:29] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:18:29] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:18:29] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:18:30] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-05-28 15:18:30] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
[2024-05-28 15:18:30] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-05-28 15:18:31] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2024-05-28 15:18:31] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 4 ms to minimize.
[2024-05-28 15:18:32] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1961 variables, and 1399 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30027 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 39/39 constraints]
After SMT, in 60314ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Finished structural reductions in LTL mode , in 1 iterations and 61928 ms. Remains : 1000/1000 places, 961/961 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
RANDOM walk for 28610 steps (11 resets) in 588 ms. (48 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 193 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 115 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 124 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 52 reset in 815 ms.
Product exploration explored 100000 steps with 51 reset in 967 ms.
Built C files in :
/tmp/ltsmin4522032874709211741
[2024-05-28 15:18:38] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4522032874709211741
Running compilation step : cd /tmp/ltsmin4522032874709211741;'/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 2165 ms.
Running link step : cd /tmp/ltsmin4522032874709211741;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4522032874709211741;'/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/stateBased15739118651344328067.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:18:53] [INFO ] Invariant cache hit.
[2024-05-28 15:18:54] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-28 15:18:54] [INFO ] Invariant cache hit.
[2024-05-28 15:18:55] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-05-28 15:18:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 1.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 1.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 1.0)
(s642 0.0)
(s643 1.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 1.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 1.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1961 variables, and 1360 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30019 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:19:39] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:19:39] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:19:39] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:19:40] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:19:40] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:19:40] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:19:40] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:19:40] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:19:40] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:19:41] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:19:41] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:19:41] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:19:41] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:19:41] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:19:42] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:19:42] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:19:42] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:19:42] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:19:43] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:19:43] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:19:46] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:19:46] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:19:46] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-28 15:19:47] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:19:47] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-05-28 15:19:47] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-05-28 15:19:48] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:19:48] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-28 15:19:48] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-28 15:19:49] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:19:49] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-28 15:19:49] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:19:50] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:19:50] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 5 ms to minimize.
[2024-05-28 15:19:50] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-05-28 15:19:51] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:19:51] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 3 ms to minimize.
[2024-05-28 15:19:51] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 3 ms to minimize.
[2024-05-28 15:19:52] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1961 variables, and 1399 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30020 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 39/39 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Finished structural reductions in LTL mode , in 1 iterations and 61969 ms. Remains : 1000/1000 places, 961/961 transitions.
Built C files in :
/tmp/ltsmin9986148168446227472
[2024-05-28 15:19:55] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9986148168446227472
Running compilation step : cd /tmp/ltsmin9986148168446227472;'/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 2284 ms.
Running link step : cd /tmp/ltsmin9986148168446227472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9986148168446227472;'/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/stateBased87052775795264347.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 15:20:10] [INFO ] Flatten gal took : 34 ms
[2024-05-28 15:20:11] [INFO ] Flatten gal took : 34 ms
[2024-05-28 15:20:11] [INFO ] Time to serialize gal into /tmp/LTL1363330653270233918.gal : 4 ms
[2024-05-28 15:20:11] [INFO ] Time to serialize properties into /tmp/LTL12956506813661298550.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/LTL1363330653270233918.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11821704101100306259.hoa' '-atoms' '/tmp/LTL12956506813661298550.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/LTL12956506813661298550.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11821704101100306259.hoa
Detected timeout of ITS tools.
[2024-05-28 15:20:26] [INFO ] Flatten gal took : 34 ms
[2024-05-28 15:20:26] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:20:26] [INFO ] Time to serialize gal into /tmp/LTL11698288357442313322.gal : 5 ms
[2024-05-28 15:20:26] [INFO ] Time to serialize properties into /tmp/LTL3280437339543543621.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/LTL11698288357442313322.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3280437339543543621.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(("(((p688==0)||(p698==0))||(p702==0))")&&((X(G("(((p688==0)||(p698==0))||(p702==0))")))||(("((p386==1)&&(p390==1))")&&(("(p401==1...208
Formula 0 simplified : G(!"(((p688==0)||(p698==0))||(p702==0))" | (XF!"(((p688==0)||(p698==0))||(p702==0))" & (!"((p386==1)&&(p390==1))" | !"(p401==1)" | X...196
Detected timeout of ITS tools.
[2024-05-28 15:20:41] [INFO ] Flatten gal took : 34 ms
[2024-05-28 15:20:41] [INFO ] Applying decomposition
[2024-05-28 15:20:41] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12354584321788532637.txt' '-o' '/tmp/graph12354584321788532637.bin' '-w' '/tmp/graph12354584321788532637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12354584321788532637.bin' '-l' '-1' '-v' '-w' '/tmp/graph12354584321788532637.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:20:41] [INFO ] Decomposing Gal with order
[2024-05-28 15:20:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:20:41] [INFO ] Removed a total of 637 redundant transitions.
[2024-05-28 15:20:41] [INFO ] Flatten gal took : 44 ms
[2024-05-28 15:20:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 616 labels/synchronizations in 32 ms.
[2024-05-28 15:20:41] [INFO ] Time to serialize gal into /tmp/LTL13562960264863463406.gal : 59 ms
[2024-05-28 15:20:41] [INFO ] Time to serialize properties into /tmp/LTL14872072634156954977.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/LTL13562960264863463406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14872072634156954977.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(("(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0))||(i27.i1.u252.p702==0))")&&((X(G("(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0...352
Formula 0 simplified : G(!"(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0))||(i27.i1.u252.p702==0))" | (XF!"(((i27.i2.u248.p688==0)||(i27.i2.u251.p698==0))|...340
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-03 finished in 206493 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||X(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(!p1)))) U p2))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (G(!p1)||(!p1&&G(F(!p2)))||G(!p0))))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-040A-LTLFireability-14
Stuttering acceptance computed with spot in 353 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 38 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 15:20:57] [INFO ] Computed 361 invariants in 4 ms
[2024-05-28 15:20:57] [INFO ] Implicit Places using invariants in 480 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 482 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 537 ms. Remains : 1000/1003 places, 961/963 transitions.
Running random walk in product with property : ShieldIIPs-PT-040A-LTLFireability-14
Product exploration explored 100000 steps with 108 reset in 734 ms.
Product exploration explored 100000 steps with 96 reset in 876 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 120 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 439 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
RANDOM walk for 40000 steps (16 resets) in 1930 ms. (20 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 373 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
// Phase 1: matrix 961 rows 1000 cols
[2024-05-28 15:21:01] [INFO ] Computed 360 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 976/1000 variables, 353/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 976/1360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 961/1961 variables, 1000/2360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1961 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1961 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1961/1961 variables, and 2360 constraints, problems are : Problem set: 0 solved, 4 unsolved in 677 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 976/1000 variables, 353/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 976/1360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 961/1961 variables, 1000/2360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1961 variables, 4/2364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 15:21:02] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1961 variables, 1/2365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1961 variables, 0/2365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 15:21:03] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/1961 variables, 1/2366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1961 variables, 0/2366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1961 variables, 0/2366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1961/1961 variables, and 2366 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2130 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 2823ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 20829 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Partial Free-agglomeration rule applied 276 times.
Drop transitions (Partial Free agglomeration) removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 276 place count 1000 transition count 961
Applied a total of 276 rules in 32 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1000/1000 places, 961/961 transitions.
RANDOM walk for 38604 steps (8 resets) in 790 ms. (48 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 21 factoid took 566 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 394 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 425 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:21:26] [INFO ] Invariant cache hit.
[2024-05-28 15:21:26] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-28 15:21:26] [INFO ] Invariant cache hit.
[2024-05-28 15:21:27] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-05-28 15:21:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1961 variables, and 1360 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30017 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:22:11] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:22:11] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:22:12] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 15:22:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:22:12] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:22:12] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:22:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:22:13] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:22:13] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:22:13] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:22:13] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-28 15:22:13] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-28 15:22:14] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:22:14] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:22:14] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:22:14] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:22:15] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:22:15] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:22:15] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-05-28 15:22:15] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:22:18] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:22:19] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:22:19] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:22:19] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:22:20] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:22:20] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-05-28 15:22:20] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:22:20] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:22:21] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:22:21] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2024-05-28 15:22:22] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-05-28 15:22:22] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:22:22] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:22:23] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-05-28 15:22:23] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 3 ms to minimize.
[2024-05-28 15:22:23] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2024-05-28 15:22:24] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2024-05-28 15:22:24] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 3 ms to minimize.
[2024-05-28 15:22:25] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1961 variables, and 1399 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30022 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 39/39 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Finished structural reductions in LTL mode , in 1 iterations and 61826 ms. Remains : 1000/1000 places, 961/961 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 142 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 432 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
RANDOM walk for 40000 steps (17 resets) in 1917 ms. (20 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
[2024-05-28 15:22:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 976/1000 variables, 353/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 976/1360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 961/1961 variables, 1000/2360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1961 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1961 variables, 0/2360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1961/1961 variables, and 2360 constraints, problems are : Problem set: 0 solved, 4 unsolved in 640 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 17/24 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 976/1000 variables, 353/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 976/1360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:22:30] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 3/1363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 961/1961 variables, 1000/2363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1961 variables, 4/2367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 15:22:31] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1961 variables, 1/2368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1961 variables, 0/2368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1961 variables, 0/2368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1961/1961 variables, and 2368 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2280 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 2929ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 11582 ms.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Partial Free-agglomeration rule applied 276 times.
Drop transitions (Partial Free agglomeration) removed 276 transitions
Iterating global reduction 0 with 276 rules applied. Total rules applied 276 place count 1000 transition count 961
Applied a total of 276 rules in 39 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1000/1000 places, 961/961 transitions.
RANDOM walk for 32606 steps (7 resets) in 703 ms. (46 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 21 factoid took 585 ms. Reduced automaton from 9 states, 36 edges and 3 AP (stutter sensitive) to 9 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 410 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 387 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 394 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 96 reset in 729 ms.
Product exploration explored 100000 steps with 80 reset in 878 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 363 ms :[p0, p0, (AND p0 p1), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p2), (AND p0 p2)]
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:22:48] [INFO ] Redundant transitions in 95 ms returned [953]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 959 sub problems to find dead transitions.
// Phase 1: matrix 960 rows 1000 cols
[2024-05-28 15:22:48] [INFO ] Computed 360 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1960 variables, and 1360 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30033 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:23:33] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:23:33] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:23:33] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:23:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:23:33] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:23:33] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:23:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-05-28 15:23:34] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:23:34] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:23:34] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:23:34] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:23:35] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:23:35] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 15:23:35] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:23:35] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 15:23:36] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-28 15:23:36] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:23:36] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:23:36] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 15:23:37] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:23:39] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:23:40] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:23:40] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:23:40] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-05-28 15:23:41] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
[2024-05-28 15:23:41] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-05-28 15:23:41] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:23:42] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-28 15:23:42] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-28 15:23:42] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-05-28 15:23:43] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
[2024-05-28 15:23:43] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:23:43] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 3 ms to minimize.
[2024-05-28 15:23:44] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-05-28 15:23:44] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 4 ms to minimize.
[2024-05-28 15:23:45] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 3 ms to minimize.
[2024-05-28 15:23:45] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 4 ms to minimize.
[2024-05-28 15:23:45] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 3 ms to minimize.
[2024-05-28 15:23:46] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1960 variables, and 1399 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30024 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 39/39 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 960/961 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60474 ms. Remains : 1000/1000 places, 960/961 transitions.
Built C files in :
/tmp/ltsmin5398979782442719819
[2024-05-28 15:23:48] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5398979782442719819
Running compilation step : cd /tmp/ltsmin5398979782442719819;'/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 2125 ms.
Running link step : cd /tmp/ltsmin5398979782442719819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5398979782442719819;'/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/stateBased6642964699490213224.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2024-05-28 15:24:04] [INFO ] Computed 360 invariants in 6 ms
[2024-05-28 15:24:04] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-28 15:24:04] [INFO ] Invariant cache hit.
[2024-05-28 15:24:05] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-05-28 15:24:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1961 variables, and 1360 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30018 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 1/1000 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 1/1360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:24:49] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:24:50] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:24:50] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:24:50] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-28 15:24:50] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-28 15:24:50] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:24:51] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-28 15:24:51] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:24:51] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:24:51] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:24:51] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-28 15:24:52] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:24:52] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:24:52] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:24:52] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:24:53] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:24:53] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:24:53] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:24:53] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:24:54] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/1380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:24:57] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:24:57] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:24:57] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:24:57] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-05-28 15:24:58] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:24:58] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-28 15:24:58] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-05-28 15:24:59] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-05-28 15:24:59] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-05-28 15:24:59] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 4 ms to minimize.
[2024-05-28 15:25:00] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:25:00] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:25:01] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:25:01] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:25:01] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
[2024-05-28 15:25:02] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 4 ms to minimize.
[2024-05-28 15:25:02] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 3 ms to minimize.
[2024-05-28 15:25:03] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 4 ms to minimize.
[2024-05-28 15:25:03] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1961 variables, and 1399 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30020 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 39/39 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Finished structural reductions in LTL mode , in 1 iterations and 61851 ms. Remains : 1000/1000 places, 961/961 transitions.
Built C files in :
/tmp/ltsmin6247537366569702929
[2024-05-28 15:25:05] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6247537366569702929
Running compilation step : cd /tmp/ltsmin6247537366569702929;'/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 2089 ms.
Running link step : cd /tmp/ltsmin6247537366569702929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6247537366569702929;'/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/stateBased6006526392916915495.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 15:25:21] [INFO ] Flatten gal took : 37 ms
[2024-05-28 15:25:21] [INFO ] Flatten gal took : 37 ms
[2024-05-28 15:25:21] [INFO ] Time to serialize gal into /tmp/LTL4130775506801546879.gal : 4 ms
[2024-05-28 15:25:21] [INFO ] Time to serialize properties into /tmp/LTL7605864311098431521.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/LTL4130775506801546879.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3992195980683611787.hoa' '-atoms' '/tmp/LTL7605864311098431521.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...317
Loading property file /tmp/LTL7605864311098431521.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3992195980683611787.hoa
Detected timeout of ITS tools.
[2024-05-28 15:25:36] [INFO ] Flatten gal took : 42 ms
[2024-05-28 15:25:36] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:25:36] [INFO ] Time to serialize gal into /tmp/LTL182416217047615691.gal : 5 ms
[2024-05-28 15:25:36] [INFO ] Time to serialize properties into /tmp/LTL16345953449203238829.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/LTL182416217047615691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16345953449203238829.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(F((X((!("(((p113==1)&&(p123==1))&&(p127==1))"))U(((G(!("((p833==1)&&(p848==1))")))||((!("((p833==1)&&(p848==1))"))&&(G(F(!("((p73...274
Formula 0 simplified : FG(!"(((p113==0)||(p123==0))||(p127==0))" | X("(((p113==1)&&(p123==1))&&(p127==1))" M (F"((p833==1)&&(p848==1))" & ("((p833==1)&&(p8...196
Detected timeout of ITS tools.
[2024-05-28 15:25:51] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:25:51] [INFO ] Applying decomposition
[2024-05-28 15:25:51] [INFO ] Flatten gal took : 35 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/graph5825533516016278971.txt' '-o' '/tmp/graph5825533516016278971.bin' '-w' '/tmp/graph5825533516016278971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5825533516016278971.bin' '-l' '-1' '-v' '-w' '/tmp/graph5825533516016278971.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:25:51] [INFO ] Decomposing Gal with order
[2024-05-28 15:25:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:25:51] [INFO ] Removed a total of 637 redundant transitions.
[2024-05-28 15:25:51] [INFO ] Flatten gal took : 54 ms
[2024-05-28 15:25:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 624 labels/synchronizations in 32 ms.
[2024-05-28 15:25:51] [INFO ] Time to serialize gal into /tmp/LTL4284250153048463102.gal : 10 ms
[2024-05-28 15:25:51] [INFO ] Time to serialize properties into /tmp/LTL15004839989952573866.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/LTL4284250153048463102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15004839989952573866.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(F((X((!("(((i4.i1.u41.p113==1)&&(i4.i1.u44.p123==1))&&(i4.i1.u45.p127==1))"))U(((G(!("((i33.i1.u300.p833==1)&&(i33.i1.u305.p848==...436
Formula 0 simplified : FG(!"(((i4.i1.u41.p113==0)||(i4.i1.u44.p123==0))||(i4.i1.u45.p127==0))" | X("(((i4.i1.u41.p113==1)&&(i4.i1.u44.p123==1))&&(i4.i1.u45...328
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040A-LTLFireability-14 finished in 309757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-28 15:26:06] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15481481326000756337
[2024-05-28 15:26:06] [INFO ] Computing symmetric may disable matrix : 963 transitions.
[2024-05-28 15:26:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:26:06] [INFO ] Computing symmetric may enable matrix : 963 transitions.
[2024-05-28 15:26:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:26:06] [INFO ] Applying decomposition
[2024-05-28 15:26:06] [INFO ] Flatten gal took : 37 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/graph788817118378653926.txt' '-o' '/tmp/graph788817118378653926.bin' '-w' '/tmp/graph788817118378653926.weights'
[2024-05-28 15:26:06] [INFO ] Computing Do-Not-Accords matrix : 963 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph788817118378653926.bin' '-l' '-1' '-v' '-w' '/tmp/graph788817118378653926.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:26:06] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:26:06] [INFO ] Decomposing Gal with order
[2024-05-28 15:26:06] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15481481326000756337
Running compilation step : cd /tmp/ltsmin15481481326000756337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '102' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 15:26:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:26:07] [INFO ] Removed a total of 640 redundant transitions.
[2024-05-28 15:26:07] [INFO ] Flatten gal took : 46 ms
[2024-05-28 15:26:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 620 labels/synchronizations in 32 ms.
[2024-05-28 15:26:07] [INFO ] Time to serialize gal into /tmp/LTLFireability3446213858559643685.gal : 11 ms
[2024-05-28 15:26:07] [INFO ] Time to serialize properties into /tmp/LTLFireability15318728678030599395.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/LTLFireability3446213858559643685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15318728678030599395.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 7 LTL properties
Checking formula 0 : !((G(F(("((i24.i1.u220.p611==0)||(i24.i1.u222.p615==0))")||(("(i24.i1.u225.p626==0)")||((!("(((i29.i2.u265.p736==1)&&(i29.i2.u267.p740...435
Formula 0 simplified : FG(!"((i24.i1.u220.p611==0)||(i24.i1.u222.p615==0))" & !"(i24.i1.u225.p626==0)" & ("(((i29.i2.u265.p736==1)&&(i29.i2.u267.p740==1))&...339
Compilation finished in 3264 ms.
Running link step : cd /tmp/ltsmin15481481326000756337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin15481481326000756337;'/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' '--ltl' '[](<>(((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin15481481326000756337;'/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' '--ltl' '[](<>(((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15481481326000756337;'/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' '<>((!(LTLAPp3==true)&&((X(!(LTLAPp3==true))&&(LTLAPp4==true))||X([](!(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin15481481326000756337;'/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' '<>((!(LTLAPp3==true)&&((X(!(LTLAPp3==true))&&(LTLAPp4==true))||X([](!(LTLAPp3==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15481481326000756337;'/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' '(<>((LTLAPp5==true))||X((LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin15481481326000756337;'/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' '(<>((LTLAPp5==true))||X((LTLAPp6==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15481481326000756337;'/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))&&<>(((LTLAPp8==true)||X((LTLAPp9==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin15481481326000756337;'/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))&&<>(((LTLAPp8==true)||X((LTLAPp9==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15481481326000756337;'/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' '--ltl' '([]((<>((LTLAPp10==true))&&<>([](!(LTLAPp11==true))))) U (LTLAPp12==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin15481481326000756337;'/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' '--ltl' '([]((<>((LTLAPp10==true))&&<>([](!(LTLAPp11==true))))) U (LTLAPp12==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15481481326000756337;'/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' '[](<>((!(LTLAPp13==true)&&X((!(LTLAPp13==true) U ([](!(LTLAPp14==true))||(!(LTLAPp14==true)&&[](<>(!(LTLAPp15==true))))||[](!(LTLAPp13==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin15481481326000756337;'/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' '[](<>((!(LTLAPp13==true)&&X((!(LTLAPp13==true) U ([](!(LTLAPp14==true))||(!(LTLAPp14==true)&&[](<>(!(LTLAPp15==true))))||[](!(LTLAPp13==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15481481326000756337;'/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' '--ltl' '[](<>((LTLAPp16==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin15481481326000756337;'/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' '--ltl' '[](<>((LTLAPp16==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4112 s
Running LTSmin : cd /tmp/ltsmin15481481326000756337;'/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' '--ltl' '[](<>(((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
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