Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 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 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J30-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S10J30-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716933170663

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 21:52:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:52:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:52:52] [INFO ] Load time of PNML (sax parser for PT used): 652 ms
[2024-05-28 21:52:52] [INFO ] Transformed 664 places.
[2024-05-28 21:52:52] [INFO ] Transformed 12050 transitions.
[2024-05-28 21:52:52] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 882 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 107 ms.
[2024-05-28 21:52:53] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 21:52:53] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 21:52:53] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 21:52:53] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 21:52:53] [INFO ] Reduced 780 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 628 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 58 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-05-28 21:52:53] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-05-28 21:52:53] [INFO ] Computed 92 invariants in 112 ms
[2024-05-28 21:52:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 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 Real declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20102 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 58186ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 58246ms
[2024-05-28 21:53:51] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:53:51] [INFO ] Invariant cache hit.
[2024-05-28 21:53:51] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-28 21:53:51] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:53:51] [INFO ] Invariant cache hit.
[2024-05-28 21:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:53:52] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-28 21:53:52] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:53:52] [INFO ] Invariant cache hit.
[2024-05-28 21:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2595 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
[2024-05-28 21:54:58] [INFO ] Deduced a trap composed of 19 places in 874 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2595 variables, and 72 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 1/1 constraints]
After SMT, in 82824ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 82869ms
Finished structural reductions in LTL mode , in 1 iterations and 142359 ms. Remains : 664/664 places, 1940/1940 transitions.
Support contains 628 out of 664 places after structural reductions.
[2024-05-28 21:55:16] [INFO ] Flatten gal took : 587 ms
[2024-05-28 21:55:17] [INFO ] Flatten gal took : 413 ms
[2024-05-28 21:55:19] [INFO ] Input system was already deterministic with 1940 transitions.
Reduction of identical properties reduced properties to check from 79 to 77
RANDOM walk for 40000 steps (2239 resets) in 8706 ms. (4 steps per ms) remains 71/77 properties
BEST_FIRST walk for 4004 steps (40 resets) in 226 ms. (17 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 325 ms. (12 steps per ms) remains 61/71 properties
BEST_FIRST walk for 4003 steps (37 resets) in 290 ms. (13 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4002 steps (40 resets) in 136 ms. (29 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (41 resets) in 132 ms. (30 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (41 resets) in 48 ms. (81 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (40 resets) in 44 ms. (88 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (40 resets) in 63 ms. (62 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 162 ms. (24 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (41 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 192 ms. (20 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (37 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (19 resets) in 127 ms. (31 steps per ms) remains 51/60 properties
BEST_FIRST walk for 4003 steps (41 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (40 resets) in 48 ms. (81 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (12 resets) in 158 ms. (25 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (36 resets) in 21 ms. (181 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (41 resets) in 28 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (36 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4003 steps (40 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
[2024-05-28 21:55:22] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 21:55:22] [INFO ] Invariant cache hit.
[2024-05-28 21:55:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 152/613 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 5 (OVERLAPS) 51/664 variables, 27/92 constraints. Problems are: Problem set: 27 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 0/92 constraints. Problems are: Problem set: 27 solved, 4 unsolved
Problem AtomicPropp66 is UNSAT
At refinement iteration 7 (OVERLAPS) 1931/2595 variables, 664/756 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2595 variables, 1/757 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2595 variables, 0/757 constraints. Problems are: Problem set: 28 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2595/2595 variables, and 757 constraints, problems are : Problem set: 28 solved, 3 unsolved in 3501 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 129/143 variables, 7/7 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/7 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 166/309 variables, 27/34 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/34 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 260/569 variables, 26/60 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/60 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 92/661 variables, 29/89 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 0/89 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/664 variables, 3/92 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/92 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1931/2595 variables, 664/756 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2595 variables, 1/757 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2595 variables, 2/759 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2595 variables, 0/759 constraints. Problems are: Problem set: 28 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2595 variables, 0/759 constraints. Problems are: Problem set: 28 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2595/2595 variables, and 759 constraints, problems are : Problem set: 28 solved, 3 unsolved in 4171 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 664/664 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 9844ms problems are : Problem set: 28 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 366 ms.
Support contains 12 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1905
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 80 place count 619 transition count 1871
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 148 place count 585 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 584 transition count 1870
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 584 transition count 1870
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 582 transition count 1868
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 582 transition count 1867
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 581 transition count 1867
Applied a total of 156 rules in 370 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
Running 1856 sub problems to find dead transitions.
[2024-05-28 21:55:33] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2024-05-28 21:55:33] [INFO ] Computed 82 invariants in 98 ms
[2024-05-28 21:55:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 10/20 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-28 21:56:18] [INFO ] Deduced a trap composed of 18 places in 383 ms of which 2 ms to minimize.
[2024-05-28 21:56:33] [INFO ] Deduced a trap composed of 132 places in 613 ms of which 6 ms to minimize.
[2024-05-28 21:56:34] [INFO ] Deduced a trap composed of 241 places in 630 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 75 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 10/20 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 3/3 constraints]
After SMT, in 62263ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 62284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62663 ms. Remains : 581/664 places, 1867/1940 transitions.
RANDOM walk for 40000 steps (2696 resets) in 915 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (375 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (371 resets) in 189 ms. (210 steps per ms) remains 1/2 properties
[2024-05-28 21:56:36] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2024-05-28 21:56:36] [INFO ] Invariant cache hit.
[2024-05-28 21:56:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 166/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/550 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/580 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2438 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2439 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2439 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2439/2439 variables, and 664 constraints, problems are : Problem set: 0 solved, 1 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 581/581 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 166/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/550 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/580 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1858/2438 variables, 580/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2438 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2438 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2439 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2439 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:56:38] [INFO ] Deduced a trap composed of 274 places in 659 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2439 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2439 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2439 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2439/2439 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1926 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 581/581 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2827ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1867/1867 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 581 transition count 1866
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 580 transition count 1866
Applied a total of 2 rules in 148 ms. Remains 580 /581 variables (removed 1) and now considering 1866/1867 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 580/581 places, 1866/1867 transitions.
RANDOM walk for 40000 steps (2894 resets) in 1020 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (355 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 220422 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 220422 steps, saw 36815 distinct states, run finished after 3005 ms. (steps per millisecond=73 ) properties seen :0
[2024-05-28 21:56:42] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-05-28 21:56:42] [INFO ] Computed 82 invariants in 42 ms
[2024-05-28 21:56:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2437 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 664 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1053 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1986ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 77 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 70 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-05-28 21:56:44] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 21:56:44] [INFO ] Invariant cache hit.
[2024-05-28 21:56:45] [INFO ] Implicit Places using invariants in 987 ms returned []
[2024-05-28 21:56:45] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 21:56:45] [INFO ] Invariant cache hit.
[2024-05-28 21:56:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:56:52] [INFO ] Implicit Places using invariants and state equation in 6865 ms returned []
Implicit Place search using SMT with State Equation took 7857 ms to find 0 implicit places.
[2024-05-28 21:56:52] [INFO ] Redundant transitions in 157 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-05-28 21:56:52] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 21:56:52] [INFO ] Invariant cache hit.
[2024-05-28 21:56:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 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 Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-05-28 21:57:49] [INFO ] Deduced a trap composed of 87 places in 393 ms of which 1 ms to minimize.
[2024-05-28 21:57:56] [INFO ] Deduced a trap composed of 131 places in 547 ms of which 4 ms to minimize.
[2024-05-28 21:57:56] [INFO ] Deduced a trap composed of 245 places in 465 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 9)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 1)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 75 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 84062ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 84092ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92198 ms. Remains : 580/580 places, 1866/1866 transitions.
Successfully simplified 28 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:58:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 21:58:17] [INFO ] Flatten gal took : 126 ms
[2024-05-28 21:58:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:58:17] [INFO ] Flatten gal took : 138 ms
[2024-05-28 21:58:18] [INFO ] Input system was already deterministic with 1940 transitions.
Support contains 522 out of 664 places (down from 551) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1905
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1871
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1870
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1870
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 2 with 2 rules applied. Total rules applied 142 place count 583 transition count 1869
Applied a total of 142 rules in 144 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
Running 1858 sub problems to find dead transitions.
[2024-05-28 21:58:18] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2024-05-28 21:58:18] [INFO ] Computed 82 invariants in 53 ms
[2024-05-28 21:58:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
SMT process timed out in 38492ms, After SMT, problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 38508ms
[2024-05-28 21:58:56] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
[2024-05-28 21:58:56] [INFO ] Invariant cache hit.
[2024-05-28 21:58:57] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-05-28 21:58:57] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
[2024-05-28 21:58:57] [INFO ] Invariant cache hit.
[2024-05-28 21:58:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:59:07] [INFO ] Implicit Places using invariants and state equation in 10169 ms returned []
Implicit Place search using SMT with State Equation took 11138 ms to find 0 implicit places.
[2024-05-28 21:59:08] [INFO ] Redundant transitions in 162 ms returned []
Running 1858 sub problems to find dead transitions.
[2024-05-28 21:59:08] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
[2024-05-28 21:59:08] [INFO ] Invariant cache hit.
[2024-05-28 21:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
[2024-05-28 21:59:55] [INFO ] Deduced a trap composed of 16 places in 353 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/2443 variables, and 73 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 10/20 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1858/858 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1858 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
[2024-05-28 21:59:59] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 1 ms to minimize.
[2024-05-28 22:00:14] [INFO ] Deduced a trap composed of 14 places in 306 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/2443 variables, and 75 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 10/20 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/858 constraints, Known Traps: 3/3 constraints]
After SMT, in 78272ms problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 78302ms
Starting structural reductions in SI_CTL mode, iteration 1 : 583/664 places, 1869/1940 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 128284 ms. Remains : 583/664 places, 1869/1940 transitions.
[2024-05-28 22:00:26] [INFO ] Flatten gal took : 114 ms
[2024-05-28 22:00:26] [INFO ] Flatten gal took : 104 ms
[2024-05-28 22:00:26] [INFO ] Input system was already deterministic with 1869 transitions.
[2024-05-28 22:00:27] [INFO ] Flatten gal took : 137 ms
[2024-05-28 22:00:27] [INFO ] Flatten gal took : 92 ms
[2024-05-28 22:00:27] [INFO ] Time to serialize gal into /tmp/CTLFireability824831008162525353.gal : 39 ms
[2024-05-28 22:00:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5550323727627032026.ctl : 20 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability824831008162525353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5550323727627032026.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:00:57] [INFO ] Flatten gal took : 138 ms
[2024-05-28 22:00:57] [INFO ] Applying decomposition
[2024-05-28 22:00:57] [INFO ] Flatten gal took : 114 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/graph2835611519146732348.txt' '-o' '/tmp/graph2835611519146732348.bin' '-w' '/tmp/graph2835611519146732348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2835611519146732348.bin' '-l' '-1' '-v' '-w' '/tmp/graph2835611519146732348.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:00:58] [INFO ] Decomposing Gal with order
[2024-05-28 22:00:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:00:58] [INFO ] Removed a total of 4536 redundant transitions.
[2024-05-28 22:00:59] [INFO ] Flatten gal took : 556 ms
[2024-05-28 22:00:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 421 labels/synchronizations in 58 ms.
[2024-05-28 22:00:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8810290843569464826.gal : 17 ms
[2024-05-28 22:00:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3467694642845388747.ctl : 11 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8810290843569464826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3467694642845388747.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Applied a total of 10 rules in 21 ms. Remains 654 /664 variables (removed 10) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-05-28 22:01:29] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 654 cols
[2024-05-28 22:01:29] [INFO ] Computed 82 invariants in 40 ms
[2024-05-28 22:01:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 1929 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 Real declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 9/20 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 9/20 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 57005ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 57023ms
[2024-05-28 22:02:26] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 22:02:26] [INFO ] Invariant cache hit.
[2024-05-28 22:02:26] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-28 22:02:26] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 22:02:26] [INFO ] Invariant cache hit.
[2024-05-28 22:02:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:02:30] [INFO ] Implicit Places using invariants and state equation in 3713 ms returned []
Implicit Place search using SMT with State Equation took 4015 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-28 22:02:30] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 22:02:30] [INFO ] Invariant cache hit.
[2024-05-28 22:02:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 9/20 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1939 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/654 variables, 11/82 constraints. Problems are: Problem set: 615 solved, 1314 unsolved
[2024-05-28 22:03:47] [INFO ] Deduced a trap composed of 24 places in 568 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/2585 variables, and 83 constraints, problems are : Problem set: 615 solved, 1314 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 1/1 constraints]
After SMT, in 77707ms problems are : Problem set: 615 solved, 1314 unsolved
Search for dead transitions found 615 dead transitions in 77732ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 12 ms. Remains 654 /654 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138815 ms. Remains : 654/664 places, 1325/1940 transitions.
[2024-05-28 22:03:48] [INFO ] Flatten gal took : 90 ms
[2024-05-28 22:03:48] [INFO ] Flatten gal took : 89 ms
[2024-05-28 22:03:48] [INFO ] Input system was already deterministic with 1325 transitions.
[2024-05-28 22:03:48] [INFO ] Flatten gal took : 86 ms
[2024-05-28 22:03:48] [INFO ] Flatten gal took : 91 ms
[2024-05-28 22:03:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9649815827081994234.gal : 11 ms
[2024-05-28 22:03:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14984149746126636187.ctl : 10 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9649815827081994234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14984149746126636187.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:04:18] [INFO ] Flatten gal took : 109 ms
[2024-05-28 22:04:18] [INFO ] Applying decomposition
[2024-05-28 22:04:19] [INFO ] Flatten gal took : 89 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/graph7881519500539520312.txt' '-o' '/tmp/graph7881519500539520312.bin' '-w' '/tmp/graph7881519500539520312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7881519500539520312.bin' '-l' '-1' '-v' '-w' '/tmp/graph7881519500539520312.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:04:19] [INFO ] Decomposing Gal with order
[2024-05-28 22:04:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:04:19] [INFO ] Removed a total of 1091 redundant transitions.
[2024-05-28 22:04:19] [INFO ] Flatten gal took : 248 ms
[2024-05-28 22:04:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 27 ms.
[2024-05-28 22:04:19] [INFO ] Time to serialize gal into /tmp/CTLFireability12539379931122276462.gal : 22 ms
[2024-05-28 22:04:19] [INFO ] Time to serialize properties into /tmp/CTLFireability7319797574340469130.ctl : 11 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12539379931122276462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7319797574340469130.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 87 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:04:49] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-05-28 22:04:49] [INFO ] Computed 82 invariants in 55 ms
[2024-05-28 22:04:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 62301ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 62333ms
[2024-05-28 22:05:52] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:05:52] [INFO ] Invariant cache hit.
[2024-05-28 22:05:53] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-05-28 22:05:53] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:05:53] [INFO ] Invariant cache hit.
[2024-05-28 22:05:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:06:00] [INFO ] Implicit Places using invariants and state equation in 7780 ms returned []
Implicit Place search using SMT with State Equation took 8568 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:06:00] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:06:00] [INFO ] Invariant cache hit.
[2024-05-28 22:06:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1198 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/653 variables, 11/82 constraints. Problems are: Problem set: 256 solved, 1672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/2583 variables, and 82 constraints, problems are : Problem set: 256 solved, 1672 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 79683ms problems are : Problem set: 256 solved, 1672 unsolved
Search for dead transitions found 256 dead transitions in 79726ms
Found 256 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 256 transitions
Dead transitions reduction (with SMT) removed 256 transitions
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1683/1940 transitions.
Applied a total of 0 rules in 24 ms. Remains 653 /653 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150760 ms. Remains : 653/664 places, 1683/1940 transitions.
[2024-05-28 22:07:20] [INFO ] Flatten gal took : 92 ms
[2024-05-28 22:07:20] [INFO ] Flatten gal took : 91 ms
[2024-05-28 22:07:20] [INFO ] Input system was already deterministic with 1683 transitions.
[2024-05-28 22:07:21] [INFO ] Flatten gal took : 91 ms
[2024-05-28 22:07:21] [INFO ] Flatten gal took : 91 ms
[2024-05-28 22:07:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9073628213247743803.gal : 13 ms
[2024-05-28 22:07:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5389380304629715510.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9073628213247743803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5389380304629715510.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:07:51] [INFO ] Flatten gal took : 123 ms
[2024-05-28 22:07:51] [INFO ] Applying decomposition
[2024-05-28 22:07:51] [INFO ] Flatten gal took : 94 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/graph6619640363890968961.txt' '-o' '/tmp/graph6619640363890968961.bin' '-w' '/tmp/graph6619640363890968961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6619640363890968961.bin' '-l' '-1' '-v' '-w' '/tmp/graph6619640363890968961.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:07:51] [INFO ] Decomposing Gal with order
[2024-05-28 22:07:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:07:51] [INFO ] Removed a total of 1001 redundant transitions.
[2024-05-28 22:07:51] [INFO ] Flatten gal took : 156 ms
[2024-05-28 22:07:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 461 labels/synchronizations in 30 ms.
[2024-05-28 22:07:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4326286086207784558.gal : 106 ms
[2024-05-28 22:07:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5138420506564651552.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4326286086207784558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5138420506564651552.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1904
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1870
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 584 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 583 transition count 1869
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 583 transition count 1869
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 581 transition count 1867
Applied a total of 146 rules in 219 ms. Remains 581 /664 variables (removed 83) and now considering 1867/1940 (removed 73) transitions.
Running 1856 sub problems to find dead transitions.
[2024-05-28 22:08:22] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
// Phase 1: matrix 1858 rows 581 cols
[2024-05-28 22:08:22] [INFO ] Computed 82 invariants in 20 ms
[2024-05-28 22:08:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 72 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-28 22:09:01] [INFO ] Deduced a trap composed of 18 places in 391 ms of which 2 ms to minimize.
[2024-05-28 22:09:15] [INFO ] Deduced a trap composed of 14 places in 335 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 74 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 2/2 constraints]
After SMT, in 57118ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 57140ms
[2024-05-28 22:09:19] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2024-05-28 22:09:19] [INFO ] Invariant cache hit.
[2024-05-28 22:09:20] [INFO ] Implicit Places using invariants in 880 ms returned []
[2024-05-28 22:09:20] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2024-05-28 22:09:20] [INFO ] Invariant cache hit.
[2024-05-28 22:09:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:09:28] [INFO ] Implicit Places using invariants and state equation in 7708 ms returned []
Implicit Place search using SMT with State Equation took 8596 ms to find 0 implicit places.
[2024-05-28 22:09:28] [INFO ] Redundant transitions in 41 ms returned []
Running 1856 sub problems to find dead transitions.
[2024-05-28 22:09:28] [INFO ] Flow matrix only has 1858 transitions (discarded 9 similar events)
[2024-05-28 22:09:28] [INFO ] Invariant cache hit.
[2024-05-28 22:09:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-28 22:10:19] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2439 variables, and 73 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1856/856 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-28 22:10:23] [INFO ] Deduced a trap composed of 18 places in 383 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2439 variables, and 74 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/856 constraints, Known Traps: 2/2 constraints]
After SMT, in 82803ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 82826ms
Starting structural reductions in SI_CTL mode, iteration 1 : 581/664 places, 1867/1940 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 148848 ms. Remains : 581/664 places, 1867/1940 transitions.
[2024-05-28 22:10:51] [INFO ] Flatten gal took : 73 ms
[2024-05-28 22:10:51] [INFO ] Flatten gal took : 78 ms
[2024-05-28 22:10:51] [INFO ] Input system was already deterministic with 1867 transitions.
[2024-05-28 22:10:51] [INFO ] Flatten gal took : 74 ms
[2024-05-28 22:10:51] [INFO ] Flatten gal took : 76 ms
[2024-05-28 22:10:51] [INFO ] Time to serialize gal into /tmp/CTLFireability2622425858002444944.gal : 12 ms
[2024-05-28 22:10:51] [INFO ] Time to serialize properties into /tmp/CTLFireability5403485512160617872.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2622425858002444944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5403485512160617872.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:11:21] [INFO ] Flatten gal took : 144 ms
[2024-05-28 22:11:21] [INFO ] Applying decomposition
[2024-05-28 22:11:21] [INFO ] Flatten gal took : 121 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/graph9639567267941055144.txt' '-o' '/tmp/graph9639567267941055144.bin' '-w' '/tmp/graph9639567267941055144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9639567267941055144.bin' '-l' '-1' '-v' '-w' '/tmp/graph9639567267941055144.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:11:22] [INFO ] Decomposing Gal with order
[2024-05-28 22:11:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:11:22] [INFO ] Removed a total of 5825 redundant transitions.
[2024-05-28 22:11:22] [INFO ] Flatten gal took : 181 ms
[2024-05-28 22:11:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 394 labels/synchronizations in 31 ms.
[2024-05-28 22:11:22] [INFO ] Time to serialize gal into /tmp/CTLFireability13059732629133357662.gal : 16 ms
[2024-05-28 22:11:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6145668155436427234.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13059732629133357662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6145668155436427234.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 86 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:11:52] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-05-28 22:11:52] [INFO ] Computed 82 invariants in 53 ms
[2024-05-28 22:11:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 4.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 59936ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 59969ms
[2024-05-28 22:12:52] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:12:52] [INFO ] Invariant cache hit.
[2024-05-28 22:12:53] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-28 22:12:53] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:12:53] [INFO ] Invariant cache hit.
[2024-05-28 22:12:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:13:01] [INFO ] Implicit Places using invariants and state equation in 7900 ms returned []
Implicit Place search using SMT with State Equation took 8484 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:13:01] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:13:01] [INFO ] Invariant cache hit.
[2024-05-28 22:13:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 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 Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD661 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/653 variables, 11/82 constraints. Problems are: Problem set: 64 solved, 1864 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/2583 variables, and 82 constraints, problems are : Problem set: 64 solved, 1864 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 80129ms problems are : Problem set: 64 solved, 1864 unsolved
Search for dead transitions found 64 dead transitions in 80164ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1875/1940 transitions.
Applied a total of 0 rules in 20 ms. Remains 653 /653 variables (removed 0) and now considering 1875/1875 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148741 ms. Remains : 653/664 places, 1875/1940 transitions.
[2024-05-28 22:14:21] [INFO ] Flatten gal took : 104 ms
[2024-05-28 22:14:21] [INFO ] Flatten gal took : 133 ms
[2024-05-28 22:14:21] [INFO ] Input system was already deterministic with 1875 transitions.
[2024-05-28 22:14:22] [INFO ] Flatten gal took : 122 ms
[2024-05-28 22:14:22] [INFO ] Flatten gal took : 127 ms
[2024-05-28 22:14:22] [INFO ] Time to serialize gal into /tmp/CTLFireability5132373178967065577.gal : 16 ms
[2024-05-28 22:14:22] [INFO ] Time to serialize properties into /tmp/CTLFireability24902373518974677.ctl : 13 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5132373178967065577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability24902373518974677.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:14:52] [INFO ] Flatten gal took : 173 ms
[2024-05-28 22:14:52] [INFO ] Applying decomposition
[2024-05-28 22:14:52] [INFO ] Flatten gal took : 170 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/graph11491234663164121315.txt' '-o' '/tmp/graph11491234663164121315.bin' '-w' '/tmp/graph11491234663164121315.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11491234663164121315.bin' '-l' '-1' '-v' '-w' '/tmp/graph11491234663164121315.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:14:52] [INFO ] Decomposing Gal with order
[2024-05-28 22:14:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:14:53] [INFO ] Removed a total of 2721 redundant transitions.
[2024-05-28 22:14:53] [INFO ] Flatten gal took : 315 ms
[2024-05-28 22:14:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 607 labels/synchronizations in 38 ms.
[2024-05-28 22:14:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9947956287140917942.gal : 19 ms
[2024-05-28 22:14:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10471988820762256003.ctl : 27 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9947956287140917942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10471988820762256003.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1904
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1904
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1869
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1868
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1868
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1866
Applied a total of 148 rules in 199 ms. Remains 580 /664 variables (removed 84) and now considering 1866/1940 (removed 74) transitions.
Running 1855 sub problems to find dead transitions.
[2024-05-28 22:15:24] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
// Phase 1: matrix 1857 rows 580 cols
[2024-05-28 22:15:24] [INFO ] Computed 82 invariants in 53 ms
[2024-05-28 22:15:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 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 Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-05-28 22:16:06] [INFO ] Deduced a trap composed of 87 places in 337 ms of which 2 ms to minimize.
[2024-05-28 22:16:12] [INFO ] Deduced a trap composed of 283 places in 568 ms of which 5 ms to minimize.
[2024-05-28 22:16:13] [INFO ] Deduced a trap composed of 265 places in 751 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 570/2437 variables, and 75 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
[2024-05-28 22:16:24] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:16:24] [INFO ] Invariant cache hit.
[2024-05-28 22:16:25] [INFO ] Implicit Places using invariants in 880 ms returned []
[2024-05-28 22:16:25] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:16:25] [INFO ] Invariant cache hit.
[2024-05-28 22:16:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:16:33] [INFO ] Implicit Places using invariants and state equation in 8182 ms returned []
Implicit Place search using SMT with State Equation took 9063 ms to find 0 implicit places.
[2024-05-28 22:16:33] [INFO ] Redundant transitions in 86 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-05-28 22:16:33] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:16:33] [INFO ] Invariant cache hit.
[2024-05-28 22:16:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 2.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-05-28 22:17:24] [INFO ] Deduced a trap composed of 18 places in 288 ms of which 2 ms to minimize.
[2024-05-28 22:17:30] [INFO ] Deduced a trap composed of 95 places in 507 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 79002ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 79042ms
Starting structural reductions in SI_CTL mode, iteration 1 : 580/664 places, 1866/1940 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 148612 ms. Remains : 580/664 places, 1866/1940 transitions.
[2024-05-28 22:17:52] [INFO ] Flatten gal took : 71 ms
[2024-05-28 22:17:52] [INFO ] Flatten gal took : 74 ms
[2024-05-28 22:17:52] [INFO ] Input system was already deterministic with 1866 transitions.
[2024-05-28 22:17:52] [INFO ] Flatten gal took : 143 ms
[2024-05-28 22:17:53] [INFO ] Flatten gal took : 78 ms
[2024-05-28 22:17:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9487683331705457877.gal : 50 ms
[2024-05-28 22:17:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2223104906272517424.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9487683331705457877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2223104906272517424.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (2858 resets) in 929 ms. (43 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40002 steps (353 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality2223104906272517424.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 151
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :151 after 152
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :152 after 153
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :153 after 155
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :155 after 159
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :159 after 166
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :166 after 260
Interrupted probabilistic random walk after 262701 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 262701 steps, saw 43305 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-28 22:17:56] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:17:56] [INFO ] Invariant cache hit.
[2024-05-28 22:17:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :260 after 1926
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1926 after 2063
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:17:58] [INFO ] Deduced a trap composed of 113 places in 500 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2063 after 2394
[2024-05-28 22:17:59] [INFO ] Deduced a trap composed of 280 places in 427 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2436 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2437 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2250 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3343ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 35 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Running 1855 sub problems to find dead transitions.
[2024-05-28 22:17:59] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:17:59] [INFO ] Invariant cache hit.
[2024-05-28 22:17:59] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2394 after 7460
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7460 after 22326
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 2.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 9.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 4.0)
(s97 0.0)
(s98 4.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 4.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 4.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 8.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 4.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 4.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s396 4.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 4.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s424 0.0)
(s425 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2437 variables, and 72 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
[2024-05-28 22:18:40] [INFO ] Deduced a trap composed of 18 places in 288 ms of which 2 ms to minimize.
[2024-05-28 22:18:46] [INFO ] Deduced a trap composed of 95 places in 546 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 74 constraints, problems are : Problem set: 0 solved, 1855 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/855 constraints, Known Traps: 2/2 constraints]
After SMT, in 58503ms problems are : Problem set: 0 solved, 1855 unsolved
Search for dead transitions found 0 dead transitions in 58523ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58563 ms. Remains : 580/580 places, 1866/1866 transitions.
RANDOM walk for 400000 steps (29189 resets) in 7945 ms. (50 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-28 22:19:00] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:19:00] [INFO ] Invariant cache hit.
[2024-05-28 22:19:00] [INFO ] [Real]Absence check using 63 positive place invariants in 17 ms returned sat
[2024-05-28 22:19:00] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 48 ms returned sat
[2024-05-28 22:19:01] [INFO ] After 596ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 22:19:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:19:01] [INFO ] After 36ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 22:19:01] [INFO ] After 154ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:19:01] [INFO ] After 966ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:19:01] [INFO ] [Nat]Absence check using 63 positive place invariants in 15 ms returned sat
[2024-05-28 22:19:01] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 30 ms returned sat
[2024-05-28 22:19:02] [INFO ] After 842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:19:02] [INFO ] After 282ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 22:19:02] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:19:02] [INFO ] After 1385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :22326 after 141440
RANDOM walk for 4000000 steps (290652 resets) in 59515 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (35817 resets) in 11694 ms. (342 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :141440 after 164085
Interrupted probabilistic random walk after 4326496 steps, run timeout after 54001 ms. (steps per millisecond=80 ) properties seen :0 out of 1
Probabilistic random walk after 4326496 steps, saw 735670 distinct states, run finished after 54002 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-28 22:20:15] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:20:15] [INFO ] Invariant cache hit.
[2024-05-28 22:20:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2437 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2437 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 873 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 262144
At refinement iteration 9 (OVERLAPS) 1857/2436 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2436 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :164085 after 587335
[2024-05-28 22:20:17] [INFO ] Deduced a trap composed of 113 places in 492 ms of which 4 ms to minimize.
[2024-05-28 22:20:17] [INFO ] Deduced a trap composed of 280 places in 471 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2436 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2436 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/2437 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2437 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2437 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2310 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3199ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 53 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 580/580 places, 1866/1866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1866/1866 transitions.
Applied a total of 0 rules in 51 ms. Remains 580 /580 variables (removed 0) and now considering 1866/1866 (removed 0) transitions.
[2024-05-28 22:20:18] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:20:18] [INFO ] Invariant cache hit.
[2024-05-28 22:20:19] [INFO ] Implicit Places using invariants in 896 ms returned []
[2024-05-28 22:20:19] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:20:19] [INFO ] Invariant cache hit.
[2024-05-28 22:20:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:20:26] [INFO ] Implicit Places using invariants and state equation in 7658 ms returned []
Implicit Place search using SMT with State Equation took 8561 ms to find 0 implicit places.
[2024-05-28 22:20:27] [INFO ] Redundant transitions in 100 ms returned []
Running 1855 sub problems to find dead transitions.
[2024-05-28 22:20:27] [INFO ] Flow matrix only has 1857 transitions (discarded 9 similar events)
[2024-05-28 22:20:27] [INFO ] Invariant cache hit.
[2024-05-28 22:20:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1855 unsolved
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1541 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/580 variables, 10/82 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/2437 variables, and 82 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1855/855 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
[2024-05-28 22:21:18] [INFO ] Deduced a trap composed of 18 places in 342 ms of which 2 ms to minimize.
[2024-05-28 22:21:24] [INFO ] Deduced a trap composed of 283 places in 498 ms of which 5 ms to minimize.
[2024-05-28 22:21:24] [INFO ] Deduced a trap composed of 104 places in 453 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 3/75 constraints. Problems are: Problem set: 615 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2437 variables, and 75 constraints, problems are : Problem set: 615 solved, 1240 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/855 constraints, Known Traps: 3/3 constraints]
After SMT, in 79565ms problems are : Problem set: 615 solved, 1240 unsolved
Search for dead transitions found 615 dead transitions in 79590ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 580/580 places, 1251/1866 transitions.
Applied a total of 0 rules in 28 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-28 22:21:46] [INFO ] Redundant transitions in 17 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 88374 ms. Remains : 580/580 places, 1251/1866 transitions.
RANDOM walk for 4000000 steps (290005 resets) in 32721 ms. (122 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (35515 resets) in 7580 ms. (527 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3444391 steps, run timeout after 30001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 3444391 steps, saw 584663 distinct states, run finished after 30002 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-28 22:22:27] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-28 22:22:27] [INFO ] Computed 82 invariants in 39 ms
[2024-05-28 22:22:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/579 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1242/1821 variables, 579/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1821 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1821 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1822 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1822 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1822 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1822/1822 variables, and 663 constraints, problems are : Problem set: 0 solved, 1 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:22:28] [INFO ] Deduced a trap composed of 220 places in 291 ms of which 4 ms to minimize.
[2024-05-28 22:22:28] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 4 ms to minimize.
[2024-05-28 22:22:28] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 4 ms to minimize.
[2024-05-28 22:22:29] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 7 ms to minimize.
[2024-05-28 22:22:29] [INFO ] Deduced a trap composed of 222 places in 207 ms of which 3 ms to minimize.
[2024-05-28 22:22:29] [INFO ] Deduced a trap composed of 238 places in 205 ms of which 3 ms to minimize.
[2024-05-28 22:22:29] [INFO ] Deduced a trap composed of 230 places in 207 ms of which 3 ms to minimize.
[2024-05-28 22:22:30] [INFO ] Deduced a trap composed of 226 places in 210 ms of which 3 ms to minimize.
[2024-05-28 22:22:30] [INFO ] Deduced a trap composed of 224 places in 216 ms of which 4 ms to minimize.
[2024-05-28 22:22:30] [INFO ] Deduced a trap composed of 220 places in 213 ms of which 3 ms to minimize.
[2024-05-28 22:22:30] [INFO ] Deduced a trap composed of 240 places in 205 ms of which 3 ms to minimize.
[2024-05-28 22:22:30] [INFO ] Deduced a trap composed of 208 places in 211 ms of which 3 ms to minimize.
[2024-05-28 22:22:31] [INFO ] Deduced a trap composed of 208 places in 210 ms of which 3 ms to minimize.
[2024-05-28 22:22:31] [INFO ] Deduced a trap composed of 234 places in 209 ms of which 2 ms to minimize.
[2024-05-28 22:22:31] [INFO ] Deduced a trap composed of 216 places in 202 ms of which 3 ms to minimize.
[2024-05-28 22:22:31] [INFO ] Deduced a trap composed of 242 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:22:32] [INFO ] Deduced a trap composed of 230 places in 207 ms of which 3 ms to minimize.
[2024-05-28 22:22:32] [INFO ] Deduced a trap composed of 236 places in 211 ms of which 3 ms to minimize.
[2024-05-28 22:22:32] [INFO ] Deduced a trap composed of 236 places in 207 ms of which 2 ms to minimize.
[2024-05-28 22:22:32] [INFO ] Deduced a trap composed of 232 places in 209 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:22:32] [INFO ] Deduced a trap composed of 230 places in 211 ms of which 4 ms to minimize.
[2024-05-28 22:22:33] [INFO ] Deduced a trap composed of 224 places in 207 ms of which 3 ms to minimize.
[2024-05-28 22:22:33] [INFO ] Deduced a trap composed of 226 places in 210 ms of which 3 ms to minimize.
[2024-05-28 22:22:33] [INFO ] Deduced a trap composed of 208 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:22:33] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 12 ms to minimize.
[2024-05-28 22:22:34] [INFO ] Deduced a trap composed of 224 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:22:34] [INFO ] Deduced a trap composed of 216 places in 203 ms of which 3 ms to minimize.
[2024-05-28 22:22:34] [INFO ] Deduced a trap composed of 240 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:22:34] [INFO ] Deduced a trap composed of 232 places in 202 ms of which 3 ms to minimize.
[2024-05-28 22:22:34] [INFO ] Deduced a trap composed of 234 places in 216 ms of which 3 ms to minimize.
[2024-05-28 22:22:35] [INFO ] Deduced a trap composed of 234 places in 206 ms of which 2 ms to minimize.
[2024-05-28 22:22:35] [INFO ] Deduced a trap composed of 238 places in 206 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 524288
[2024-05-28 22:22:35] [INFO ] Deduced a trap composed of 234 places in 207 ms of which 3 ms to minimize.
[2024-05-28 22:22:35] [INFO ] Deduced a trap composed of 224 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:22:36] [INFO ] Deduced a trap composed of 226 places in 206 ms of which 2 ms to minimize.
SDD size :587335 after 1.68422e+06
[2024-05-28 22:22:36] [INFO ] Deduced a trap composed of 224 places in 205 ms of which 3 ms to minimize.
[2024-05-28 22:22:36] [INFO ] Deduced a trap composed of 226 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:22:36] [INFO ] Deduced a trap composed of 236 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:22:36] [INFO ] Deduced a trap composed of 232 places in 208 ms of which 2 ms to minimize.
[2024-05-28 22:22:37] [INFO ] Deduced a trap composed of 234 places in 204 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:22:37] [INFO ] Deduced a trap composed of 240 places in 210 ms of which 3 ms to minimize.
[2024-05-28 22:22:37] [INFO ] Deduced a trap composed of 226 places in 206 ms of which 3 ms to minimize.
[2024-05-28 22:22:37] [INFO ] Deduced a trap composed of 234 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:22:38] [INFO ] Deduced a trap composed of 242 places in 203 ms of which 2 ms to minimize.
[2024-05-28 22:22:38] [INFO ] Deduced a trap composed of 232 places in 238 ms of which 3 ms to minimize.
[2024-05-28 22:22:38] [INFO ] Deduced a trap composed of 224 places in 203 ms of which 3 ms to minimize.
[2024-05-28 22:22:38] [INFO ] Deduced a trap composed of 232 places in 197 ms of which 3 ms to minimize.
[2024-05-28 22:22:39] [INFO ] Deduced a trap composed of 224 places in 270 ms of which 3 ms to minimize.
[2024-05-28 22:22:39] [INFO ] Deduced a trap composed of 236 places in 274 ms of which 4 ms to minimize.
[2024-05-28 22:22:39] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 4 ms to minimize.
[2024-05-28 22:22:39] [INFO ] Deduced a trap composed of 244 places in 252 ms of which 4 ms to minimize.
[2024-05-28 22:22:40] [INFO ] Deduced a trap composed of 224 places in 253 ms of which 3 ms to minimize.
[2024-05-28 22:22:40] [INFO ] Deduced a trap composed of 232 places in 285 ms of which 4 ms to minimize.
[2024-05-28 22:22:40] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 4 ms to minimize.
[2024-05-28 22:22:41] [INFO ] Deduced a trap composed of 244 places in 290 ms of which 4 ms to minimize.
[2024-05-28 22:22:42] [INFO ] Deduced a trap composed of 228 places in 353 ms of which 4 ms to minimize.
[2024-05-28 22:22:43] [INFO ] Deduced a trap composed of 240 places in 334 ms of which 4 ms to minimize.
[2024-05-28 22:22:43] [INFO ] Deduced a trap composed of 234 places in 296 ms of which 4 ms to minimize.
[2024-05-28 22:22:44] [INFO ] Deduced a trap composed of 240 places in 297 ms of which 2 ms to minimize.
[2024-05-28 22:22:44] [INFO ] Deduced a trap composed of 226 places in 318 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:22:44] [INFO ] Deduced a trap composed of 238 places in 330 ms of which 4 ms to minimize.
[2024-05-28 22:22:45] [INFO ] Deduced a trap composed of 234 places in 294 ms of which 4 ms to minimize.
[2024-05-28 22:22:45] [INFO ] Deduced a trap composed of 222 places in 333 ms of which 4 ms to minimize.
[2024-05-28 22:22:45] [INFO ] Deduced a trap composed of 230 places in 321 ms of which 4 ms to minimize.
[2024-05-28 22:22:46] [INFO ] Deduced a trap composed of 236 places in 341 ms of which 4 ms to minimize.
[2024-05-28 22:22:46] [INFO ] Deduced a trap composed of 236 places in 289 ms of which 4 ms to minimize.
[2024-05-28 22:22:47] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 4 ms to minimize.
[2024-05-28 22:22:47] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 4 ms to minimize.
[2024-05-28 22:22:47] [INFO ] Deduced a trap composed of 230 places in 212 ms of which 2 ms to minimize.
[2024-05-28 22:22:47] [INFO ] Deduced a trap composed of 234 places in 210 ms of which 3 ms to minimize.
[2024-05-28 22:22:48] [INFO ] Deduced a trap composed of 236 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:22:48] [INFO ] Deduced a trap composed of 232 places in 205 ms of which 3 ms to minimize.
[2024-05-28 22:22:48] [INFO ] Deduced a trap composed of 230 places in 203 ms of which 3 ms to minimize.
[2024-05-28 22:22:48] [INFO ] Deduced a trap composed of 224 places in 204 ms of which 3 ms to minimize.
[2024-05-28 22:22:49] [INFO ] Deduced a trap composed of 230 places in 206 ms of which 3 ms to minimize.
[2024-05-28 22:22:49] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 3 ms to minimize.
[2024-05-28 22:22:49] [INFO ] Deduced a trap composed of 230 places in 215 ms of which 3 ms to minimize.
[2024-05-28 22:22:49] [INFO ] Deduced a trap composed of 232 places in 210 ms of which 3 ms to minimize.
[2024-05-28 22:22:49] [INFO ] Deduced a trap composed of 238 places in 216 ms of which 2 ms to minimize.
[2024-05-28 22:22:50] [INFO ] Deduced a trap composed of 230 places in 213 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:22:50] [INFO ] Deduced a trap composed of 222 places in 205 ms of which 3 ms to minimize.
[2024-05-28 22:22:50] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 5 ms to minimize.
[2024-05-28 22:22:50] [INFO ] Deduced a trap composed of 240 places in 209 ms of which 4 ms to minimize.
[2024-05-28 22:22:51] [INFO ] Deduced a trap composed of 228 places in 213 ms of which 3 ms to minimize.
[2024-05-28 22:22:51] [INFO ] Deduced a trap composed of 224 places in 207 ms of which 2 ms to minimize.
[2024-05-28 22:22:51] [INFO ] Deduced a trap composed of 230 places in 299 ms of which 3 ms to minimize.
[2024-05-28 22:22:54] [INFO ] Deduced a trap composed of 216 places in 349 ms of which 4 ms to minimize.
[2024-05-28 22:22:54] [INFO ] Deduced a trap composed of 232 places in 300 ms of which 4 ms to minimize.
[2024-05-28 22:22:54] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 3 ms to minimize.
[2024-05-28 22:22:54] [INFO ] Deduced a trap composed of 240 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:22:55] [INFO ] Deduced a trap composed of 238 places in 206 ms of which 3 ms to minimize.
[2024-05-28 22:22:55] [INFO ] Deduced a trap composed of 232 places in 207 ms of which 2 ms to minimize.
[2024-05-28 22:22:55] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 8 ms to minimize.
[2024-05-28 22:22:55] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 3 ms to minimize.
[2024-05-28 22:22:55] [INFO ] Deduced a trap composed of 228 places in 209 ms of which 2 ms to minimize.
[2024-05-28 22:22:56] [INFO ] Deduced a trap composed of 234 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:22:56] [INFO ] Deduced a trap composed of 232 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:22:56] [INFO ] Deduced a trap composed of 230 places in 207 ms of which 3 ms to minimize.
[2024-05-28 22:22:56] [INFO ] Deduced a trap composed of 232 places in 211 ms of which 3 ms to minimize.
[2024-05-28 22:22:57] [INFO ] Deduced a trap composed of 228 places in 211 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:22:57] [INFO ] Deduced a trap composed of 232 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:22:57] [INFO ] Deduced a trap composed of 232 places in 204 ms of which 3 ms to minimize.
[2024-05-28 22:22:57] [INFO ] Deduced a trap composed of 216 places in 206 ms of which 3 ms to minimize.
[2024-05-28 22:22:57] [INFO ] Deduced a trap composed of 236 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:22:58] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 3 ms to minimize.
[2024-05-28 22:22:58] [INFO ] Deduced a trap composed of 232 places in 204 ms of which 3 ms to minimize.
[2024-05-28 22:22:58] [INFO ] Deduced a trap composed of 230 places in 213 ms of which 3 ms to minimize.
[2024-05-28 22:22:58] [INFO ] Deduced a trap composed of 224 places in 203 ms of which 3 ms to minimize.
[2024-05-28 22:22:59] [INFO ] Deduced a trap composed of 234 places in 297 ms of which 4 ms to minimize.
[2024-05-28 22:22:59] [INFO ] Deduced a trap composed of 228 places in 206 ms of which 3 ms to minimize.
[2024-05-28 22:22:59] [INFO ] Deduced a trap composed of 240 places in 211 ms of which 3 ms to minimize.
[2024-05-28 22:22:59] [INFO ] Deduced a trap composed of 228 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:23:00] [INFO ] Deduced a trap composed of 242 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:23:00] [INFO ] Deduced a trap composed of 236 places in 312 ms of which 3 ms to minimize.
[2024-05-28 22:23:00] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 4 ms to minimize.
[2024-05-28 22:23:01] [INFO ] Deduced a trap composed of 230 places in 340 ms of which 4 ms to minimize.
[2024-05-28 22:23:01] [INFO ] Deduced a trap composed of 234 places in 311 ms of which 4 ms to minimize.
[2024-05-28 22:23:02] [INFO ] Deduced a trap composed of 228 places in 345 ms of which 4 ms to minimize.
[2024-05-28 22:23:03] [INFO ] Deduced a trap composed of 234 places in 327 ms of which 4 ms to minimize.
[2024-05-28 22:23:03] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:23:04] [INFO ] Deduced a trap composed of 238 places in 293 ms of which 4 ms to minimize.
[2024-05-28 22:23:04] [INFO ] Deduced a trap composed of 232 places in 232 ms of which 3 ms to minimize.
[2024-05-28 22:23:04] [INFO ] Deduced a trap composed of 242 places in 204 ms of which 3 ms to minimize.
[2024-05-28 22:23:04] [INFO ] Deduced a trap composed of 240 places in 202 ms of which 3 ms to minimize.
[2024-05-28 22:23:05] [INFO ] Deduced a trap composed of 228 places in 310 ms of which 4 ms to minimize.
[2024-05-28 22:23:05] [INFO ] Deduced a trap composed of 236 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:23:05] [INFO ] Deduced a trap composed of 228 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:23:05] [INFO ] Deduced a trap composed of 232 places in 211 ms of which 3 ms to minimize.
[2024-05-28 22:23:05] [INFO ] Deduced a trap composed of 232 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:23:06] [INFO ] Deduced a trap composed of 234 places in 207 ms of which 3 ms to minimize.
[2024-05-28 22:23:06] [INFO ] Deduced a trap composed of 236 places in 206 ms of which 3 ms to minimize.
[2024-05-28 22:23:06] [INFO ] Deduced a trap composed of 232 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:23:07] [INFO ] Deduced a trap composed of 232 places in 360 ms of which 4 ms to minimize.
[2024-05-28 22:23:08] [INFO ] Deduced a trap composed of 242 places in 362 ms of which 4 ms to minimize.
[2024-05-28 22:23:09] [INFO ] Deduced a trap composed of 234 places in 357 ms of which 4 ms to minimize.
[2024-05-28 22:23:10] [INFO ] Deduced a trap composed of 234 places in 361 ms of which 4 ms to minimize.
[2024-05-28 22:23:10] [INFO ] Deduced a trap composed of 228 places in 324 ms of which 4 ms to minimize.
[2024-05-28 22:23:11] [INFO ] Deduced a trap composed of 232 places in 316 ms of which 4 ms to minimize.
[2024-05-28 22:23:11] [INFO ] Deduced a trap composed of 238 places in 295 ms of which 3 ms to minimize.
[2024-05-28 22:23:11] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:23:11] [INFO ] Deduced a trap composed of 222 places in 241 ms of which 3 ms to minimize.
[2024-05-28 22:23:12] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 3 ms to minimize.
[2024-05-28 22:23:12] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 3 ms to minimize.
[2024-05-28 22:23:13] [INFO ] Deduced a trap composed of 224 places in 372 ms of which 4 ms to minimize.
[2024-05-28 22:23:14] [INFO ] Deduced a trap composed of 236 places in 342 ms of which 4 ms to minimize.
[2024-05-28 22:23:14] [INFO ] Deduced a trap composed of 230 places in 355 ms of which 5 ms to minimize.
[2024-05-28 22:23:15] [INFO ] Deduced a trap composed of 228 places in 292 ms of which 3 ms to minimize.
[2024-05-28 22:23:15] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 3 ms to minimize.
[2024-05-28 22:23:15] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 3 ms to minimize.
[2024-05-28 22:23:15] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 3 ms to minimize.
[2024-05-28 22:23:16] [INFO ] Deduced a trap composed of 224 places in 241 ms of which 3 ms to minimize.
[2024-05-28 22:23:16] [INFO ] Deduced a trap composed of 238 places in 248 ms of which 3 ms to minimize.
[2024-05-28 22:23:16] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 3 ms to minimize.
[2024-05-28 22:23:17] [INFO ] Deduced a trap composed of 230 places in 288 ms of which 3 ms to minimize.
[2024-05-28 22:23:17] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 4 ms to minimize.
[2024-05-28 22:23:18] [INFO ] Deduced a trap composed of 234 places in 363 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/1822 variables, and 237 constraints, problems are : Problem set: 0 solved, 1 unsolved in 61292 ms.
Refiners :[Positive P Invariants (semi-flows): 62/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 156/156 constraints]
After SMT, in 61941ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 57 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 48 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-28 22:23:29] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:23:29] [INFO ] Invariant cache hit.
[2024-05-28 22:23:30] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-05-28 22:23:30] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:23:30] [INFO ] Invariant cache hit.
[2024-05-28 22:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:23:36] [INFO ] Implicit Places using invariants and state equation in 6445 ms returned []
Implicit Place search using SMT with State Equation took 7245 ms to find 0 implicit places.
[2024-05-28 22:23:36] [INFO ] Redundant transitions in 46 ms returned []
Running 1240 sub problems to find dead transitions.
[2024-05-28 22:23:36] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:23:36] [INFO ] Invariant cache hit.
[2024-05-28 22:23:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:23:51] [INFO ] Deduced a trap composed of 167 places in 268 ms of which 4 ms to minimize.
[2024-05-28 22:23:51] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 3 ms to minimize.
[2024-05-28 22:23:52] [INFO ] Deduced a trap composed of 161 places in 200 ms of which 4 ms to minimize.
[2024-05-28 22:23:52] [INFO ] Deduced a trap composed of 156 places in 264 ms of which 4 ms to minimize.
[2024-05-28 22:23:52] [INFO ] Deduced a trap composed of 156 places in 258 ms of which 4 ms to minimize.
[2024-05-28 22:23:53] [INFO ] Deduced a trap composed of 240 places in 255 ms of which 4 ms to minimize.
[2024-05-28 22:23:53] [INFO ] Deduced a trap composed of 236 places in 234 ms of which 4 ms to minimize.
[2024-05-28 22:23:53] [INFO ] Deduced a trap composed of 228 places in 236 ms of which 4 ms to minimize.
[2024-05-28 22:23:54] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 4 ms to minimize.
[2024-05-28 22:23:54] [INFO ] Deduced a trap composed of 171 places in 203 ms of which 3 ms to minimize.
[2024-05-28 22:23:54] [INFO ] Deduced a trap composed of 224 places in 197 ms of which 3 ms to minimize.
[2024-05-28 22:23:54] [INFO ] Deduced a trap composed of 224 places in 197 ms of which 3 ms to minimize.
[2024-05-28 22:23:54] [INFO ] Deduced a trap composed of 151 places in 198 ms of which 5 ms to minimize.
[2024-05-28 22:23:55] [INFO ] Deduced a trap composed of 146 places in 195 ms of which 3 ms to minimize.
[2024-05-28 22:23:55] [INFO ] Deduced a trap composed of 236 places in 198 ms of which 3 ms to minimize.
[2024-05-28 22:23:55] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 3 ms to minimize.
[2024-05-28 22:23:55] [INFO ] Deduced a trap composed of 226 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:23:56] [INFO ] Deduced a trap composed of 230 places in 235 ms of which 4 ms to minimize.
[2024-05-28 22:23:56] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 4 ms to minimize.
[2024-05-28 22:23:56] [INFO ] Deduced a trap composed of 232 places in 237 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:23:57] [INFO ] Deduced a trap composed of 146 places in 261 ms of which 3 ms to minimize.
[2024-05-28 22:23:58] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 3 ms to minimize.
[2024-05-28 22:23:58] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 3 ms to minimize.
[2024-05-28 22:23:58] [INFO ] Deduced a trap composed of 152 places in 198 ms of which 3 ms to minimize.
[2024-05-28 22:23:58] [INFO ] Deduced a trap composed of 229 places in 195 ms of which 2 ms to minimize.
[2024-05-28 22:23:58] [INFO ] Deduced a trap composed of 146 places in 200 ms of which 3 ms to minimize.
[2024-05-28 22:23:59] [INFO ] Deduced a trap composed of 146 places in 251 ms of which 4 ms to minimize.
[2024-05-28 22:23:59] [INFO ] Deduced a trap composed of 141 places in 205 ms of which 2 ms to minimize.
[2024-05-28 22:23:59] [INFO ] Deduced a trap composed of 142 places in 197 ms of which 3 ms to minimize.
[2024-05-28 22:23:59] [INFO ] Deduced a trap composed of 181 places in 197 ms of which 3 ms to minimize.
[2024-05-28 22:24:00] [INFO ] Deduced a trap composed of 157 places in 197 ms of which 3 ms to minimize.
[2024-05-28 22:24:00] [INFO ] Deduced a trap composed of 131 places in 197 ms of which 3 ms to minimize.
[2024-05-28 22:24:00] [INFO ] Deduced a trap composed of 171 places in 243 ms of which 3 ms to minimize.
[2024-05-28 22:24:00] [INFO ] Deduced a trap composed of 151 places in 196 ms of which 3 ms to minimize.
[2024-05-28 22:24:01] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 3 ms to minimize.
[2024-05-28 22:24:01] [INFO ] Deduced a trap composed of 161 places in 200 ms of which 3 ms to minimize.
[2024-05-28 22:24:01] [INFO ] Deduced a trap composed of 177 places in 200 ms of which 3 ms to minimize.
[2024-05-28 22:24:01] [INFO ] Deduced a trap composed of 132 places in 196 ms of which 3 ms to minimize.
[2024-05-28 22:24:01] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 3 ms to minimize.
[2024-05-28 22:24:02] [INFO ] Deduced a trap composed of 162 places in 263 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:24:14] [INFO ] Deduced a trap composed of 136 places in 306 ms of which 4 ms to minimize.
[2024-05-28 22:24:14] [INFO ] Deduced a trap composed of 121 places in 244 ms of which 3 ms to minimize.
[2024-05-28 22:24:14] [INFO ] Deduced a trap composed of 121 places in 223 ms of which 3 ms to minimize.
[2024-05-28 22:24:14] [INFO ] Deduced a trap composed of 121 places in 213 ms of which 7 ms to minimize.
[2024-05-28 22:24:15] [INFO ] Deduced a trap composed of 106 places in 211 ms of which 3 ms to minimize.
[2024-05-28 22:24:15] [INFO ] Deduced a trap composed of 131 places in 266 ms of which 4 ms to minimize.
[2024-05-28 22:24:15] [INFO ] Deduced a trap composed of 79 places in 253 ms of which 4 ms to minimize.
[2024-05-28 22:24:16] [INFO ] Deduced a trap composed of 78 places in 255 ms of which 4 ms to minimize.
[2024-05-28 22:24:16] [INFO ] Deduced a trap composed of 121 places in 255 ms of which 4 ms to minimize.
[2024-05-28 22:24:16] [INFO ] Deduced a trap composed of 131 places in 252 ms of which 4 ms to minimize.
[2024-05-28 22:24:16] [INFO ] Deduced a trap composed of 121 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:24:17] [INFO ] Deduced a trap composed of 126 places in 211 ms of which 3 ms to minimize.
[2024-05-28 22:24:17] [INFO ] Deduced a trap composed of 111 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:24:17] [INFO ] Deduced a trap composed of 117 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:24:17] [INFO ] Deduced a trap composed of 116 places in 206 ms of which 3 ms to minimize.
[2024-05-28 22:24:17] [INFO ] Deduced a trap composed of 112 places in 207 ms of which 4 ms to minimize.
[2024-05-28 22:24:18] [INFO ] Deduced a trap composed of 142 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:24:18] [INFO ] Deduced a trap composed of 131 places in 212 ms of which 2 ms to minimize.
[2024-05-28 22:24:18] [INFO ] Deduced a trap composed of 126 places in 207 ms of which 3 ms to minimize.
[2024-05-28 22:24:18] [INFO ] Deduced a trap composed of 116 places in 208 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:24:21] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 3 ms to minimize.
[2024-05-28 22:24:22] [INFO ] Deduced a trap composed of 175 places in 394 ms of which 4 ms to minimize.
[2024-05-28 22:24:22] [INFO ] Deduced a trap composed of 151 places in 340 ms of which 4 ms to minimize.
[2024-05-28 22:24:22] [INFO ] Deduced a trap composed of 111 places in 304 ms of which 3 ms to minimize.
[2024-05-28 22:24:23] [INFO ] Deduced a trap composed of 166 places in 292 ms of which 3 ms to minimize.
[2024-05-28 22:24:23] [INFO ] Deduced a trap composed of 161 places in 291 ms of which 3 ms to minimize.
[2024-05-28 22:24:23] [INFO ] Deduced a trap composed of 140 places in 287 ms of which 3 ms to minimize.
[2024-05-28 22:24:24] [INFO ] Deduced a trap composed of 152 places in 283 ms of which 3 ms to minimize.
[2024-05-28 22:24:24] [INFO ] Deduced a trap composed of 121 places in 292 ms of which 3 ms to minimize.
[2024-05-28 22:24:24] [INFO ] Deduced a trap composed of 156 places in 294 ms of which 5 ms to minimize.
[2024-05-28 22:24:24] [INFO ] Deduced a trap composed of 136 places in 288 ms of which 3 ms to minimize.
[2024-05-28 22:24:25] [INFO ] Deduced a trap composed of 160 places in 293 ms of which 3 ms to minimize.
[2024-05-28 22:24:25] [INFO ] Deduced a trap composed of 156 places in 307 ms of which 3 ms to minimize.
[2024-05-28 22:24:25] [INFO ] Deduced a trap composed of 160 places in 287 ms of which 3 ms to minimize.
[2024-05-28 22:24:26] [INFO ] Deduced a trap composed of 151 places in 286 ms of which 3 ms to minimize.
[2024-05-28 22:24:26] [INFO ] Deduced a trap composed of 155 places in 289 ms of which 3 ms to minimize.
[2024-05-28 22:24:26] [INFO ] Deduced a trap composed of 151 places in 288 ms of which 2 ms to minimize.
[2024-05-28 22:24:27] [INFO ] Deduced a trap composed of 146 places in 289 ms of which 3 ms to minimize.
[2024-05-28 22:24:27] [INFO ] Deduced a trap composed of 150 places in 302 ms of which 3 ms to minimize.
[2024-05-28 22:24:27] [INFO ] Deduced a trap composed of 146 places in 284 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:24:30] [INFO ] Deduced a trap composed of 116 places in 397 ms of which 4 ms to minimize.
[2024-05-28 22:24:30] [INFO ] Deduced a trap composed of 131 places in 349 ms of which 4 ms to minimize.
[2024-05-28 22:24:31] [INFO ] Deduced a trap composed of 156 places in 343 ms of which 3 ms to minimize.
[2024-05-28 22:24:31] [INFO ] Deduced a trap composed of 116 places in 286 ms of which 3 ms to minimize.
[2024-05-28 22:24:31] [INFO ] Deduced a trap composed of 121 places in 284 ms of which 3 ms to minimize.
[2024-05-28 22:24:32] [INFO ] Deduced a trap composed of 130 places in 285 ms of which 2 ms to minimize.
[2024-05-28 22:24:32] [INFO ] Deduced a trap composed of 116 places in 283 ms of which 2 ms to minimize.
[2024-05-28 22:24:32] [INFO ] Deduced a trap composed of 146 places in 316 ms of which 3 ms to minimize.
[2024-05-28 22:24:32] [INFO ] Deduced a trap composed of 130 places in 289 ms of which 2 ms to minimize.
[2024-05-28 22:24:33] [INFO ] Deduced a trap composed of 126 places in 281 ms of which 3 ms to minimize.
[2024-05-28 22:24:33] [INFO ] Deduced a trap composed of 120 places in 283 ms of which 3 ms to minimize.
[2024-05-28 22:24:33] [INFO ] Deduced a trap composed of 131 places in 275 ms of which 3 ms to minimize.
[2024-05-28 22:24:34] [INFO ] Deduced a trap composed of 132 places in 280 ms of which 3 ms to minimize.
[2024-05-28 22:24:34] [INFO ] Deduced a trap composed of 106 places in 279 ms of which 3 ms to minimize.
[2024-05-28 22:24:34] [INFO ] Deduced a trap composed of 111 places in 273 ms of which 2 ms to minimize.
[2024-05-28 22:24:35] [INFO ] Deduced a trap composed of 161 places in 315 ms of which 3 ms to minimize.
[2024-05-28 22:24:35] [INFO ] Deduced a trap composed of 132 places in 362 ms of which 4 ms to minimize.
[2024-05-28 22:24:35] [INFO ] Deduced a trap composed of 135 places in 342 ms of which 4 ms to minimize.
[2024-05-28 22:24:36] [INFO ] Deduced a trap composed of 121 places in 325 ms of which 3 ms to minimize.
[2024-05-28 22:24:36] [INFO ] Deduced a trap composed of 131 places in 284 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:24:39] [INFO ] Deduced a trap composed of 222 places in 298 ms of which 3 ms to minimize.
[2024-05-28 22:24:39] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 4 ms to minimize.
[2024-05-28 22:24:40] [INFO ] Deduced a trap composed of 182 places in 289 ms of which 4 ms to minimize.
[2024-05-28 22:24:40] [INFO ] Deduced a trap composed of 161 places in 300 ms of which 4 ms to minimize.
[2024-05-28 22:24:40] [INFO ] Deduced a trap composed of 171 places in 254 ms of which 5 ms to minimize.
[2024-05-28 22:24:41] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 4 ms to minimize.
[2024-05-28 22:24:41] [INFO ] Deduced a trap composed of 171 places in 255 ms of which 4 ms to minimize.
[2024-05-28 22:24:41] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 4 ms to minimize.
[2024-05-28 22:24:41] [INFO ] Deduced a trap composed of 176 places in 231 ms of which 3 ms to minimize.
[2024-05-28 22:24:42] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 3 ms to minimize.
SMT process timed out in 65436ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 65459ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72814 ms. Remains : 580/580 places, 1251/1251 transitions.
RANDOM walk for 400000 steps (29207 resets) in 3335 ms. (119 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-28 22:24:43] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:24:43] [INFO ] Invariant cache hit.
[2024-05-28 22:24:43] [INFO ] [Real]Absence check using 63 positive place invariants in 14 ms returned sat
[2024-05-28 22:24:43] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 30 ms returned sat
[2024-05-28 22:24:43] [INFO ] After 326ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 22:24:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:24:43] [INFO ] After 46ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 22:24:43] [INFO ] After 111ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:24:43] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:24:43] [INFO ] [Nat]Absence check using 63 positive place invariants in 11 ms returned sat
[2024-05-28 22:24:43] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 21 ms returned sat
[2024-05-28 22:24:44] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 22:24:44] [INFO ] After 70ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 22:24:44] [INFO ] Deduced a trap composed of 230 places in 418 ms of which 3 ms to minimize.
[2024-05-28 22:24:45] [INFO ] Deduced a trap composed of 235 places in 410 ms of which 4 ms to minimize.
[2024-05-28 22:24:45] [INFO ] Deduced a trap composed of 227 places in 410 ms of which 4 ms to minimize.
[2024-05-28 22:24:46] [INFO ] Deduced a trap composed of 236 places in 412 ms of which 4 ms to minimize.
[2024-05-28 22:24:46] [INFO ] Deduced a trap composed of 245 places in 429 ms of which 4 ms to minimize.
[2024-05-28 22:24:47] [INFO ] Deduced a trap composed of 235 places in 414 ms of which 4 ms to minimize.
[2024-05-28 22:24:47] [INFO ] Deduced a trap composed of 226 places in 412 ms of which 4 ms to minimize.
[2024-05-28 22:24:48] [INFO ] Deduced a trap composed of 235 places in 625 ms of which 6 ms to minimize.
[2024-05-28 22:24:49] [INFO ] Deduced a trap composed of 229 places in 691 ms of which 33 ms to minimize.
[2024-05-28 22:24:49] [INFO ] Deduced a trap composed of 238 places in 504 ms of which 4 ms to minimize.
[2024-05-28 22:24:53] [INFO ] Deduced a trap composed of 237 places in 3094 ms of which 3 ms to minimize.
[2024-05-28 22:24:53] [INFO ] Deduced a trap composed of 233 places in 434 ms of which 7 ms to minimize.
[2024-05-28 22:24:54] [INFO ] Deduced a trap composed of 243 places in 524 ms of which 5 ms to minimize.
[2024-05-28 22:24:54] [INFO ] Deduced a trap composed of 234 places in 494 ms of which 5 ms to minimize.
[2024-05-28 22:24:55] [INFO ] Deduced a trap composed of 230 places in 593 ms of which 4 ms to minimize.
[2024-05-28 22:24:55] [INFO ] Deduced a trap composed of 228 places in 452 ms of which 3 ms to minimize.
[2024-05-28 22:24:56] [INFO ] Deduced a trap composed of 222 places in 372 ms of which 4 ms to minimize.
[2024-05-28 22:24:57] [INFO ] Deduced a trap composed of 231 places in 408 ms of which 4 ms to minimize.
[2024-05-28 22:24:57] [INFO ] Deduced a trap composed of 225 places in 350 ms of which 4 ms to minimize.
[2024-05-28 22:24:58] [INFO ] Deduced a trap composed of 223 places in 490 ms of which 7 ms to minimize.
[2024-05-28 22:24:58] [INFO ] Deduced a trap composed of 243 places in 577 ms of which 4 ms to minimize.
[2024-05-28 22:24:59] [INFO ] Deduced a trap composed of 236 places in 454 ms of which 3 ms to minimize.
[2024-05-28 22:25:00] [INFO ] Deduced a trap composed of 231 places in 492 ms of which 4 ms to minimize.
[2024-05-28 22:25:00] [INFO ] Deduced a trap composed of 239 places in 499 ms of which 4 ms to minimize.
[2024-05-28 22:25:01] [INFO ] Deduced a trap composed of 235 places in 477 ms of which 4 ms to minimize.
[2024-05-28 22:25:01] [INFO ] Deduced a trap composed of 239 places in 477 ms of which 3 ms to minimize.
[2024-05-28 22:25:02] [INFO ] Deduced a trap composed of 225 places in 455 ms of which 4 ms to minimize.
[2024-05-28 22:25:03] [INFO ] Deduced a trap composed of 244 places in 454 ms of which 4 ms to minimize.
[2024-05-28 22:25:04] [INFO ] Deduced a trap composed of 229 places in 485 ms of which 4 ms to minimize.
[2024-05-28 22:25:04] [INFO ] Deduced a trap composed of 229 places in 513 ms of which 4 ms to minimize.
[2024-05-28 22:25:05] [INFO ] Deduced a trap composed of 232 places in 511 ms of which 5 ms to minimize.
[2024-05-28 22:25:06] [INFO ] Deduced a trap composed of 236 places in 478 ms of which 4 ms to minimize.
[2024-05-28 22:25:06] [INFO ] Deduced a trap composed of 236 places in 492 ms of which 4 ms to minimize.
[2024-05-28 22:25:07] [INFO ] Deduced a trap composed of 232 places in 505 ms of which 4 ms to minimize.
[2024-05-28 22:25:08] [INFO ] Deduced a trap composed of 238 places in 493 ms of which 4 ms to minimize.
[2024-05-28 22:25:08] [INFO ] Deduced a trap composed of 239 places in 470 ms of which 5 ms to minimize.
[2024-05-28 22:25:09] [INFO ] Deduced a trap composed of 245 places in 477 ms of which 4 ms to minimize.
[2024-05-28 22:25:09] [INFO ] Deduced a trap composed of 226 places in 483 ms of which 4 ms to minimize.
[2024-05-28 22:25:10] [INFO ] Deduced a trap composed of 226 places in 502 ms of which 4 ms to minimize.
[2024-05-28 22:25:11] [INFO ] Deduced a trap composed of 234 places in 492 ms of which 4 ms to minimize.
[2024-05-28 22:25:12] [INFO ] Deduced a trap composed of 232 places in 489 ms of which 4 ms to minimize.
[2024-05-28 22:25:12] [INFO ] Deduced a trap composed of 234 places in 515 ms of which 5 ms to minimize.
[2024-05-28 22:25:13] [INFO ] Deduced a trap composed of 239 places in 484 ms of which 4 ms to minimize.
[2024-05-28 22:25:14] [INFO ] Deduced a trap composed of 232 places in 514 ms of which 4 ms to minimize.
[2024-05-28 22:25:15] [INFO ] Deduced a trap composed of 232 places in 537 ms of which 6 ms to minimize.
[2024-05-28 22:25:16] [INFO ] Deduced a trap composed of 224 places in 515 ms of which 4 ms to minimize.
[2024-05-28 22:25:17] [INFO ] Deduced a trap composed of 236 places in 574 ms of which 29 ms to minimize.
[2024-05-28 22:25:19] [INFO ] Deduced a trap composed of 236 places in 579 ms of which 29 ms to minimize.
[2024-05-28 22:25:20] [INFO ] Deduced a trap composed of 233 places in 615 ms of which 4 ms to minimize.
[2024-05-28 22:25:20] [INFO ] Deduced a trap composed of 226 places in 551 ms of which 4 ms to minimize.
[2024-05-28 22:25:21] [INFO ] Deduced a trap composed of 236 places in 528 ms of which 4 ms to minimize.
[2024-05-28 22:25:22] [INFO ] Deduced a trap composed of 236 places in 545 ms of which 5 ms to minimize.
[2024-05-28 22:25:22] [INFO ] Deduced a trap composed of 234 places in 664 ms of which 4 ms to minimize.
[2024-05-28 22:25:23] [INFO ] Deduced a trap composed of 229 places in 526 ms of which 4 ms to minimize.
[2024-05-28 22:25:24] [INFO ] Deduced a trap composed of 243 places in 657 ms of which 29 ms to minimize.
[2024-05-28 22:25:25] [INFO ] Deduced a trap composed of 231 places in 468 ms of which 4 ms to minimize.
[2024-05-28 22:25:26] [INFO ] Deduced a trap composed of 236 places in 469 ms of which 4 ms to minimize.
[2024-05-28 22:25:27] [INFO ] Deduced a trap composed of 232 places in 521 ms of which 5 ms to minimize.
[2024-05-28 22:25:27] [INFO ] Deduced a trap composed of 222 places in 556 ms of which 4 ms to minimize.
[2024-05-28 22:25:28] [INFO ] Deduced a trap composed of 233 places in 573 ms of which 4 ms to minimize.
[2024-05-28 22:25:31] [INFO ] Deduced a trap composed of 234 places in 592 ms of which 5 ms to minimize.
[2024-05-28 22:25:32] [INFO ] Deduced a trap composed of 236 places in 518 ms of which 5 ms to minimize.
[2024-05-28 22:25:37] [INFO ] Deduced a trap composed of 226 places in 5862 ms of which 3 ms to minimize.
[2024-05-28 22:25:38] [INFO ] Deduced a trap composed of 227 places in 351 ms of which 3 ms to minimize.
[2024-05-28 22:25:38] [INFO ] Deduced a trap composed of 234 places in 357 ms of which 4 ms to minimize.
[2024-05-28 22:25:39] [INFO ] Deduced a trap composed of 220 places in 331 ms of which 3 ms to minimize.
[2024-05-28 22:25:40] [INFO ] Deduced a trap composed of 230 places in 666 ms of which 7 ms to minimize.
[2024-05-28 22:25:42] [INFO ] Deduced a trap composed of 240 places in 685 ms of which 32 ms to minimize.
[2024-05-28 22:25:42] [INFO ] Deduced a trap composed of 242 places in 483 ms of which 6 ms to minimize.
[2024-05-28 22:25:43] [INFO ] Deduced a trap composed of 241 places in 476 ms of which 3 ms to minimize.
[2024-05-28 22:25:43] [INFO ] Deduced a trap composed of 230 places in 586 ms of which 3 ms to minimize.
[2024-05-28 22:25:44] [INFO ] Deduced a trap composed of 238 places in 416 ms of which 3 ms to minimize.
[2024-05-28 22:25:44] [INFO ] Deduced a trap composed of 224 places in 399 ms of which 3 ms to minimize.
[2024-05-28 22:25:46] [INFO ] Deduced a trap composed of 231 places in 402 ms of which 3 ms to minimize.
[2024-05-28 22:25:47] [INFO ] Deduced a trap composed of 234 places in 452 ms of which 3 ms to minimize.
[2024-05-28 22:25:48] [INFO ] Deduced a trap composed of 233 places in 400 ms of which 3 ms to minimize.
[2024-05-28 22:25:49] [INFO ] Deduced a trap composed of 231 places in 450 ms of which 6 ms to minimize.
[2024-05-28 22:25:52] [INFO ] Deduced a trap composed of 238 places in 405 ms of which 3 ms to minimize.
[2024-05-28 22:25:52] [INFO ] Deduced a trap composed of 228 places in 394 ms of which 3 ms to minimize.
[2024-05-28 22:25:53] [INFO ] Deduced a trap composed of 236 places in 375 ms of which 3 ms to minimize.
[2024-05-28 22:25:53] [INFO ] Deduced a trap composed of 228 places in 322 ms of which 3 ms to minimize.
[2024-05-28 22:25:55] [INFO ] Deduced a trap composed of 237 places in 367 ms of which 4 ms to minimize.
[2024-05-28 22:25:56] [INFO ] Deduced a trap composed of 241 places in 407 ms of which 4 ms to minimize.
[2024-05-28 22:25:57] [INFO ] Deduced a trap composed of 223 places in 402 ms of which 3 ms to minimize.
[2024-05-28 22:25:58] [INFO ] Deduced a trap composed of 228 places in 480 ms of which 3 ms to minimize.
[2024-05-28 22:25:59] [INFO ] Deduced a trap composed of 230 places in 494 ms of which 12 ms to minimize.
[2024-05-28 22:26:00] [INFO ] Deduced a trap composed of 230 places in 543 ms of which 13 ms to minimize.
[2024-05-28 22:26:01] [INFO ] Deduced a trap composed of 234 places in 503 ms of which 4 ms to minimize.
[2024-05-28 22:26:02] [INFO ] Deduced a trap composed of 231 places in 801 ms of which 4 ms to minimize.
[2024-05-28 22:26:03] [INFO ] Deduced a trap composed of 230 places in 340 ms of which 3 ms to minimize.
[2024-05-28 22:26:08] [INFO ] Deduced a trap composed of 226 places in 540 ms of which 3 ms to minimize.
[2024-05-28 22:26:09] [INFO ] Deduced a trap composed of 231 places in 335 ms of which 3 ms to minimize.
[2024-05-28 22:26:29] [INFO ] Trap strengthening (SAT) tested/added 92/92 trap constraints in 105539 ms
TRAPS : Iteration 1
[2024-05-28 22:26:30] [INFO ] After 105816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-28 22:26:30] [INFO ] After 106459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
RANDOM walk for 40000 steps (2934 resets) in 483 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (350 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 326415 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 326415 steps, saw 53139 distinct states, run finished after 3002 ms. (steps per millisecond=108 ) properties seen :0
[2024-05-28 22:26:33] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:26:33] [INFO ] Invariant cache hit.
[2024-05-28 22:26:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:26:33] [INFO ] Deduced a trap composed of 238 places in 358 ms of which 6 ms to minimize.
[2024-05-28 22:26:34] [INFO ] Deduced a trap composed of 232 places in 499 ms of which 5 ms to minimize.
[2024-05-28 22:26:34] [INFO ] Deduced a trap composed of 232 places in 382 ms of which 6 ms to minimize.
[2024-05-28 22:26:35] [INFO ] Deduced a trap composed of 232 places in 400 ms of which 6 ms to minimize.
[2024-05-28 22:26:35] [INFO ] Deduced a trap composed of 226 places in 374 ms of which 4 ms to minimize.
[2024-05-28 22:26:35] [INFO ] Deduced a trap composed of 232 places in 378 ms of which 6 ms to minimize.
[2024-05-28 22:26:36] [INFO ] Deduced a trap composed of 240 places in 378 ms of which 4 ms to minimize.
[2024-05-28 22:26:36] [INFO ] Deduced a trap composed of 234 places in 383 ms of which 5 ms to minimize.
[2024-05-28 22:26:37] [INFO ] Deduced a trap composed of 226 places in 391 ms of which 4 ms to minimize.
[2024-05-28 22:26:37] [INFO ] Deduced a trap composed of 226 places in 407 ms of which 4 ms to minimize.
[2024-05-28 22:26:37] [INFO ] Deduced a trap composed of 234 places in 381 ms of which 3 ms to minimize.
[2024-05-28 22:26:38] [INFO ] Deduced a trap composed of 232 places in 422 ms of which 4 ms to minimize.
SMT process timed out in 5079ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 74 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Running 1240 sub problems to find dead transitions.
[2024-05-28 22:26:38] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:26:38] [INFO ] Invariant cache hit.
[2024-05-28 22:26:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:27:02] [INFO ] Deduced a trap composed of 167 places in 328 ms of which 6 ms to minimize.
[2024-05-28 22:27:02] [INFO ] Deduced a trap composed of 166 places in 341 ms of which 6 ms to minimize.
[2024-05-28 22:27:02] [INFO ] Deduced a trap composed of 161 places in 330 ms of which 4 ms to minimize.
[2024-05-28 22:27:03] [INFO ] Deduced a trap composed of 156 places in 343 ms of which 5 ms to minimize.
[2024-05-28 22:27:03] [INFO ] Deduced a trap composed of 156 places in 294 ms of which 4 ms to minimize.
[2024-05-28 22:27:04] [INFO ] Deduced a trap composed of 240 places in 306 ms of which 3 ms to minimize.
[2024-05-28 22:27:04] [INFO ] Deduced a trap composed of 236 places in 177 ms of which 3 ms to minimize.
[2024-05-28 22:27:04] [INFO ] Deduced a trap composed of 228 places in 176 ms of which 3 ms to minimize.
[2024-05-28 22:27:04] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 3 ms to minimize.
[2024-05-28 22:27:05] [INFO ] Deduced a trap composed of 171 places in 976 ms of which 3 ms to minimize.
[2024-05-28 22:27:06] [INFO ] Deduced a trap composed of 224 places in 199 ms of which 3 ms to minimize.
[2024-05-28 22:27:06] [INFO ] Deduced a trap composed of 224 places in 199 ms of which 3 ms to minimize.
[2024-05-28 22:27:06] [INFO ] Deduced a trap composed of 151 places in 196 ms of which 3 ms to minimize.
[2024-05-28 22:27:06] [INFO ] Deduced a trap composed of 146 places in 189 ms of which 2 ms to minimize.
SMT process timed out in 28297ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 28324ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28402 ms. Remains : 580/580 places, 1251/1251 transitions.
RANDOM walk for 40000 steps (2953 resets) in 443 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (376 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 335913 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 335913 steps, saw 54605 distinct states, run finished after 3002 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-28 22:27:10] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:27:10] [INFO ] Invariant cache hit.
[2024-05-28 22:27:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:27:10] [INFO ] Deduced a trap composed of 238 places in 325 ms of which 3 ms to minimize.
[2024-05-28 22:27:10] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 4 ms to minimize.
[2024-05-28 22:27:11] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 3 ms to minimize.
[2024-05-28 22:27:11] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 4 ms to minimize.
[2024-05-28 22:27:11] [INFO ] Deduced a trap composed of 226 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:27:11] [INFO ] Deduced a trap composed of 232 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:27:12] [INFO ] Deduced a trap composed of 240 places in 224 ms of which 4 ms to minimize.
[2024-05-28 22:27:12] [INFO ] Deduced a trap composed of 234 places in 222 ms of which 3 ms to minimize.
[2024-05-28 22:27:12] [INFO ] Deduced a trap composed of 226 places in 223 ms of which 3 ms to minimize.
[2024-05-28 22:27:12] [INFO ] Deduced a trap composed of 226 places in 222 ms of which 3 ms to minimize.
[2024-05-28 22:27:13] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:27:13] [INFO ] Deduced a trap composed of 232 places in 223 ms of which 3 ms to minimize.
[2024-05-28 22:27:13] [INFO ] Deduced a trap composed of 224 places in 220 ms of which 3 ms to minimize.
[2024-05-28 22:27:13] [INFO ] Deduced a trap composed of 236 places in 223 ms of which 3 ms to minimize.
[2024-05-28 22:27:13] [INFO ] Deduced a trap composed of 212 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:27:14] [INFO ] Deduced a trap composed of 236 places in 224 ms of which 3 ms to minimize.
[2024-05-28 22:27:14] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 2 ms to minimize.
[2024-05-28 22:27:14] [INFO ] Deduced a trap composed of 230 places in 220 ms of which 3 ms to minimize.
[2024-05-28 22:27:14] [INFO ] Deduced a trap composed of 234 places in 222 ms of which 3 ms to minimize.
[2024-05-28 22:27:15] [INFO ] Deduced a trap composed of 230 places in 226 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:27:15] [INFO ] Deduced a trap composed of 216 places in 215 ms of which 3 ms to minimize.
[2024-05-28 22:27:15] [INFO ] Deduced a trap composed of 220 places in 215 ms of which 3 ms to minimize.
[2024-05-28 22:27:15] [INFO ] Deduced a trap composed of 208 places in 221 ms of which 3 ms to minimize.
[2024-05-28 22:27:16] [INFO ] Deduced a trap composed of 232 places in 228 ms of which 7 ms to minimize.
[2024-05-28 22:27:16] [INFO ] Deduced a trap composed of 236 places in 223 ms of which 3 ms to minimize.
[2024-05-28 22:27:16] [INFO ] Deduced a trap composed of 230 places in 276 ms of which 3 ms to minimize.
[2024-05-28 22:27:16] [INFO ] Deduced a trap composed of 242 places in 256 ms of which 3 ms to minimize.
[2024-05-28 22:27:17] [INFO ] Deduced a trap composed of 224 places in 228 ms of which 3 ms to minimize.
[2024-05-28 22:27:17] [INFO ] Deduced a trap composed of 224 places in 223 ms of which 3 ms to minimize.
[2024-05-28 22:27:17] [INFO ] Deduced a trap composed of 234 places in 229 ms of which 3 ms to minimize.
[2024-05-28 22:27:17] [INFO ] Deduced a trap composed of 232 places in 303 ms of which 4 ms to minimize.
[2024-05-28 22:27:18] [INFO ] Deduced a trap composed of 224 places in 235 ms of which 3 ms to minimize.
[2024-05-28 22:27:18] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 3 ms to minimize.
[2024-05-28 22:27:18] [INFO ] Deduced a trap composed of 204 places in 221 ms of which 3 ms to minimize.
[2024-05-28 22:27:18] [INFO ] Deduced a trap composed of 228 places in 224 ms of which 3 ms to minimize.
[2024-05-28 22:27:19] [INFO ] Deduced a trap composed of 230 places in 230 ms of which 3 ms to minimize.
[2024-05-28 22:27:19] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 3 ms to minimize.
[2024-05-28 22:27:19] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:27:19] [INFO ] Deduced a trap composed of 234 places in 221 ms of which 3 ms to minimize.
[2024-05-28 22:27:20] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:27:20] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 3 ms to minimize.
[2024-05-28 22:27:20] [INFO ] Deduced a trap composed of 220 places in 246 ms of which 3 ms to minimize.
[2024-05-28 22:27:20] [INFO ] Deduced a trap composed of 232 places in 221 ms of which 3 ms to minimize.
[2024-05-28 22:27:21] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 3 ms to minimize.
[2024-05-28 22:27:21] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 3 ms to minimize.
[2024-05-28 22:27:21] [INFO ] Deduced a trap composed of 238 places in 248 ms of which 3 ms to minimize.
[2024-05-28 22:27:21] [INFO ] Deduced a trap composed of 230 places in 293 ms of which 3 ms to minimize.
[2024-05-28 22:27:22] [INFO ] Deduced a trap composed of 232 places in 213 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/579 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1242/1821 variables, 579/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1821 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1821 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1822 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1822 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1822 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1822/1822 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14142 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 580/580 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 383/549 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/578 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 48/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:27:24] [INFO ] Deduced a trap composed of 230 places in 352 ms of which 6 ms to minimize.
[2024-05-28 22:27:25] [INFO ] Deduced a trap composed of 234 places in 317 ms of which 4 ms to minimize.
[2024-05-28 22:27:25] [INFO ] Deduced a trap composed of 238 places in 303 ms of which 3 ms to minimize.
[2024-05-28 22:27:25] [INFO ] Deduced a trap composed of 232 places in 231 ms of which 3 ms to minimize.
[2024-05-28 22:27:25] [INFO ] Deduced a trap composed of 232 places in 223 ms of which 3 ms to minimize.
[2024-05-28 22:27:26] [INFO ] Deduced a trap composed of 236 places in 221 ms of which 2 ms to minimize.
[2024-05-28 22:27:26] [INFO ] Deduced a trap composed of 234 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:27:26] [INFO ] Deduced a trap composed of 222 places in 214 ms of which 3 ms to minimize.
[2024-05-28 22:27:26] [INFO ] Deduced a trap composed of 234 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:27:27] [INFO ] Deduced a trap composed of 234 places in 224 ms of which 3 ms to minimize.
[2024-05-28 22:27:27] [INFO ] Deduced a trap composed of 222 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:27:27] [INFO ] Deduced a trap composed of 244 places in 220 ms of which 3 ms to minimize.
[2024-05-28 22:27:27] [INFO ] Deduced a trap composed of 232 places in 220 ms of which 3 ms to minimize.
[2024-05-28 22:27:27] [INFO ] Deduced a trap composed of 234 places in 221 ms of which 3 ms to minimize.
[2024-05-28 22:27:28] [INFO ] Deduced a trap composed of 234 places in 226 ms of which 3 ms to minimize.
[2024-05-28 22:27:28] [INFO ] Deduced a trap composed of 234 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:27:28] [INFO ] Deduced a trap composed of 226 places in 216 ms of which 3 ms to minimize.
[2024-05-28 22:27:28] [INFO ] Deduced a trap composed of 232 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:27:29] [INFO ] Deduced a trap composed of 234 places in 220 ms of which 3 ms to minimize.
[2024-05-28 22:27:29] [INFO ] Deduced a trap composed of 230 places in 213 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:27:29] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 3 ms to minimize.
[2024-05-28 22:27:29] [INFO ] Deduced a trap composed of 232 places in 223 ms of which 3 ms to minimize.
[2024-05-28 22:27:30] [INFO ] Deduced a trap composed of 232 places in 239 ms of which 5 ms to minimize.
[2024-05-28 22:27:30] [INFO ] Deduced a trap composed of 236 places in 215 ms of which 3 ms to minimize.
[2024-05-28 22:27:30] [INFO ] Deduced a trap composed of 232 places in 222 ms of which 3 ms to minimize.
[2024-05-28 22:27:30] [INFO ] Deduced a trap composed of 220 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:27:31] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:27:31] [INFO ] Deduced a trap composed of 234 places in 216 ms of which 4 ms to minimize.
[2024-05-28 22:27:31] [INFO ] Deduced a trap composed of 228 places in 223 ms of which 3 ms to minimize.
[2024-05-28 22:27:31] [INFO ] Deduced a trap composed of 240 places in 220 ms of which 3 ms to minimize.
[2024-05-28 22:27:31] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:27:32] [INFO ] Deduced a trap composed of 220 places in 220 ms of which 3 ms to minimize.
[2024-05-28 22:27:32] [INFO ] Deduced a trap composed of 242 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:27:32] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 2 ms to minimize.
[2024-05-28 22:27:32] [INFO ] Deduced a trap composed of 236 places in 222 ms of which 3 ms to minimize.
[2024-05-28 22:27:33] [INFO ] Deduced a trap composed of 228 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:27:33] [INFO ] Deduced a trap composed of 226 places in 216 ms of which 3 ms to minimize.
[2024-05-28 22:27:33] [INFO ] Deduced a trap composed of 234 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:27:33] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 3 ms to minimize.
[2024-05-28 22:27:34] [INFO ] Deduced a trap composed of 234 places in 220 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:27:34] [INFO ] Deduced a trap composed of 232 places in 210 ms of which 3 ms to minimize.
[2024-05-28 22:27:34] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 3 ms to minimize.
[2024-05-28 22:27:34] [INFO ] Deduced a trap composed of 234 places in 205 ms of which 3 ms to minimize.
[2024-05-28 22:27:35] [INFO ] Deduced a trap composed of 232 places in 322 ms of which 2 ms to minimize.
[2024-05-28 22:27:35] [INFO ] Deduced a trap composed of 228 places in 355 ms of which 4 ms to minimize.
[2024-05-28 22:27:36] [INFO ] Deduced a trap composed of 230 places in 340 ms of which 4 ms to minimize.
[2024-05-28 22:27:37] [INFO ] Deduced a trap composed of 234 places in 361 ms of which 4 ms to minimize.
[2024-05-28 22:27:38] [INFO ] Deduced a trap composed of 234 places in 367 ms of which 4 ms to minimize.
[2024-05-28 22:27:39] [INFO ] Deduced a trap composed of 228 places in 355 ms of which 4 ms to minimize.
[2024-05-28 22:27:39] [INFO ] Deduced a trap composed of 226 places in 339 ms of which 7 ms to minimize.
[2024-05-28 22:27:39] [INFO ] Deduced a trap composed of 238 places in 325 ms of which 4 ms to minimize.
[2024-05-28 22:27:40] [INFO ] Deduced a trap composed of 232 places in 304 ms of which 3 ms to minimize.
[2024-05-28 22:27:40] [INFO ] Deduced a trap composed of 226 places in 383 ms of which 4 ms to minimize.
[2024-05-28 22:27:41] [INFO ] Deduced a trap composed of 226 places in 381 ms of which 4 ms to minimize.
[2024-05-28 22:27:41] [INFO ] Deduced a trap composed of 234 places in 360 ms of which 4 ms to minimize.
[2024-05-28 22:27:42] [INFO ] Deduced a trap composed of 232 places in 345 ms of which 4 ms to minimize.
[2024-05-28 22:27:42] [INFO ] Deduced a trap composed of 232 places in 362 ms of which 4 ms to minimize.
[2024-05-28 22:27:42] [INFO ] Deduced a trap composed of 224 places in 326 ms of which 4 ms to minimize.
[2024-05-28 22:27:43] [INFO ] Deduced a trap composed of 238 places in 348 ms of which 4 ms to minimize.
[2024-05-28 22:27:43] [INFO ] Deduced a trap composed of 224 places in 375 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:27:44] [INFO ] Deduced a trap composed of 227 places in 374 ms of which 3 ms to minimize.
[2024-05-28 22:27:45] [INFO ] Deduced a trap composed of 239 places in 387 ms of which 4 ms to minimize.
[2024-05-28 22:27:45] [INFO ] Deduced a trap composed of 232 places in 377 ms of which 4 ms to minimize.
[2024-05-28 22:27:45] [INFO ] Deduced a trap composed of 230 places in 339 ms of which 4 ms to minimize.
[2024-05-28 22:27:46] [INFO ] Deduced a trap composed of 234 places in 371 ms of which 4 ms to minimize.
[2024-05-28 22:27:47] [INFO ] Deduced a trap composed of 224 places in 388 ms of which 7 ms to minimize.
[2024-05-28 22:27:47] [INFO ] Deduced a trap composed of 230 places in 345 ms of which 3 ms to minimize.
[2024-05-28 22:27:47] [INFO ] Deduced a trap composed of 224 places in 289 ms of which 3 ms to minimize.
[2024-05-28 22:27:47] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 3 ms to minimize.
[2024-05-28 22:27:48] [INFO ] Deduced a trap composed of 238 places in 311 ms of which 3 ms to minimize.
[2024-05-28 22:27:48] [INFO ] Deduced a trap composed of 230 places in 308 ms of which 2 ms to minimize.
[2024-05-28 22:27:49] [INFO ] Deduced a trap composed of 238 places in 347 ms of which 4 ms to minimize.
[2024-05-28 22:27:49] [INFO ] Deduced a trap composed of 230 places in 301 ms of which 4 ms to minimize.
[2024-05-28 22:27:49] [INFO ] Deduced a trap composed of 240 places in 328 ms of which 4 ms to minimize.
[2024-05-28 22:27:50] [INFO ] Deduced a trap composed of 230 places in 294 ms of which 3 ms to minimize.
[2024-05-28 22:27:50] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 2 ms to minimize.
[2024-05-28 22:27:50] [INFO ] Deduced a trap composed of 238 places in 253 ms of which 3 ms to minimize.
[2024-05-28 22:27:50] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 4 ms to minimize.
[2024-05-28 22:27:51] [INFO ] Deduced a trap composed of 220 places in 286 ms of which 3 ms to minimize.
[2024-05-28 22:27:51] [INFO ] Deduced a trap composed of 222 places in 263 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:27:51] [INFO ] Deduced a trap composed of 226 places in 317 ms of which 3 ms to minimize.
[2024-05-28 22:27:52] [INFO ] Deduced a trap composed of 232 places in 263 ms of which 3 ms to minimize.
[2024-05-28 22:27:53] [INFO ] Deduced a trap composed of 223 places in 390 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 22:27:53] [INFO ] Flatten gal took : 148 ms
[2024-05-28 22:27:53] [INFO ] Applying decomposition
[2024-05-28 22:27:53] [INFO ] Flatten gal took : 139 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/graph17295530035622794270.txt' '-o' '/tmp/graph17295530035622794270.bin' '-w' '/tmp/graph17295530035622794270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17295530035622794270.bin' '-l' '-1' '-v' '-w' '/tmp/graph17295530035622794270.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:27:53] [INFO ] Decomposing Gal with order
[2024-05-28 22:27:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:27:54] [INFO ] Deduced a trap composed of 224 places in 351 ms of which 2 ms to minimize.
[2024-05-28 22:27:54] [INFO ] Removed a total of 4529 redundant transitions.
[2024-05-28 22:27:54] [INFO ] Flatten gal took : 183 ms
[2024-05-28 22:27:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 416 labels/synchronizations in 28 ms.
[2024-05-28 22:27:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1716265571741318635.gal : 14 ms
[2024-05-28 22:27:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6281773991822300582.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1716265571741318635.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6281773991822300582.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2024-05-28 22:27:54] [INFO ] Deduced a trap composed of 234 places in 347 ms of which 4 ms to minimize.
Loading property file /tmp/ReachabilityCardinality6281773991822300582.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
[2024-05-28 22:27:54] [INFO ] Deduced a trap composed of 234 places in 335 ms of which 4 ms to minimize.
[2024-05-28 22:27:55] [INFO ] Deduced a trap composed of 208 places in 285 ms of which 3 ms to minimize.
[2024-05-28 22:27:55] [INFO ] Deduced a trap composed of 230 places in 309 ms of which 2 ms to minimize.
[2024-05-28 22:27:55] [INFO ] Deduced a trap composed of 230 places in 257 ms of which 3 ms to minimize.
[2024-05-28 22:27:55] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 3 ms to minimize.
[2024-05-28 22:27:56] [INFO ] Deduced a trap composed of 224 places in 257 ms of which 3 ms to minimize.
[2024-05-28 22:27:57] [INFO ] Deduced a trap composed of 230 places in 372 ms of which 4 ms to minimize.
[2024-05-28 22:27:57] [INFO ] Deduced a trap composed of 216 places in 358 ms of which 4 ms to minimize.
[2024-05-28 22:27:58] [INFO ] Deduced a trap composed of 227 places in 347 ms of which 4 ms to minimize.
[2024-05-28 22:27:58] [INFO ] Deduced a trap composed of 232 places in 282 ms of which 3 ms to minimize.
[2024-05-28 22:27:59] [INFO ] Deduced a trap composed of 231 places in 490 ms of which 5 ms to minimize.
[2024-05-28 22:27:59] [INFO ] Deduced a trap composed of 232 places in 394 ms of which 3 ms to minimize.
[2024-05-28 22:27:59] [INFO ] Deduced a trap composed of 230 places in 354 ms of which 4 ms to minimize.
[2024-05-28 22:28:00] [INFO ] Deduced a trap composed of 230 places in 357 ms of which 5 ms to minimize.
[2024-05-28 22:28:00] [INFO ] Deduced a trap composed of 222 places in 341 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:28:01] [INFO ] Deduced a trap composed of 239 places in 367 ms of which 5 ms to minimize.
[2024-05-28 22:28:01] [INFO ] Deduced a trap composed of 230 places in 368 ms of which 3 ms to minimize.
[2024-05-28 22:28:01] [INFO ] Deduced a trap composed of 235 places in 372 ms of which 6 ms to minimize.
[2024-05-28 22:28:02] [INFO ] Deduced a trap composed of 228 places in 378 ms of which 3 ms to minimize.
[2024-05-28 22:28:02] [INFO ] Deduced a trap composed of 232 places in 325 ms of which 4 ms to minimize.
[2024-05-28 22:28:02] [INFO ] Deduced a trap composed of 237 places in 353 ms of which 3 ms to minimize.
[2024-05-28 22:28:03] [INFO ] Deduced a trap composed of 238 places in 270 ms of which 3 ms to minimize.
[2024-05-28 22:28:03] [INFO ] Deduced a trap composed of 226 places in 269 ms of which 3 ms to minimize.
[2024-05-28 22:28:03] [INFO ] Deduced a trap composed of 236 places in 344 ms of which 3 ms to minimize.
[2024-05-28 22:28:04] [INFO ] Deduced a trap composed of 244 places in 300 ms of which 3 ms to minimize.
[2024-05-28 22:28:04] [INFO ] Deduced a trap composed of 234 places in 324 ms of which 5 ms to minimize.
[2024-05-28 22:28:04] [INFO ] Deduced a trap composed of 222 places in 270 ms of which 2 ms to minimize.
[2024-05-28 22:28:05] [INFO ] Deduced a trap composed of 226 places in 325 ms of which 2 ms to minimize.
[2024-05-28 22:28:05] [INFO ] Deduced a trap composed of 238 places in 270 ms of which 3 ms to minimize.
[2024-05-28 22:28:05] [INFO ] Deduced a trap composed of 236 places in 340 ms of which 3 ms to minimize.
[2024-05-28 22:28:06] [INFO ] Deduced a trap composed of 239 places in 361 ms of which 4 ms to minimize.
[2024-05-28 22:28:06] [INFO ] Deduced a trap composed of 232 places in 376 ms of which 4 ms to minimize.
[2024-05-28 22:28:06] [INFO ] Deduced a trap composed of 234 places in 380 ms of which 4 ms to minimize.
[2024-05-28 22:28:07] [INFO ] Deduced a trap composed of 234 places in 389 ms of which 5 ms to minimize.
[2024-05-28 22:28:07] [INFO ] Deduced a trap composed of 238 places in 388 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:28:08] [INFO ] Deduced a trap composed of 231 places in 387 ms of which 5 ms to minimize.
[2024-05-28 22:28:08] [INFO ] Deduced a trap composed of 231 places in 392 ms of which 5 ms to minimize.
[2024-05-28 22:28:08] [INFO ] Deduced a trap composed of 224 places in 331 ms of which 4 ms to minimize.
[2024-05-28 22:28:09] [INFO ] Deduced a trap composed of 236 places in 396 ms of which 4 ms to minimize.
SMT process timed out in 59349ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 47 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 39 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-28 22:28:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:28:09] [INFO ] Invariant cache hit.
[2024-05-28 22:28:10] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-28 22:28:10] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:28:10] [INFO ] Invariant cache hit.
[2024-05-28 22:28:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:28:17] [INFO ] Implicit Places using invariants and state equation in 6927 ms returned []
Implicit Place search using SMT with State Equation took 7658 ms to find 0 implicit places.
[2024-05-28 22:28:17] [INFO ] Redundant transitions in 37 ms returned []
Running 1240 sub problems to find dead transitions.
[2024-05-28 22:28:17] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-28 22:28:17] [INFO ] Invariant cache hit.
[2024-05-28 22:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:28:31] [INFO ] Deduced a trap composed of 167 places in 324 ms of which 12 ms to minimize.
[2024-05-28 22:28:32] [INFO ] Deduced a trap composed of 166 places in 314 ms of which 3 ms to minimize.
[2024-05-28 22:28:32] [INFO ] Deduced a trap composed of 161 places in 343 ms of which 12 ms to minimize.
[2024-05-28 22:28:32] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 3 ms to minimize.
[2024-05-28 22:28:33] [INFO ] Deduced a trap composed of 156 places in 387 ms of which 3 ms to minimize.
[2024-05-28 22:28:33] [INFO ] Deduced a trap composed of 240 places in 336 ms of which 3 ms to minimize.
[2024-05-28 22:28:34] [INFO ] Deduced a trap composed of 236 places in 318 ms of which 11 ms to minimize.
[2024-05-28 22:28:34] [INFO ] Deduced a trap composed of 228 places in 339 ms of which 3 ms to minimize.
[2024-05-28 22:28:34] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 4 ms to minimize.
[2024-05-28 22:28:35] [INFO ] Deduced a trap composed of 171 places in 372 ms of which 3 ms to minimize.
[2024-05-28 22:28:35] [INFO ] Deduced a trap composed of 224 places in 235 ms of which 3 ms to minimize.
[2024-05-28 22:28:35] [INFO ] Deduced a trap composed of 224 places in 227 ms of which 4 ms to minimize.
[2024-05-28 22:28:35] [INFO ] Deduced a trap composed of 151 places in 231 ms of which 4 ms to minimize.
[2024-05-28 22:28:36] [INFO ] Deduced a trap composed of 146 places in 335 ms of which 2 ms to minimize.
[2024-05-28 22:28:36] [INFO ] Deduced a trap composed of 236 places in 235 ms of which 4 ms to minimize.
[2024-05-28 22:28:36] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 3 ms to minimize.
[2024-05-28 22:28:37] [INFO ] Deduced a trap composed of 226 places in 350 ms of which 3 ms to minimize.
[2024-05-28 22:28:37] [INFO ] Deduced a trap composed of 230 places in 340 ms of which 3 ms to minimize.
[2024-05-28 22:28:37] [INFO ] Deduced a trap composed of 226 places in 232 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 2141
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2141 after 2141
[2024-05-28 22:28:38] [INFO ] Deduced a trap composed of 232 places in 231 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2141 after 2189
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2189 after 2193
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2193 after 4307
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4307 after 11535
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :11535 after 40627
[2024-05-28 22:28:39] [INFO ] Deduced a trap composed of 146 places in 460 ms of which 12 ms to minimize.
[2024-05-28 22:28:39] [INFO ] Deduced a trap composed of 162 places in 338 ms of which 3 ms to minimize.
[2024-05-28 22:28:40] [INFO ] Deduced a trap composed of 156 places in 340 ms of which 12 ms to minimize.
[2024-05-28 22:28:40] [INFO ] Deduced a trap composed of 152 places in 243 ms of which 4 ms to minimize.
[2024-05-28 22:28:40] [INFO ] Deduced a trap composed of 229 places in 308 ms of which 3 ms to minimize.
[2024-05-28 22:28:40] [INFO ] Deduced a trap composed of 146 places in 304 ms of which 3 ms to minimize.
[2024-05-28 22:28:41] [INFO ] Deduced a trap composed of 146 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:28:41] [INFO ] Deduced a trap composed of 141 places in 201 ms of which 3 ms to minimize.
[2024-05-28 22:28:41] [INFO ] Deduced a trap composed of 142 places in 203 ms of which 3 ms to minimize.
[2024-05-28 22:28:41] [INFO ] Deduced a trap composed of 181 places in 197 ms of which 3 ms to minimize.
[2024-05-28 22:28:42] [INFO ] Deduced a trap composed of 157 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:28:42] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 3 ms to minimize.
[2024-05-28 22:28:42] [INFO ] Deduced a trap composed of 171 places in 242 ms of which 3 ms to minimize.
[2024-05-28 22:28:42] [INFO ] Deduced a trap composed of 151 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:28:42] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 2 ms to minimize.
[2024-05-28 22:28:43] [INFO ] Deduced a trap composed of 161 places in 242 ms of which 4 ms to minimize.
[2024-05-28 22:28:43] [INFO ] Deduced a trap composed of 177 places in 190 ms of which 3 ms to minimize.
[2024-05-28 22:28:43] [INFO ] Deduced a trap composed of 132 places in 176 ms of which 2 ms to minimize.
[2024-05-28 22:28:43] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 2 ms to minimize.
[2024-05-28 22:28:43] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1822 variables, and 112 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:28:55] [INFO ] Deduced a trap composed of 136 places in 298 ms of which 4 ms to minimize.
[2024-05-28 22:28:55] [INFO ] Deduced a trap composed of 121 places in 250 ms of which 4 ms to minimize.
[2024-05-28 22:28:55] [INFO ] Deduced a trap composed of 121 places in 230 ms of which 4 ms to minimize.
[2024-05-28 22:28:56] [INFO ] Deduced a trap composed of 121 places in 244 ms of which 4 ms to minimize.
[2024-05-28 22:28:56] [INFO ] Deduced a trap composed of 106 places in 224 ms of which 3 ms to minimize.
[2024-05-28 22:28:56] [INFO ] Deduced a trap composed of 131 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:28:56] [INFO ] Deduced a trap composed of 79 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:28:57] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 3 ms to minimize.
[2024-05-28 22:28:57] [INFO ] Deduced a trap composed of 121 places in 190 ms of which 3 ms to minimize.
[2024-05-28 22:28:57] [INFO ] Deduced a trap composed of 131 places in 192 ms of which 3 ms to minimize.
[2024-05-28 22:28:57] [INFO ] Deduced a trap composed of 121 places in 187 ms of which 3 ms to minimize.
[2024-05-28 22:28:57] [INFO ] Deduced a trap composed of 126 places in 195 ms of which 3 ms to minimize.
[2024-05-28 22:28:58] [INFO ] Deduced a trap composed of 111 places in 185 ms of which 3 ms to minimize.
[2024-05-28 22:28:58] [INFO ] Deduced a trap composed of 117 places in 214 ms of which 3 ms to minimize.
[2024-05-28 22:28:58] [INFO ] Deduced a trap composed of 116 places in 192 ms of which 3 ms to minimize.
[2024-05-28 22:28:58] [INFO ] Deduced a trap composed of 112 places in 179 ms of which 3 ms to minimize.
[2024-05-28 22:28:58] [INFO ] Deduced a trap composed of 142 places in 191 ms of which 3 ms to minimize.
[2024-05-28 22:28:59] [INFO ] Deduced a trap composed of 131 places in 195 ms of which 3 ms to minimize.
[2024-05-28 22:28:59] [INFO ] Deduced a trap composed of 126 places in 176 ms of which 3 ms to minimize.
[2024-05-28 22:28:59] [INFO ] Deduced a trap composed of 116 places in 194 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:29:01] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 2 ms to minimize.
[2024-05-28 22:29:02] [INFO ] Deduced a trap composed of 175 places in 355 ms of which 4 ms to minimize.
[2024-05-28 22:29:02] [INFO ] Deduced a trap composed of 151 places in 302 ms of which 4 ms to minimize.
[2024-05-28 22:29:03] [INFO ] Deduced a trap composed of 111 places in 282 ms of which 3 ms to minimize.
[2024-05-28 22:29:03] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 3 ms to minimize.
[2024-05-28 22:29:03] [INFO ] Deduced a trap composed of 161 places in 249 ms of which 3 ms to minimize.
[2024-05-28 22:29:03] [INFO ] Deduced a trap composed of 140 places in 251 ms of which 3 ms to minimize.
[2024-05-28 22:29:04] [INFO ] Deduced a trap composed of 152 places in 249 ms of which 2 ms to minimize.
[2024-05-28 22:29:04] [INFO ] Deduced a trap composed of 121 places in 258 ms of which 3 ms to minimize.
[2024-05-28 22:29:04] [INFO ] Deduced a trap composed of 156 places in 257 ms of which 3 ms to minimize.
[2024-05-28 22:29:05] [INFO ] Deduced a trap composed of 136 places in 254 ms of which 3 ms to minimize.
[2024-05-28 22:29:05] [INFO ] Deduced a trap composed of 160 places in 252 ms of which 3 ms to minimize.
[2024-05-28 22:29:05] [INFO ] Deduced a trap composed of 156 places in 253 ms of which 3 ms to minimize.
[2024-05-28 22:29:05] [INFO ] Deduced a trap composed of 160 places in 345 ms of which 4 ms to minimize.
[2024-05-28 22:29:06] [INFO ] Deduced a trap composed of 151 places in 248 ms of which 2 ms to minimize.
[2024-05-28 22:29:06] [INFO ] Deduced a trap composed of 155 places in 255 ms of which 3 ms to minimize.
[2024-05-28 22:29:06] [INFO ] Deduced a trap composed of 151 places in 252 ms of which 3 ms to minimize.
[2024-05-28 22:29:07] [INFO ] Deduced a trap composed of 146 places in 248 ms of which 3 ms to minimize.
[2024-05-28 22:29:07] [INFO ] Deduced a trap composed of 150 places in 281 ms of which 3 ms to minimize.
[2024-05-28 22:29:07] [INFO ] Deduced a trap composed of 146 places in 278 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:29:09] [INFO ] Deduced a trap composed of 116 places in 408 ms of which 3 ms to minimize.
[2024-05-28 22:29:10] [INFO ] Deduced a trap composed of 131 places in 352 ms of which 3 ms to minimize.
[2024-05-28 22:29:10] [INFO ] Deduced a trap composed of 156 places in 376 ms of which 4 ms to minimize.
[2024-05-28 22:29:11] [INFO ] Deduced a trap composed of 116 places in 338 ms of which 4 ms to minimize.
[2024-05-28 22:29:11] [INFO ] Deduced a trap composed of 121 places in 302 ms of which 2 ms to minimize.
[2024-05-28 22:29:11] [INFO ] Deduced a trap composed of 130 places in 285 ms of which 2 ms to minimize.
[2024-05-28 22:29:12] [INFO ] Deduced a trap composed of 116 places in 304 ms of which 3 ms to minimize.
[2024-05-28 22:29:12] [INFO ] Deduced a trap composed of 146 places in 282 ms of which 2 ms to minimize.
[2024-05-28 22:29:12] [INFO ] Deduced a trap composed of 130 places in 281 ms of which 3 ms to minimize.
[2024-05-28 22:29:12] [INFO ] Deduced a trap composed of 126 places in 336 ms of which 3 ms to minimize.
[2024-05-28 22:29:13] [INFO ] Deduced a trap composed of 120 places in 300 ms of which 3 ms to minimize.
[2024-05-28 22:29:13] [INFO ] Deduced a trap composed of 131 places in 282 ms of which 4 ms to minimize.
[2024-05-28 22:29:13] [INFO ] Deduced a trap composed of 132 places in 281 ms of which 2 ms to minimize.
[2024-05-28 22:29:14] [INFO ] Deduced a trap composed of 106 places in 282 ms of which 3 ms to minimize.
[2024-05-28 22:29:14] [INFO ] Deduced a trap composed of 111 places in 279 ms of which 3 ms to minimize.
[2024-05-28 22:29:14] [INFO ] Deduced a trap composed of 161 places in 305 ms of which 3 ms to minimize.
[2024-05-28 22:29:15] [INFO ] Deduced a trap composed of 132 places in 284 ms of which 3 ms to minimize.
[2024-05-28 22:29:15] [INFO ] Deduced a trap composed of 135 places in 286 ms of which 3 ms to minimize.
[2024-05-28 22:29:15] [INFO ] Deduced a trap composed of 121 places in 285 ms of which 2 ms to minimize.
[2024-05-28 22:29:16] [INFO ] Deduced a trap composed of 131 places in 274 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-05-28 22:29:19] [INFO ] Deduced a trap composed of 222 places in 294 ms of which 4 ms to minimize.
[2024-05-28 22:29:19] [INFO ] Deduced a trap composed of 236 places in 279 ms of which 4 ms to minimize.
[2024-05-28 22:29:19] [INFO ] Deduced a trap composed of 182 places in 268 ms of which 3 ms to minimize.
[2024-05-28 22:29:20] [INFO ] Deduced a trap composed of 161 places in 286 ms of which 4 ms to minimize.
[2024-05-28 22:29:20] [INFO ] Deduced a trap composed of 171 places in 252 ms of which 3 ms to minimize.
[2024-05-28 22:29:20] [INFO ] Deduced a trap composed of 228 places in 233 ms of which 3 ms to minimize.
[2024-05-28 22:29:21] [INFO ] Deduced a trap composed of 171 places in 202 ms of which 3 ms to minimize.
[2024-05-28 22:29:21] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 3 ms to minimize.
[2024-05-28 22:29:21] [INFO ] Deduced a trap composed of 176 places in 199 ms of which 2 ms to minimize.
[2024-05-28 22:29:21] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 3 ms to minimize.
[2024-05-28 22:29:21] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 2 ms to minimize.
[2024-05-28 22:29:22] [INFO ] Deduced a trap composed of 171 places in 211 ms of which 3 ms to minimize.
[2024-05-28 22:29:22] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 2 ms to minimize.
[2024-05-28 22:29:22] [INFO ] Deduced a trap composed of 171 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:29:22] [INFO ] Deduced a trap composed of 161 places in 253 ms of which 3 ms to minimize.
SMT process timed out in 65752ms, After SMT, problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 65773ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73525 ms. Remains : 580/580 places, 1251/1251 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 107 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2024-05-28 22:29:23] [INFO ] Computed 82 invariants in 36 ms
[2024-05-28 22:29:23] [INFO ] [Real]Absence check using 62 positive place invariants in 13 ms returned sat
[2024-05-28 22:29:23] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 30 ms returned sat
[2024-05-28 22:29:23] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:29:23] [INFO ] [Nat]Absence check using 62 positive place invariants in 12 ms returned sat
[2024-05-28 22:29:23] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 31 ms returned sat
[2024-05-28 22:29:23] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 22:29:24] [INFO ] Deduced a trap composed of 264 places in 348 ms of which 5 ms to minimize.
[2024-05-28 22:29:24] [INFO ] Deduced a trap composed of 233 places in 340 ms of which 4 ms to minimize.
[2024-05-28 22:29:25] [INFO ] Deduced a trap composed of 243 places in 337 ms of which 8 ms to minimize.
[2024-05-28 22:29:25] [INFO ] Deduced a trap composed of 228 places in 303 ms of which 4 ms to minimize.
[2024-05-28 22:29:25] [INFO ] Deduced a trap composed of 231 places in 336 ms of which 4 ms to minimize.
[2024-05-28 22:29:26] [INFO ] Deduced a trap composed of 237 places in 304 ms of which 4 ms to minimize.
[2024-05-28 22:29:26] [INFO ] Deduced a trap composed of 241 places in 332 ms of which 4 ms to minimize.
[2024-05-28 22:29:26] [INFO ] Deduced a trap composed of 233 places in 301 ms of which 4 ms to minimize.
[2024-05-28 22:29:27] [INFO ] Deduced a trap composed of 234 places in 358 ms of which 4 ms to minimize.
[2024-05-28 22:29:27] [INFO ] Deduced a trap composed of 217 places in 353 ms of which 4 ms to minimize.
[2024-05-28 22:29:28] [INFO ] Deduced a trap composed of 253 places in 355 ms of which 4 ms to minimize.
[2024-05-28 22:29:28] [INFO ] Deduced a trap composed of 222 places in 303 ms of which 4 ms to minimize.
[2024-05-28 22:29:28] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 3 ms to minimize.
[2024-05-28 22:29:29] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 3 ms to minimize.
[2024-05-28 22:29:29] [INFO ] Deduced a trap composed of 240 places in 261 ms of which 2 ms to minimize.
[2024-05-28 22:29:29] [INFO ] Deduced a trap composed of 227 places in 223 ms of which 3 ms to minimize.
[2024-05-28 22:29:30] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 2 ms to minimize.
[2024-05-28 22:29:30] [INFO ] Deduced a trap composed of 248 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:29:30] [INFO ] Deduced a trap composed of 231 places in 226 ms of which 2 ms to minimize.
[2024-05-28 22:29:30] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 3 ms to minimize.
[2024-05-28 22:29:31] [INFO ] Deduced a trap composed of 224 places in 214 ms of which 3 ms to minimize.
[2024-05-28 22:29:31] [INFO ] Deduced a trap composed of 246 places in 221 ms of which 3 ms to minimize.
[2024-05-28 22:29:31] [INFO ] Deduced a trap composed of 246 places in 241 ms of which 3 ms to minimize.
[2024-05-28 22:29:31] [INFO ] Deduced a trap composed of 229 places in 201 ms of which 3 ms to minimize.
[2024-05-28 22:29:32] [INFO ] Deduced a trap composed of 247 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:29:32] [INFO ] Deduced a trap composed of 238 places in 216 ms of which 3 ms to minimize.
[2024-05-28 22:29:32] [INFO ] Deduced a trap composed of 244 places in 215 ms of which 3 ms to minimize.
[2024-05-28 22:29:33] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:29:33] [INFO ] Deduced a trap composed of 231 places in 219 ms of which 3 ms to minimize.
[2024-05-28 22:29:33] [INFO ] Deduced a trap composed of 220 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:29:33] [INFO ] Deduced a trap composed of 222 places in 263 ms of which 3 ms to minimize.
[2024-05-28 22:29:34] [INFO ] Deduced a trap composed of 228 places in 273 ms of which 3 ms to minimize.
[2024-05-28 22:29:34] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 4 ms to minimize.
[2024-05-28 22:29:35] [INFO ] Deduced a trap composed of 222 places in 268 ms of which 3 ms to minimize.
[2024-05-28 22:29:35] [INFO ] Deduced a trap composed of 234 places in 274 ms of which 3 ms to minimize.
[2024-05-28 22:29:36] [INFO ] Deduced a trap composed of 256 places in 314 ms of which 3 ms to minimize.
[2024-05-28 22:29:36] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 3 ms to minimize.
[2024-05-28 22:29:36] [INFO ] Deduced a trap composed of 239 places in 251 ms of which 3 ms to minimize.
[2024-05-28 22:29:37] [INFO ] Deduced a trap composed of 224 places in 245 ms of which 3 ms to minimize.
[2024-05-28 22:29:37] [INFO ] Deduced a trap composed of 233 places in 256 ms of which 3 ms to minimize.
[2024-05-28 22:29:37] [INFO ] Deduced a trap composed of 232 places in 271 ms of which 3 ms to minimize.
[2024-05-28 22:29:38] [INFO ] Deduced a trap composed of 228 places in 238 ms of which 3 ms to minimize.
[2024-05-28 22:29:38] [INFO ] Deduced a trap composed of 240 places in 208 ms of which 3 ms to minimize.
[2024-05-28 22:29:38] [INFO ] Deduced a trap composed of 239 places in 211 ms of which 3 ms to minimize.
[2024-05-28 22:29:38] [INFO ] Deduced a trap composed of 234 places in 210 ms of which 3 ms to minimize.
[2024-05-28 22:29:39] [INFO ] Deduced a trap composed of 240 places in 235 ms of which 3 ms to minimize.
[2024-05-28 22:29:39] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 3 ms to minimize.
[2024-05-28 22:29:39] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 3 ms to minimize.
[2024-05-28 22:29:39] [INFO ] Deduced a trap composed of 220 places in 204 ms of which 2 ms to minimize.
[2024-05-28 22:29:40] [INFO ] Deduced a trap composed of 228 places in 224 ms of which 3 ms to minimize.
[2024-05-28 22:29:40] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 2 ms to minimize.
[2024-05-28 22:29:40] [INFO ] Deduced a trap composed of 230 places in 209 ms of which 3 ms to minimize.
[2024-05-28 22:29:41] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 3 ms to minimize.
[2024-05-28 22:29:41] [INFO ] Deduced a trap composed of 238 places in 218 ms of which 2 ms to minimize.
[2024-05-28 22:29:41] [INFO ] Deduced a trap composed of 241 places in 239 ms of which 3 ms to minimize.
[2024-05-28 22:29:41] [INFO ] Deduced a trap composed of 238 places in 245 ms of which 3 ms to minimize.
[2024-05-28 22:29:42] [INFO ] Deduced a trap composed of 244 places in 234 ms of which 3 ms to minimize.
[2024-05-28 22:29:42] [INFO ] Deduced a trap composed of 232 places in 232 ms of which 3 ms to minimize.
[2024-05-28 22:29:42] [INFO ] Deduced a trap composed of 244 places in 267 ms of which 3 ms to minimize.
[2024-05-28 22:29:43] [INFO ] Deduced a trap composed of 225 places in 220 ms of which 2 ms to minimize.
[2024-05-28 22:29:43] [INFO ] Deduced a trap composed of 242 places in 217 ms of which 3 ms to minimize.
[2024-05-28 22:29:43] [INFO ] Deduced a trap composed of 225 places in 279 ms of which 3 ms to minimize.
[2024-05-28 22:29:43] [INFO ] Deduced a trap composed of 257 places in 288 ms of which 4 ms to minimize.
[2024-05-28 22:29:44] [INFO ] Deduced a trap composed of 226 places in 268 ms of which 4 ms to minimize.
[2024-05-28 22:29:44] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 3 ms to minimize.
[2024-05-28 22:29:44] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 3 ms to minimize.
[2024-05-28 22:29:45] [INFO ] Deduced a trap composed of 241 places in 269 ms of which 3 ms to minimize.
[2024-05-28 22:29:45] [INFO ] Deduced a trap composed of 226 places in 324 ms of which 3 ms to minimize.
[2024-05-28 22:29:46] [INFO ] Deduced a trap composed of 228 places in 340 ms of which 4 ms to minimize.
[2024-05-28 22:29:46] [INFO ] Deduced a trap composed of 226 places in 334 ms of which 4 ms to minimize.
[2024-05-28 22:29:46] [INFO ] Deduced a trap composed of 236 places in 299 ms of which 4 ms to minimize.
[2024-05-28 22:29:47] [INFO ] Deduced a trap composed of 224 places in 295 ms of which 4 ms to minimize.
[2024-05-28 22:29:47] [INFO ] Deduced a trap composed of 232 places in 289 ms of which 4 ms to minimize.
[2024-05-28 22:29:47] [INFO ] Deduced a trap composed of 226 places in 308 ms of which 4 ms to minimize.
[2024-05-28 22:29:48] [INFO ] Deduced a trap composed of 233 places in 271 ms of which 4 ms to minimize.
[2024-05-28 22:29:48] [INFO ] Deduced a trap composed of 255 places in 276 ms of which 4 ms to minimize.
[2024-05-28 22:29:48] [INFO ] Deduced a trap composed of 239 places in 292 ms of which 3 ms to minimize.
[2024-05-28 22:29:49] [INFO ] Deduced a trap composed of 240 places in 274 ms of which 4 ms to minimize.
[2024-05-28 22:29:49] [INFO ] Deduced a trap composed of 227 places in 338 ms of which 4 ms to minimize.
[2024-05-28 22:29:50] [INFO ] Deduced a trap composed of 222 places in 335 ms of which 4 ms to minimize.
[2024-05-28 22:29:50] [INFO ] Deduced a trap composed of 238 places in 306 ms of which 4 ms to minimize.
[2024-05-28 22:29:50] [INFO ] Deduced a trap composed of 231 places in 332 ms of which 4 ms to minimize.
[2024-05-28 22:29:51] [INFO ] Deduced a trap composed of 236 places in 292 ms of which 4 ms to minimize.
[2024-05-28 22:29:51] [INFO ] Deduced a trap composed of 230 places in 296 ms of which 4 ms to minimize.
[2024-05-28 22:29:52] [INFO ] Deduced a trap composed of 228 places in 306 ms of which 4 ms to minimize.
[2024-05-28 22:29:52] [INFO ] Deduced a trap composed of 228 places in 292 ms of which 4 ms to minimize.
[2024-05-28 22:29:53] [INFO ] Deduced a trap composed of 234 places in 297 ms of which 4 ms to minimize.
[2024-05-28 22:29:53] [INFO ] Deduced a trap composed of 232 places in 302 ms of which 4 ms to minimize.
[2024-05-28 22:29:53] [INFO ] Deduced a trap composed of 228 places in 296 ms of which 4 ms to minimize.
[2024-05-28 22:29:54] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 3 ms to minimize.
[2024-05-28 22:29:54] [INFO ] Deduced a trap composed of 228 places in 299 ms of which 4 ms to minimize.
[2024-05-28 22:29:54] [INFO ] Deduced a trap composed of 236 places in 295 ms of which 4 ms to minimize.
[2024-05-28 22:29:55] [INFO ] Deduced a trap composed of 240 places in 309 ms of which 4 ms to minimize.
[2024-05-28 22:29:55] [INFO ] Deduced a trap composed of 240 places in 311 ms of which 4 ms to minimize.
[2024-05-28 22:29:56] [INFO ] Deduced a trap composed of 232 places in 294 ms of which 4 ms to minimize.
[2024-05-28 22:29:56] [INFO ] Deduced a trap composed of 232 places in 297 ms of which 4 ms to minimize.
[2024-05-28 22:29:56] [INFO ] Deduced a trap composed of 232 places in 297 ms of which 3 ms to minimize.
[2024-05-28 22:29:57] [INFO ] Deduced a trap composed of 234 places in 311 ms of which 4 ms to minimize.
[2024-05-28 22:29:57] [INFO ] Deduced a trap composed of 234 places in 309 ms of which 4 ms to minimize.
[2024-05-28 22:29:57] [INFO ] Deduced a trap composed of 226 places in 295 ms of which 3 ms to minimize.
[2024-05-28 22:29:58] [INFO ] Deduced a trap composed of 234 places in 294 ms of which 4 ms to minimize.
[2024-05-28 22:29:58] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 4 ms to minimize.
[2024-05-28 22:29:58] [INFO ] Deduced a trap composed of 226 places in 305 ms of which 4 ms to minimize.
[2024-05-28 22:29:59] [INFO ] Deduced a trap composed of 234 places in 292 ms of which 4 ms to minimize.
[2024-05-28 22:29:59] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 4 ms to minimize.
[2024-05-28 22:29:59] [INFO ] Deduced a trap composed of 238 places in 263 ms of which 4 ms to minimize.
[2024-05-28 22:30:00] [INFO ] Deduced a trap composed of 230 places in 304 ms of which 4 ms to minimize.
[2024-05-28 22:30:01] [INFO ] Deduced a trap composed of 222 places in 350 ms of which 4 ms to minimize.
[2024-05-28 22:30:01] [INFO ] Deduced a trap composed of 227 places in 326 ms of which 5 ms to minimize.
[2024-05-28 22:30:02] [INFO ] Deduced a trap composed of 226 places in 322 ms of which 4 ms to minimize.
[2024-05-28 22:30:02] [INFO ] Deduced a trap composed of 245 places in 324 ms of which 4 ms to minimize.
[2024-05-28 22:30:02] [INFO ] Deduced a trap composed of 236 places in 293 ms of which 4 ms to minimize.
[2024-05-28 22:30:03] [INFO ] Deduced a trap composed of 226 places in 290 ms of which 4 ms to minimize.
[2024-05-28 22:30:03] [INFO ] Deduced a trap composed of 224 places in 292 ms of which 4 ms to minimize.
[2024-05-28 22:30:03] [INFO ] Deduced a trap composed of 232 places in 352 ms of which 4 ms to minimize.
[2024-05-28 22:30:04] [INFO ] Deduced a trap composed of 232 places in 344 ms of which 4 ms to minimize.
[2024-05-28 22:30:06] [INFO ] Deduced a trap composed of 226 places in 339 ms of which 4 ms to minimize.
[2024-05-28 22:30:06] [INFO ] Deduced a trap composed of 224 places in 347 ms of which 4 ms to minimize.
[2024-05-28 22:30:07] [INFO ] Deduced a trap composed of 226 places in 331 ms of which 4 ms to minimize.
[2024-05-28 22:30:07] [INFO ] Deduced a trap composed of 230 places in 302 ms of which 4 ms to minimize.
[2024-05-28 22:30:07] [INFO ] Deduced a trap composed of 224 places in 332 ms of which 4 ms to minimize.
[2024-05-28 22:30:08] [INFO ] Deduced a trap composed of 232 places in 343 ms of which 4 ms to minimize.
[2024-05-28 22:30:08] [INFO ] Deduced a trap composed of 239 places in 335 ms of which 4 ms to minimize.
[2024-05-28 22:30:09] [INFO ] Deduced a trap composed of 234 places in 351 ms of which 4 ms to minimize.
[2024-05-28 22:30:09] [INFO ] Deduced a trap composed of 232 places in 353 ms of which 4 ms to minimize.
[2024-05-28 22:30:10] [INFO ] Deduced a trap composed of 224 places in 333 ms of which 4 ms to minimize.
[2024-05-28 22:30:10] [INFO ] Deduced a trap composed of 229 places in 344 ms of which 4 ms to minimize.
[2024-05-28 22:30:11] [INFO ] Deduced a trap composed of 234 places in 335 ms of which 4 ms to minimize.
[2024-05-28 22:30:11] [INFO ] Deduced a trap composed of 230 places in 338 ms of which 3 ms to minimize.
[2024-05-28 22:30:11] [INFO ] Deduced a trap composed of 234 places in 330 ms of which 4 ms to minimize.
[2024-05-28 22:30:12] [INFO ] Deduced a trap composed of 225 places in 337 ms of which 4 ms to minimize.
[2024-05-28 22:30:12] [INFO ] Deduced a trap composed of 234 places in 329 ms of which 4 ms to minimize.
[2024-05-28 22:30:12] [INFO ] Deduced a trap composed of 236 places in 311 ms of which 3 ms to minimize.
[2024-05-28 22:30:13] [INFO ] Deduced a trap composed of 238 places in 318 ms of which 4 ms to minimize.
[2024-05-28 22:30:13] [INFO ] Deduced a trap composed of 224 places in 310 ms of which 4 ms to minimize.
[2024-05-28 22:30:14] [INFO ] Deduced a trap composed of 228 places in 322 ms of which 3 ms to minimize.
[2024-05-28 22:30:15] [INFO ] Deduced a trap composed of 224 places in 358 ms of which 4 ms to minimize.
[2024-05-28 22:30:15] [INFO ] Deduced a trap composed of 234 places in 329 ms of which 4 ms to minimize.
[2024-05-28 22:30:16] [INFO ] Deduced a trap composed of 234 places in 353 ms of which 4 ms to minimize.
[2024-05-28 22:31:01] [INFO ] Trap strengthening (SAT) tested/added 139/139 trap constraints in 97136 ms
TRAPS : Iteration 1
[2024-05-28 22:31:01] [INFO ] After 98094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-28 22:31:01] [INFO ] After 98249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2024-05-28 22:31:01] [INFO ] Flatten gal took : 70 ms
[2024-05-28 22:31:01] [INFO ] Flatten gal took : 56 ms
[2024-05-28 22:31:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15602956100958703729.gal : 16 ms
[2024-05-28 22:31:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2966862148583541781.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15602956100958703729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2966862148583541781.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2966862148583541781.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :25 after 26
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :26 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 36
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :36 after 75
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :75 after 1076
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1076 after 1126
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1126 after 1264
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1264 after 1479
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1479 after 4557
Detected timeout of ITS tools.
[2024-05-28 22:31:16] [INFO ] Flatten gal took : 85 ms
[2024-05-28 22:31:16] [INFO ] Applying decomposition
[2024-05-28 22:31:16] [INFO ] Flatten gal took : 61 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/graph6707645974002825146.txt' '-o' '/tmp/graph6707645974002825146.bin' '-w' '/tmp/graph6707645974002825146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6707645974002825146.bin' '-l' '-1' '-v' '-w' '/tmp/graph6707645974002825146.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:31:17] [INFO ] Decomposing Gal with order
[2024-05-28 22:31:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:31:17] [INFO ] Removed a total of 1380 redundant transitions.
[2024-05-28 22:31:17] [INFO ] Flatten gal took : 177 ms
[2024-05-28 22:31:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 641 labels/synchronizations in 26 ms.
[2024-05-28 22:31:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17232325995463770568.gal : 13 ms
[2024-05-28 22:31:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality739609939305617400.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17232325995463770568.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality739609939305617400.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality739609939305617400.prop.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 129424 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 22:31:32] [INFO ] Flatten gal took : 99 ms
[2024-05-28 22:31:32] [INFO ] Flatten gal took : 70 ms
[2024-05-28 22:31:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11771684483025158921.gal : 10 ms
[2024-05-28 22:31:32] [INFO ] Time to serialize properties into /tmp/CTLFireability8365599415886239428.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11771684483025158921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8365599415886239428.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:32:03] [INFO ] Flatten gal took : 98 ms
[2024-05-28 22:32:03] [INFO ] Applying decomposition
[2024-05-28 22:32:03] [INFO ] Flatten gal took : 71 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/graph12490229732724092976.txt' '-o' '/tmp/graph12490229732724092976.bin' '-w' '/tmp/graph12490229732724092976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12490229732724092976.bin' '-l' '-1' '-v' '-w' '/tmp/graph12490229732724092976.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:32:03] [INFO ] Decomposing Gal with order
[2024-05-28 22:32:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:32:03] [INFO ] Removed a total of 3070 redundant transitions.
[2024-05-28 22:32:03] [INFO ] Flatten gal took : 136 ms
[2024-05-28 22:32:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 343 labels/synchronizations in 20 ms.
[2024-05-28 22:32:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4601475252359718681.gal : 12 ms
[2024-05-28 22:32:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10414890310795359540.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4601475252359718681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10414890310795359540.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1906
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 620 transition count 1906
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 68 place count 620 transition count 1872
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 136 place count 586 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 585 transition count 1871
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 585 transition count 1871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 583 transition count 1869
Applied a total of 142 rules in 193 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
Running 1858 sub problems to find dead transitions.
[2024-05-28 22:32:33] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2024-05-28 22:32:33] [INFO ] Computed 82 invariants in 52 ms
[2024-05-28 22:32:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1858 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 Real declared 573/2443 variables, and 72 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1858/858 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1858 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
[2024-05-28 22:33:32] [INFO ] Deduced a trap composed of 242 places in 564 ms of which 4 ms to minimize.
[2024-05-28 22:33:33] [INFO ] Deduced a trap composed of 19 places in 465 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/2443 variables, and 74 constraints, problems are : Problem set: 0 solved, 1858 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/858 constraints, Known Traps: 2/2 constraints]
After SMT, in 61901ms problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 61929ms
[2024-05-28 22:33:35] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
[2024-05-28 22:33:35] [INFO ] Invariant cache hit.
[2024-05-28 22:33:36] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-05-28 22:33:36] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
[2024-05-28 22:33:36] [INFO ] Invariant cache hit.
[2024-05-28 22:33:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:33:41] [INFO ] Implicit Places using invariants and state equation in 5745 ms returned []
Implicit Place search using SMT with State Equation took 6271 ms to find 0 implicit places.
[2024-05-28 22:33:42] [INFO ] Redundant transitions in 110 ms returned []
Running 1858 sub problems to find dead transitions.
[2024-05-28 22:33:42] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
[2024-05-28 22:33:42] [INFO ] Invariant cache hit.
[2024-05-28 22:33:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1537 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/583 variables, 10/82 constraints. Problems are: Problem set: 615 solved, 1243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/2443 variables, and 82 constraints, problems are : Problem set: 615 solved, 1243 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1858/858 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 1243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 63/63 constraints. Problems are: Problem set: 615 solved, 1243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 9/72 constraints. Problems are: Problem set: 615 solved, 1243 unsolved
[2024-05-28 22:34:44] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/573 variables, 1/73 constraints. Problems are: Problem set: 615 solved, 1243 unsolved
[2024-05-28 22:35:01] [INFO ] Deduced a trap composed of 15 places in 495 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/2443 variables, and 74 constraints, problems are : Problem set: 615 solved, 1243 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/858 constraints, Known Traps: 2/2 constraints]
After SMT, in 81836ms problems are : Problem set: 615 solved, 1243 unsolved
Search for dead transitions found 615 dead transitions in 81866ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 583/664 places, 1254/1940 transitions.
Applied a total of 0 rules in 28 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2024-05-28 22:35:04] [INFO ] Redundant transitions in 19 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 150446 ms. Remains : 583/664 places, 1254/1940 transitions.
[2024-05-28 22:35:04] [INFO ] Flatten gal took : 43 ms
[2024-05-28 22:35:04] [INFO ] Flatten gal took : 43 ms
[2024-05-28 22:35:04] [INFO ] Input system was already deterministic with 1254 transitions.
[2024-05-28 22:35:04] [INFO ] Flatten gal took : 42 ms
[2024-05-28 22:35:04] [INFO ] Flatten gal took : 47 ms
[2024-05-28 22:35:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16377477041769470732.gal : 8 ms
[2024-05-28 22:35:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5355146617981018725.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16377477041769470732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5355146617981018725.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:35:34] [INFO ] Flatten gal took : 47 ms
[2024-05-28 22:35:34] [INFO ] Applying decomposition
[2024-05-28 22:35:34] [INFO ] Flatten gal took : 45 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/graph7433057799137900657.txt' '-o' '/tmp/graph7433057799137900657.bin' '-w' '/tmp/graph7433057799137900657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7433057799137900657.bin' '-l' '-1' '-v' '-w' '/tmp/graph7433057799137900657.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:35:34] [INFO ] Decomposing Gal with order
[2024-05-28 22:35:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:35:34] [INFO ] Removed a total of 3072 redundant transitions.
[2024-05-28 22:35:34] [INFO ] Flatten gal took : 119 ms
[2024-05-28 22:35:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 356 labels/synchronizations in 18 ms.
[2024-05-28 22:35:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4801583784135143911.gal : 9 ms
[2024-05-28 22:35:34] [INFO ] Time to serialize properties into /tmp/CTLFireability8917740047322258115.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4801583784135143911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8917740047322258115.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 55 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:36:05] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-05-28 22:36:05] [INFO ] Computed 82 invariants in 58 ms
[2024-05-28 22:36:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 9)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 2)
(s112 0)
(s113 3)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s143 0)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 2)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 3)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 10)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 3)
(s375 1)
(s376 1)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 1)
(s421 1)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 3)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 1)
(s443 0)
(s445 3)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 2)
(s463 0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 57656ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 57683ms
[2024-05-28 22:37:02] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:37:02] [INFO ] Invariant cache hit.
[2024-05-28 22:37:03] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-05-28 22:37:03] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:37:03] [INFO ] Invariant cache hit.
[2024-05-28 22:37:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:37:10] [INFO ] Implicit Places using invariants and state equation in 7469 ms returned []
Implicit Place search using SMT with State Equation took 8199 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:37:10] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:37:10] [INFO ] Invariant cache hit.
[2024-05-28 22:37:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
(s332 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 (/ 2.0 3.0))
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 (/ 2.0 3.0))
(s101 0.0)
(s102 9.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 (/ 2.0 3.0))
(s110 0.0)
(s111 4.0)
(s112 0.0)
(s113 4.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 (/ 1.0 3.0))
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s174 0.0)
(s175 (/ 1.0 3.0))
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 4.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 4.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 9.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 (/ 2.0 3.0))
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 (/ 1.0 3.0))
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1938 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/653 variables, 11/82 constraints. Problems are: Problem set: 615 solved, 1313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/2583 variables, and 82 constraints, problems are : Problem set: 615 solved, 1313 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 76911ms problems are : Problem set: 615 solved, 1313 unsolved
Search for dead transitions found 615 dead transitions in 76933ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1940 transitions.
Applied a total of 0 rules in 16 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142899 ms. Remains : 653/664 places, 1324/1940 transitions.
[2024-05-28 22:38:27] [INFO ] Flatten gal took : 59 ms
[2024-05-28 22:38:28] [INFO ] Flatten gal took : 63 ms
[2024-05-28 22:38:28] [INFO ] Input system was already deterministic with 1324 transitions.
[2024-05-28 22:38:28] [INFO ] Flatten gal took : 62 ms
[2024-05-28 22:38:28] [INFO ] Flatten gal took : 62 ms
[2024-05-28 22:38:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14869420435624235501.gal : 9 ms
[2024-05-28 22:38:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6575700573609468546.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14869420435624235501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6575700573609468546.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:38:58] [INFO ] Flatten gal took : 89 ms
[2024-05-28 22:38:58] [INFO ] Applying decomposition
[2024-05-28 22:38:58] [INFO ] Flatten gal took : 65 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/graph14351162995326130380.txt' '-o' '/tmp/graph14351162995326130380.bin' '-w' '/tmp/graph14351162995326130380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14351162995326130380.bin' '-l' '-1' '-v' '-w' '/tmp/graph14351162995326130380.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:38:58] [INFO ] Decomposing Gal with order
[2024-05-28 22:38:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:38:58] [INFO ] Removed a total of 1001 redundant transitions.
[2024-05-28 22:38:58] [INFO ] Flatten gal took : 100 ms
[2024-05-28 22:38:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 280 labels/synchronizations in 11 ms.
[2024-05-28 22:38:58] [INFO ] Time to serialize gal into /tmp/CTLFireability12277811083132739671.gal : 15 ms
[2024-05-28 22:38:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1312418709256164079.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12277811083132739671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1312418709256164079.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 37 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:39:28] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:39:28] [INFO ] Invariant cache hit.
[2024-05-28 22:39:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 57838ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 57854ms
[2024-05-28 22:40:26] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:40:26] [INFO ] Invariant cache hit.
[2024-05-28 22:40:27] [INFO ] Implicit Places using invariants in 723 ms returned []
[2024-05-28 22:40:27] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:40:27] [INFO ] Invariant cache hit.
[2024-05-28 22:40:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:40:34] [INFO ] Implicit Places using invariants and state equation in 7243 ms returned []
Implicit Place search using SMT with State Equation took 7971 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:40:34] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:40:34] [INFO ] Invariant cache hit.
[2024-05-28 22:40:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 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 Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD821 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/653 variables, 11/82 constraints. Problems are: Problem set: 109 solved, 1819 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/2583 variables, and 82 constraints, problems are : Problem set: 109 solved, 1819 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 77036ms problems are : Problem set: 109 solved, 1819 unsolved
Search for dead transitions found 109 dead transitions in 77072ms
Found 109 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 109 transitions
Dead transitions reduction (with SMT) removed 109 transitions
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1830/1940 transitions.
Applied a total of 0 rules in 30 ms. Remains 653 /653 variables (removed 0) and now considering 1830/1830 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142978 ms. Remains : 653/664 places, 1830/1940 transitions.
[2024-05-28 22:41:52] [INFO ] Flatten gal took : 99 ms
[2024-05-28 22:41:52] [INFO ] Flatten gal took : 100 ms
[2024-05-28 22:41:52] [INFO ] Input system was already deterministic with 1830 transitions.
[2024-05-28 22:41:52] [INFO ] Flatten gal took : 98 ms
[2024-05-28 22:41:52] [INFO ] Flatten gal took : 98 ms
[2024-05-28 22:41:52] [INFO ] Time to serialize gal into /tmp/CTLFireability10948026701735985060.gal : 20 ms
[2024-05-28 22:41:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5843182043516284381.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10948026701735985060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5843182043516284381.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:42:22] [INFO ] Flatten gal took : 134 ms
[2024-05-28 22:42:22] [INFO ] Applying decomposition
[2024-05-28 22:42:22] [INFO ] Flatten gal took : 99 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/graph1459428158021128903.txt' '-o' '/tmp/graph1459428158021128903.bin' '-w' '/tmp/graph1459428158021128903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1459428158021128903.bin' '-l' '-1' '-v' '-w' '/tmp/graph1459428158021128903.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:42:23] [INFO ] Decomposing Gal with order
[2024-05-28 22:42:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:42:23] [INFO ] Removed a total of 1862 redundant transitions.
[2024-05-28 22:42:23] [INFO ] Flatten gal took : 164 ms
[2024-05-28 22:42:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 581 labels/synchronizations in 16 ms.
[2024-05-28 22:42:23] [INFO ] Time to serialize gal into /tmp/CTLFireability16418880003603690761.gal : 15 ms
[2024-05-28 22:42:23] [INFO ] Time to serialize properties into /tmp/CTLFireability323646489758770499.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16418880003603690761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability323646489758770499.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1905
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1905
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1871
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1870
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1870
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1868
Applied a total of 144 rules in 184 ms. Remains 582 /664 variables (removed 82) and now considering 1868/1940 (removed 72) transitions.
Running 1857 sub problems to find dead transitions.
[2024-05-28 22:42:53] [INFO ] Flow matrix only has 1859 transitions (discarded 9 similar events)
// Phase 1: matrix 1859 rows 582 cols
[2024-05-28 22:42:53] [INFO ] Computed 82 invariants in 54 ms
[2024-05-28 22:42:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2441 variables, and 72 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1857/857 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
[2024-05-28 22:43:38] [INFO ] Deduced a trap composed of 19 places in 385 ms of which 3 ms to minimize.
[2024-05-28 22:43:52] [INFO ] Deduced a trap composed of 96 places in 550 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2441 variables, and 74 constraints, problems are : Problem set: 0 solved, 1857 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/857 constraints, Known Traps: 2/2 constraints]
After SMT, in 62622ms problems are : Problem set: 0 solved, 1857 unsolved
Search for dead transitions found 0 dead transitions in 62643ms
[2024-05-28 22:43:56] [INFO ] Flow matrix only has 1859 transitions (discarded 9 similar events)
[2024-05-28 22:43:56] [INFO ] Invariant cache hit.
[2024-05-28 22:43:57] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-05-28 22:43:57] [INFO ] Flow matrix only has 1859 transitions (discarded 9 similar events)
[2024-05-28 22:43:57] [INFO ] Invariant cache hit.
[2024-05-28 22:43:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:44:04] [INFO ] Implicit Places using invariants and state equation in 7362 ms returned []
Implicit Place search using SMT with State Equation took 8112 ms to find 0 implicit places.
[2024-05-28 22:44:04] [INFO ] Redundant transitions in 79 ms returned []
Running 1857 sub problems to find dead transitions.
[2024-05-28 22:44:04] [INFO ] Flow matrix only has 1859 transitions (discarded 9 similar events)
[2024-05-28 22:44:04] [INFO ] Invariant cache hit.
[2024-05-28 22:44:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1857 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1537 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/582 variables, 10/82 constraints. Problems are: Problem set: 615 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/2441 variables, and 82 constraints, problems are : Problem set: 615 solved, 1242 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1857/857 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 615 solved, 1242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 615 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 615 solved, 1242 unsolved
[2024-05-28 22:45:05] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 2 ms to minimize.
[2024-05-28 22:45:07] [INFO ] Deduced a trap composed of 158 places in 489 ms of which 4 ms to minimize.
[2024-05-28 22:45:07] [INFO ] Deduced a trap composed of 266 places in 513 ms of which 4 ms to minimize.
[2024-05-28 22:45:08] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 4/76 constraints. Problems are: Problem set: 615 solved, 1242 unsolved
[2024-05-28 22:45:14] [INFO ] Deduced a trap composed of 19 places in 457 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 1/77 constraints. Problems are: Problem set: 615 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2441 variables, and 77 constraints, problems are : Problem set: 615 solved, 1242 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 385/857 constraints, Known Traps: 5/5 constraints]
After SMT, in 82406ms problems are : Problem set: 615 solved, 1242 unsolved
Search for dead transitions found 615 dead transitions in 82434ms
Found 615 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 615 transitions
Dead transitions reduction (with SMT) removed 615 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 582/664 places, 1253/1940 transitions.
Applied a total of 0 rules in 27 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-05-28 22:45:27] [INFO ] Redundant transitions in 19 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 153524 ms. Remains : 582/664 places, 1253/1940 transitions.
[2024-05-28 22:45:27] [INFO ] Flatten gal took : 43 ms
[2024-05-28 22:45:27] [INFO ] Flatten gal took : 46 ms
[2024-05-28 22:45:27] [INFO ] Input system was already deterministic with 1253 transitions.
[2024-05-28 22:45:27] [INFO ] Flatten gal took : 102 ms
[2024-05-28 22:45:27] [INFO ] Flatten gal took : 61 ms
[2024-05-28 22:45:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2193154930010739036.gal : 10 ms
[2024-05-28 22:45:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4339756920094622792.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2193154930010739036.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4339756920094622792.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 34721 steps (2339 resets) in 486 ms. (71 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-PT-S10J30-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1939
Applied a total of 12 rules in 54 ms. Remains 653 /664 variables (removed 11) and now considering 1939/1940 (removed 1) transitions.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:45:27] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
// Phase 1: matrix 1930 rows 653 cols
[2024-05-28 22:45:27] [INFO ] Computed 82 invariants in 29 ms
[2024-05-28 22:45:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 59955ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 59980ms
[2024-05-28 22:46:27] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:46:27] [INFO ] Invariant cache hit.
[2024-05-28 22:46:28] [INFO ] Implicit Places using invariants in 665 ms returned []
[2024-05-28 22:46:28] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:46:28] [INFO ] Invariant cache hit.
[2024-05-28 22:46:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:46:35] [INFO ] Implicit Places using invariants and state equation in 7455 ms returned []
Implicit Place search using SMT with State Equation took 8121 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2024-05-28 22:46:35] [INFO ] Flow matrix only has 1930 transitions (discarded 9 similar events)
[2024-05-28 22:46:35] [INFO ] Invariant cache hit.
[2024-05-28 22:46:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2583 variables, and 71 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1928/928 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1289 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/653 variables, 11/82 constraints. Problems are: Problem set: 298 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/2583 variables, and 82 constraints, problems are : Problem set: 298 solved, 1630 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/928 constraints, Known Traps: 0/0 constraints]
After SMT, in 80980ms problems are : Problem set: 298 solved, 1630 unsolved
Search for dead transitions found 298 dead transitions in 81001ms
Found 298 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 298 transitions
Dead transitions reduction (with SMT) removed 298 transitions
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1641/1940 transitions.
Applied a total of 0 rules in 16 ms. Remains 653 /653 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149186 ms. Remains : 653/664 places, 1641/1940 transitions.
[2024-05-28 22:47:56] [INFO ] Flatten gal took : 77 ms
[2024-05-28 22:47:56] [INFO ] Flatten gal took : 82 ms
[2024-05-28 22:47:57] [INFO ] Input system was already deterministic with 1641 transitions.
[2024-05-28 22:47:57] [INFO ] Flatten gal took : 62 ms
[2024-05-28 22:47:57] [INFO ] Flatten gal took : 62 ms
[2024-05-28 22:47:57] [INFO ] Time to serialize gal into /tmp/CTLFireability1878355652495995945.gal : 10 ms
[2024-05-28 22:47:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13560827024227778087.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1878355652495995945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13560827024227778087.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:48:27] [INFO ] Flatten gal took : 118 ms
[2024-05-28 22:48:27] [INFO ] Applying decomposition
[2024-05-28 22:48:27] [INFO ] Flatten gal took : 84 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/graph4075386356505941934.txt' '-o' '/tmp/graph4075386356505941934.bin' '-w' '/tmp/graph4075386356505941934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4075386356505941934.bin' '-l' '-1' '-v' '-w' '/tmp/graph4075386356505941934.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:48:27] [INFO ] Decomposing Gal with order
[2024-05-28 22:48:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:48:27] [INFO ] Removed a total of 1091 redundant transitions.
[2024-05-28 22:48:27] [INFO ] Flatten gal took : 136 ms
[2024-05-28 22:48:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 8 ms.
[2024-05-28 22:48:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4305681717034528624.gal : 18 ms
[2024-05-28 22:48:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12381407005042553585.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4305681717034528624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12381407005042553585.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:48:58] [INFO ] Flatten gal took : 117 ms
[2024-05-28 22:48:58] [INFO ] Flatten gal took : 113 ms
[2024-05-28 22:48:58] [INFO ] Applying decomposition
[2024-05-28 22:48:58] [INFO ] Flatten gal took : 112 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/graph13570592093451343971.txt' '-o' '/tmp/graph13570592093451343971.bin' '-w' '/tmp/graph13570592093451343971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13570592093451343971.bin' '-l' '-1' '-v' '-w' '/tmp/graph13570592093451343971.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:48:59] [INFO ] Decomposing Gal with order
[2024-05-28 22:48:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:48:59] [INFO ] Removed a total of 4520 redundant transitions.
[2024-05-28 22:48:59] [INFO ] Flatten gal took : 267 ms
[2024-05-28 22:48:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 383 labels/synchronizations in 21 ms.
[2024-05-28 22:48:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17579006210538715882.gal : 10 ms
[2024-05-28 22:48:59] [INFO ] Time to serialize properties into /tmp/CTLFireability8308185283144155555.ctl : 19 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17579006210538715882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8308185283144155555.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.

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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600