About the Execution of ITS-Tools for FireWire-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16199.132 | 3600000.00 | 3896757.00 | 9065.60 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r550-tall-171734899100322.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FireWire-PT-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899100322
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 247K Jun 2 16:33 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 FireWire-PT-20-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717373172184
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-03 00:06:13] [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-06-03 00:06:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:06:13] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-06-03 00:06:13] [INFO ] Transformed 626 places.
[2024-06-03 00:06:13] [INFO ] Transformed 1031 transitions.
[2024-06-03 00:06:13] [INFO ] Found NUPN structural information;
[2024-06-03 00:06:13] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 135 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 611 transition count 1031
Discarding 123 places :
Symmetric choice reduction at 1 with 123 rule applications. Total rules 138 place count 488 transition count 908
Iterating global reduction 1 with 123 rules applied. Total rules applied 261 place count 488 transition count 908
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 262 place count 488 transition count 907
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 279 place count 471 transition count 885
Iterating global reduction 2 with 17 rules applied. Total rules applied 296 place count 471 transition count 885
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 300 place count 467 transition count 879
Iterating global reduction 2 with 4 rules applied. Total rules applied 304 place count 467 transition count 879
Applied a total of 304 rules in 111 ms. Remains 467 /626 variables (removed 159) and now considering 879/1031 (removed 152) transitions.
// Phase 1: matrix 879 rows 467 cols
[2024-06-03 00:06:13] [INFO ] Computed 10 invariants in 31 ms
[2024-06-03 00:06:14] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-06-03 00:06:14] [INFO ] Invariant cache hit.
[2024-06-03 00:06:14] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Running 878 sub problems to find dead transitions.
[2024-06-03 00:06:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 878 unsolved
At refinement iteration 1 (OVERLAPS) 1/467 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 878 unsolved
[2024-06-03 00:06:27] [INFO ] Deduced a trap composed of 280 places in 258 ms of which 36 ms to minimize.
[2024-06-03 00:06:27] [INFO ] Deduced a trap composed of 269 places in 195 ms of which 4 ms to minimize.
[2024-06-03 00:06:27] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 2 ms to minimize.
[2024-06-03 00:06:28] [INFO ] Deduced a trap composed of 105 places in 58 ms of which 2 ms to minimize.
[2024-06-03 00:06:28] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:06:28] [INFO ] Deduced a trap composed of 116 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:06:29] [INFO ] Deduced a trap composed of 280 places in 180 ms of which 2 ms to minimize.
[2024-06-03 00:06:29] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 2 ms to minimize.
[2024-06-03 00:06:30] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:06:30] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:06:30] [INFO ] Deduced a trap composed of 101 places in 65 ms of which 1 ms to minimize.
[2024-06-03 00:06:31] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:06:31] [INFO ] Deduced a trap composed of 99 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:06:31] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
[2024-06-03 00:06:32] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:06:32] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2024-06-03 00:06:34] [INFO ] Deduced a trap composed of 101 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:06:37] [INFO ] Deduced a trap composed of 77 places in 165 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 878 unsolved
[2024-06-03 00:06:40] [INFO ] Deduced a trap composed of 279 places in 178 ms of which 3 ms to minimize.
[2024-06-03 00:06:40] [INFO ] Deduced a trap composed of 278 places in 170 ms of which 3 ms to minimize.
[2024-06-03 00:06:40] [INFO ] Deduced a trap composed of 79 places in 178 ms of which 3 ms to minimize.
[2024-06-03 00:06:41] [INFO ] Deduced a trap composed of 279 places in 160 ms of which 3 ms to minimize.
[2024-06-03 00:06:41] [INFO ] Deduced a trap composed of 272 places in 177 ms of which 3 ms to minimize.
[2024-06-03 00:06:41] [INFO ] Deduced a trap composed of 97 places in 174 ms of which 3 ms to minimize.
[2024-06-03 00:06:42] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/1346 variables, and 35 constraints, problems are : Problem set: 0 solved, 878 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 878/878 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 878 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 878 unsolved
At refinement iteration 1 (OVERLAPS) 1/467 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 878 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 878 unsolved
[2024-06-03 00:06:51] [INFO ] Deduced a trap composed of 272 places in 186 ms of which 3 ms to minimize.
[2024-06-03 00:06:52] [INFO ] Deduced a trap composed of 334 places in 183 ms of which 3 ms to minimize.
[2024-06-03 00:06:52] [INFO ] Deduced a trap composed of 270 places in 188 ms of which 3 ms to minimize.
[2024-06-03 00:06:53] [INFO ] Deduced a trap composed of 268 places in 180 ms of which 3 ms to minimize.
[2024-06-03 00:06:53] [INFO ] Deduced a trap composed of 270 places in 178 ms of which 2 ms to minimize.
[2024-06-03 00:06:53] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:06:54] [INFO ] Deduced a trap composed of 105 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:06:55] [INFO ] Deduced a trap composed of 104 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:06:56] [INFO ] Deduced a trap composed of 271 places in 177 ms of which 5 ms to minimize.
[2024-06-03 00:06:57] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 878 unsolved
[2024-06-03 00:07:03] [INFO ] Deduced a trap composed of 118 places in 57 ms of which 2 ms to minimize.
[2024-06-03 00:07:03] [INFO ] Deduced a trap composed of 93 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:07:06] [INFO ] Deduced a trap composed of 115 places in 61 ms of which 1 ms to minimize.
[2024-06-03 00:07:07] [INFO ] Deduced a trap composed of 130 places in 176 ms of which 2 ms to minimize.
[2024-06-03 00:07:10] [INFO ] Deduced a trap composed of 309 places in 173 ms of which 4 ms to minimize.
[2024-06-03 00:07:10] [INFO ] Deduced a trap composed of 320 places in 173 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 878 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/1346 variables, and 51 constraints, problems are : Problem set: 0 solved, 878 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 0/878 constraints, Known Traps: 41/41 constraints]
After SMT, in 60771ms problems are : Problem set: 0 solved, 878 unsolved
Search for dead transitions found 0 dead transitions in 60797ms
Starting structural reductions in LTL mode, iteration 1 : 467/626 places, 879/1031 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61762 ms. Remains : 467/626 places, 879/1031 transitions.
Support contains 135 out of 467 places after structural reductions.
[2024-06-03 00:07:15] [INFO ] Flatten gal took : 85 ms
[2024-06-03 00:07:15] [INFO ] Flatten gal took : 50 ms
[2024-06-03 00:07:15] [INFO ] Input system was already deterministic with 879 transitions.
RANDOM walk for 40000 steps (25 resets) in 3139 ms. (12 steps per ms) remains 81/91 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 81/81 properties
[2024-06-03 00:07:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 1 (OVERLAPS) 311/433 variables, 10/10 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 851/1284 variables, 433/443 constraints. Problems are: Problem set: 9 solved, 72 unsolved
[2024-06-03 00:07:18] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
[2024-06-03 00:07:19] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 3 ms to minimize.
[2024-06-03 00:07:19] [INFO ] Deduced a trap composed of 126 places in 166 ms of which 3 ms to minimize.
[2024-06-03 00:07:19] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1284 variables, 4/447 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1284 variables, 0/447 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 37/1321 variables, 21/468 constraints. Problems are: Problem set: 9 solved, 72 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1321/1346 variables, and 468 constraints, problems are : Problem set: 9 solved, 72 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 454/467 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 9 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 330/433 variables, 10/10 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 4/14 constraints. Problems are: Problem set: 9 solved, 72 unsolved
[2024-06-03 00:07:22] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2024-06-03 00:07:22] [INFO ] Deduced a trap composed of 99 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:07:22] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:07:22] [INFO ] Deduced a trap composed of 89 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:07:22] [INFO ] Deduced a trap composed of 98 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:07:23] [INFO ] Deduced a trap composed of 105 places in 62 ms of which 2 ms to minimize.
[2024-06-03 00:07:23] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:07:23] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 8/22 constraints. Problems are: Problem set: 9 solved, 72 unsolved
[2024-06-03 00:07:24] [INFO ] Deduced a trap composed of 114 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:07:24] [INFO ] Deduced a trap composed of 114 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 2/24 constraints. Problems are: Problem set: 9 solved, 72 unsolved
[2024-06-03 00:07:25] [INFO ] Deduced a trap composed of 105 places in 166 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 1/25 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 851/1284 variables, 433/458 constraints. Problems are: Problem set: 9 solved, 72 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1284/1346 variables, and 523 constraints, problems are : Problem set: 9 solved, 72 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 433/467 constraints, PredecessorRefiner: 65/81 constraints, Known Traps: 15/15 constraints]
After SMT, in 10142ms problems are : Problem set: 9 solved, 72 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 103 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 879/879 transitions.
Graph (trivial) has 215 edges and 467 vertex of which 6 / 467 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 463 transition count 843
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 435 transition count 839
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 11 rules applied. Total rules applied 72 place count 433 transition count 830
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 81 place count 424 transition count 830
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 81 place count 424 transition count 808
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 125 place count 402 transition count 808
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 130 place count 397 transition count 803
Iterating global reduction 4 with 5 rules applied. Total rules applied 135 place count 397 transition count 803
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 135 place count 397 transition count 802
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 396 transition count 802
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 140 place count 393 transition count 797
Iterating global reduction 4 with 3 rules applied. Total rules applied 143 place count 393 transition count 797
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 229 place count 350 transition count 754
Performed 28 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 285 place count 322 transition count 909
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 322 transition count 908
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 302 place count 322 transition count 892
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 318 place count 306 transition count 892
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 320 place count 304 transition count 890
Iterating global reduction 5 with 2 rules applied. Total rules applied 322 place count 304 transition count 890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 328 place count 304 transition count 884
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 329 place count 304 transition count 883
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 335 place count 304 transition count 883
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 336 place count 304 transition count 883
Applied a total of 336 rules in 254 ms. Remains 304 /467 variables (removed 163) and now considering 883/879 (removed -4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 304/467 places, 883/879 transitions.
RANDOM walk for 40000 steps (15 resets) in 657 ms. (60 steps per ms) remains 67/72 properties
BEST_FIRST walk for 4002 steps (14 resets) in 30 ms. (129 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4001 steps (11 resets) in 32 ms. (121 steps per ms) remains 64/66 properties
BEST_FIRST walk for 4003 steps (15 resets) in 30 ms. (129 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (12 resets) in 36 ms. (108 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (12 resets) in 37 ms. (105 steps per ms) remains 62/64 properties
BEST_FIRST walk for 4002 steps (17 resets) in 23 ms. (166 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (12 resets) in 25 ms. (153 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (15 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 56/61 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4002 steps (15 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (13 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (14 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (10 resets) in 29 ms. (133 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 36 ms. (108 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (16 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (18 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (19 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (15 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (13 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (13 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (12 resets) in 17 ms. (222 steps per ms) remains 52/54 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 49/52 properties
BEST_FIRST walk for 4003 steps (17 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (14 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (14 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (14 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (12 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (17 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 47/49 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (15 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (14 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (14 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (13 resets) in 12 ms. (307 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (17 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (15 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (14 resets) in 13 ms. (285 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (17 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
[2024-06-03 00:07:28] [INFO ] Flow matrix only has 871 transitions (discarded 12 similar events)
// Phase 1: matrix 871 rows 304 cols
[2024-06-03 00:07:28] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:07:28] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 219/288 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-03 00:07:28] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-06-03 00:07:28] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 0 ms to minimize.
[2024-06-03 00:07:28] [INFO ] Deduced a trap composed of 158 places in 137 ms of which 2 ms to minimize.
[2024-06-03 00:07:29] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-06-03 00:07:29] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:07:29] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:07:29] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 868/1156 variables, 288/305 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1156 variables, 18/323 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-03 00:07:30] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 2 ms to minimize.
[2024-06-03 00:07:31] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1156 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1156 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 19/1175 variables, 16/341 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1175 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/1175 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 341 constraints, problems are : Problem set: 0 solved, 44 unsolved in 5985 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 304/304 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 219/288 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-03 00:07:34] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 0 ms to minimize.
[2024-06-03 00:07:34] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 0 ms to minimize.
[2024-06-03 00:07:34] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 868/1156 variables, 288/310 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1156 variables, 18/328 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1156 variables, 40/368 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1156 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 19/1175 variables, 16/384 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1175 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1175 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/1175 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 388 constraints, problems are : Problem set: 0 solved, 44 unsolved in 10917 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 304/304 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 12/12 constraints]
After SMT, in 16993ms problems are : Problem set: 0 solved, 44 unsolved
Parikh walk visited 1 properties in 30046 ms.
Support contains 68 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 883/883 transitions.
Graph (trivial) has 57 edges and 304 vertex of which 4 / 304 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 302 transition count 872
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 296 transition count 872
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 13 place count 296 transition count 867
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 291 transition count 867
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 26 place count 288 transition count 804
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 288 transition count 804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 288 transition count 803
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 42 place count 282 transition count 797
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 280 transition count 791
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 280 transition count 791
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 274 transition count 822
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 64 place count 274 transition count 816
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 274 transition count 812
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 78 place count 270 transition count 806
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 118 place count 270 transition count 766
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 270 transition count 766
Applied a total of 119 rules in 92 ms. Remains 270 /304 variables (removed 34) and now considering 766/883 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 270/304 places, 766/883 transitions.
RANDOM walk for 40000 steps (1060 resets) in 540 ms. (73 steps per ms) remains 40/43 properties
BEST_FIRST walk for 4003 steps (21 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (21 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (18 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (16 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (19 resets) in 18 ms. (210 steps per ms) remains 38/40 properties
BEST_FIRST walk for 4004 steps (17 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (19 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (19 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (18 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (22 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (21 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (20 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (19 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (19 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (18 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (23 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (20 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (21 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (22 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (18 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (21 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (16 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
[2024-06-03 00:08:15] [INFO ] Flow matrix only has 747 transitions (discarded 19 similar events)
// Phase 1: matrix 747 rows 270 cols
[2024-06-03 00:08:15] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:08:15] [INFO ] State equation strengthened by 69 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 198/256 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-03 00:08:16] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-03 00:08:16] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:08:16] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 1 ms to minimize.
[2024-06-03 00:08:16] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:08:16] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:08:16] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-03 00:08:16] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 747/1003 variables, 256/273 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 69/342 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-03 00:08:17] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 14/1017 variables, 14/357 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1017 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/1017 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1017/1017 variables, and 357 constraints, problems are : Problem set: 0 solved, 38 unsolved in 3945 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 270/270 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 198/256 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-03 00:08:19] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:08:20] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:08:20] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 747/1003 variables, 256/277 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 69/346 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 34/380 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 14/1017 variables, 14/394 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1017 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1017 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-03 00:08:24] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/1017 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1017 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 0/1017 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1017/1017 variables, and 399 constraints, problems are : Problem set: 0 solved, 38 unsolved in 13354 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 270/270 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 12/12 constraints]
After SMT, in 17342ms problems are : Problem set: 0 solved, 38 unsolved
Parikh walk visited 1 properties in 9123 ms.
Support contains 57 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 766/766 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 270 transition count 763
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 267 transition count 763
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 264 transition count 760
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 263 transition count 759
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 263 transition count 759
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 259 transition count 795
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 259 transition count 794
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 259 transition count 772
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 259 transition count 771
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 258 transition count 768
Applied a total of 50 rules in 59 ms. Remains 258 /270 variables (removed 12) and now considering 768/766 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 258/270 places, 768/766 transitions.
RANDOM walk for 40000 steps (1133 resets) in 381 ms. (104 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (23 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (18 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (24 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (19 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (23 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (23 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (19 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (25 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (24 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (23 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (27 resets) in 11 ms. (333 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (22 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (21 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (20 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (23 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (20 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (22 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (22 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (21 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (25 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (20 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 282274 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :7 out of 35
Probabilistic random walk after 282274 steps, saw 89195 distinct states, run finished after 3004 ms. (steps per millisecond=93 ) properties seen :7
[2024-06-03 00:08:45] [INFO ] Flow matrix only has 745 transitions (discarded 23 similar events)
// Phase 1: matrix 745 rows 258 cols
[2024-06-03 00:08:45] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:08:45] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 199/240 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-03 00:08:45] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 1 ms to minimize.
[2024-06-03 00:08:45] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-03 00:08:45] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 0 ms to minimize.
[2024-06-03 00:08:46] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:08:46] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:08:46] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:08:46] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:08:46] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 4/244 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 745/989 variables, 244/262 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/989 variables, 75/337 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-03 00:08:47] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/989 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/989 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 14/1003 variables, 14/352 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1003 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 0/1003 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1003/1003 variables, and 352 constraints, problems are : Problem set: 0 solved, 28 unsolved in 3281 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 258/258 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 199/240 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-03 00:08:49] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 745/989 variables, 244/264 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/989 variables, 75/339 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/989 variables, 26/365 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-03 00:08:50] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/989 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/989 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 14/1003 variables, 14/380 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1003 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-03 00:08:52] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1003 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1003 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (OVERLAPS) 0/1003 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1003/1003 variables, and 383 constraints, problems are : Problem set: 0 solved, 28 unsolved in 7545 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 258/258 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 12/12 constraints]
After SMT, in 10856ms problems are : Problem set: 0 solved, 28 unsolved
Parikh walk visited 0 properties in 9383 ms.
Support contains 41 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 768/768 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 258 transition count 763
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 253 transition count 763
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 252 transition count 761
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 252 transition count 761
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 251 transition count 758
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 251 transition count 758
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 19 place count 251 transition count 753
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 250 transition count 752
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 31 place count 250 transition count 742
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 250 transition count 738
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 46 place count 246 transition count 731
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 2 with 38 rules applied. Total rules applied 84 place count 246 transition count 693
Applied a total of 84 rules in 58 ms. Remains 246 /258 variables (removed 12) and now considering 693/768 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 246/258 places, 693/768 transitions.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-06-03 00:09:05] [INFO ] Flatten gal took : 39 ms
[2024-06-03 00:09:05] [INFO ] Flatten gal took : 38 ms
[2024-06-03 00:09:06] [INFO ] Input system was already deterministic with 879 transitions.
Support contains 109 out of 467 places (down from 110) after GAL structural reductions.
Computed a total of 138 stabilizing places and 222 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 879/879 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 445 transition count 824
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 445 transition count 824
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 445 transition count 823
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 430 transition count 797
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 430 transition count 797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 430 transition count 796
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 425 transition count 785
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 425 transition count 785
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 425 transition count 784
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 422 transition count 777
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 422 transition count 777
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 419 transition count 769
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 419 transition count 769
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 416 transition count 762
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 416 transition count 762
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 413 transition count 754
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 413 transition count 754
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 410 transition count 747
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 410 transition count 747
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 407 transition count 739
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 407 transition count 739
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 404 transition count 732
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 404 transition count 732
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 402 transition count 728
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 402 transition count 728
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 400 transition count 724
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 400 transition count 724
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 398 transition count 721
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 398 transition count 721
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 397 transition count 720
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 397 transition count 720
Applied a total of 143 rules in 52 ms. Remains 397 /467 variables (removed 70) and now considering 720/879 (removed 159) transitions.
// Phase 1: matrix 720 rows 397 cols
[2024-06-03 00:09:06] [INFO ] Computed 10 invariants in 8 ms
[2024-06-03 00:09:06] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-03 00:09:06] [INFO ] Invariant cache hit.
[2024-06-03 00:09:06] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 719 sub problems to find dead transitions.
[2024-06-03 00:09:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-03 00:09:15] [INFO ] Deduced a trap composed of 248 places in 148 ms of which 3 ms to minimize.
[2024-06-03 00:09:15] [INFO ] Deduced a trap composed of 226 places in 146 ms of which 3 ms to minimize.
[2024-06-03 00:09:15] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 0 ms to minimize.
[2024-06-03 00:09:16] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:09:17] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 5 ms to minimize.
[2024-06-03 00:09:17] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:09:17] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:09:18] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 2 ms to minimize.
[2024-06-03 00:09:18] [INFO ] Deduced a trap composed of 109 places in 144 ms of which 2 ms to minimize.
[2024-06-03 00:09:19] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2024-06-03 00:09:19] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-03 00:09:23] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-06-03 00:09:24] [INFO ] Deduced a trap composed of 93 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-03 00:09:33] [INFO ] Deduced a trap composed of 83 places in 77 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 Real declared 397/1117 variables, and 24 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/397 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-03 00:09:41] [INFO ] Deduced a trap composed of 234 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:09:41] [INFO ] Deduced a trap composed of 251 places in 147 ms of which 3 ms to minimize.
[2024-06-03 00:09:41] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-03 00:09:41] [INFO ] Deduced a trap composed of 255 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:09:41] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:09:42] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 5 (OVERLAPS) 720/1117 variables, 397/427 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1117 variables, 719/1146 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-06-03 00:10:05] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1117/1117 variables, and 1147 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 21/21 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 719 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Starting structural reductions in LTL mode, iteration 1 : 397/467 places, 720/879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60878 ms. Remains : 397/467 places, 720/879 transitions.
[2024-06-03 00:10:06] [INFO ] Flatten gal took : 25 ms
[2024-06-03 00:10:06] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:10:07] [INFO ] Input system was already deterministic with 720 transitions.
[2024-06-03 00:10:07] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:10:07] [INFO ] Flatten gal took : 23 ms
[2024-06-03 00:10:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2025377234459980697.gal : 14 ms
[2024-06-03 00:10:07] [INFO ] Time to serialize properties into /tmp/CTLFireability16751607697995301289.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/CTLFireability2025377234459980697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16751607697995301289.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-06-03 00:10:37] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:10:37] [INFO ] Applying decomposition
[2024-06-03 00:10:37] [INFO ] Flatten gal took : 20 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/graph16212446241847049971.txt' '-o' '/tmp/graph16212446241847049971.bin' '-w' '/tmp/graph16212446241847049971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16212446241847049971.bin' '-l' '-1' '-v' '-w' '/tmp/graph16212446241847049971.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:10:37] [INFO ] Decomposing Gal with order
[2024-06-03 00:10:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:10:37] [INFO ] Removed a total of 810 redundant transitions.
[2024-06-03 00:10:37] [INFO ] Flatten gal took : 77 ms
[2024-06-03 00:10:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 24 ms.
[2024-06-03 00:10:37] [INFO ] Time to serialize gal into /tmp/CTLFireability4243983818706388893.gal : 10 ms
[2024-06-03 00:10:37] [INFO ] Time to serialize properties into /tmp/CTLFireability8251888854811175531.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/CTLFireability4243983818706388893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8251888854811175531.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 : 467/467 places, 879/879 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 437 transition count 786
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 437 transition count 786
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 437 transition count 785
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 81 place count 417 transition count 750
Iterating global reduction 1 with 20 rules applied. Total rules applied 101 place count 417 transition count 750
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 417 transition count 749
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 411 transition count 736
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 411 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 411 transition count 735
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 408 transition count 728
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 408 transition count 728
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 405 transition count 720
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 405 transition count 720
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 130 place count 402 transition count 713
Iterating global reduction 3 with 3 rules applied. Total rules applied 133 place count 402 transition count 713
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 136 place count 399 transition count 705
Iterating global reduction 3 with 3 rules applied. Total rules applied 139 place count 399 transition count 705
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 142 place count 396 transition count 698
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 396 transition count 698
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 393 transition count 690
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 393 transition count 690
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 154 place count 390 transition count 683
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 390 transition count 683
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 387 transition count 676
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 387 transition count 676
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 384 transition count 670
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 384 transition count 670
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 172 place count 381 transition count 665
Iterating global reduction 3 with 3 rules applied. Total rules applied 175 place count 381 transition count 665
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 379 transition count 662
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 379 transition count 662
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 378 transition count 661
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 378 transition count 661
Applied a total of 181 rules in 67 ms. Remains 378 /467 variables (removed 89) and now considering 661/879 (removed 218) transitions.
// Phase 1: matrix 661 rows 378 cols
[2024-06-03 00:11:07] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:11:07] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-03 00:11:07] [INFO ] Invariant cache hit.
[2024-06-03 00:11:08] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2024-06-03 00:11:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-06-03 00:11:16] [INFO ] Deduced a trap composed of 218 places in 134 ms of which 3 ms to minimize.
[2024-06-03 00:11:16] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2024-06-03 00:11:16] [INFO ] Deduced a trap composed of 76 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:11:17] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:11:17] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 2 ms to minimize.
[2024-06-03 00:11:18] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:11:18] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:11:18] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:11:19] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (OVERLAPS) 661/1039 variables, 378/397 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-06-03 00:11:33] [INFO ] Deduced a trap composed of 214 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:11:33] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:11:33] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1039/1039 variables, and 400 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-06-03 00:11:42] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 5 (OVERLAPS) 661/1039 variables, 378/401 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1039 variables, 660/1061 constraints. Problems are: Problem set: 0 solved, 660 unsolved
[2024-06-03 00:11:58] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:12:01] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:12:01] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 2 ms to minimize.
[2024-06-03 00:12:01] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1039/1039 variables, and 1065 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 17/17 constraints]
After SMT, in 60251ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Starting structural reductions in LTL mode, iteration 1 : 378/467 places, 661/879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60870 ms. Remains : 378/467 places, 661/879 transitions.
[2024-06-03 00:12:08] [INFO ] Flatten gal took : 25 ms
[2024-06-03 00:12:08] [INFO ] Flatten gal took : 31 ms
[2024-06-03 00:12:08] [INFO ] Input system was already deterministic with 661 transitions.
[2024-06-03 00:12:08] [INFO ] Flatten gal took : 29 ms
[2024-06-03 00:12:08] [INFO ] Flatten gal took : 29 ms
[2024-06-03 00:12:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17861271918756827203.gal : 11 ms
[2024-06-03 00:12:08] [INFO ] Time to serialize properties into /tmp/CTLFireability39337753281108843.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/CTLFireability17861271918756827203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability39337753281108843.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-06-03 00:12:38] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:12:38] [INFO ] Applying decomposition
[2024-06-03 00:12:38] [INFO ] Flatten gal took : 15 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/graph12585407594075791366.txt' '-o' '/tmp/graph12585407594075791366.bin' '-w' '/tmp/graph12585407594075791366.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12585407594075791366.bin' '-l' '-1' '-v' '-w' '/tmp/graph12585407594075791366.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:12:38] [INFO ] Decomposing Gal with order
[2024-06-03 00:12:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:12:39] [INFO ] Removed a total of 728 redundant transitions.
[2024-06-03 00:12:39] [INFO ] Flatten gal took : 30 ms
[2024-06-03 00:12:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 12 ms.
[2024-06-03 00:12:39] [INFO ] Time to serialize gal into /tmp/CTLFireability12771237047972576164.gal : 4 ms
[2024-06-03 00:12:39] [INFO ] Time to serialize properties into /tmp/CTLFireability10267594611896974992.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/CTLFireability12771237047972576164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10267594611896974992.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 -...264
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 : 467/467 places, 879/879 transitions.
Graph (trivial) has 320 edges and 467 vertex of which 11 / 467 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 458 transition count 816
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 113 place count 405 transition count 810
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 402 transition count 809
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 401 transition count 809
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 118 place count 401 transition count 778
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 180 place count 370 transition count 778
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 205 place count 345 transition count 662
Iterating global reduction 4 with 25 rules applied. Total rules applied 230 place count 345 transition count 662
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 234 place count 345 transition count 658
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 235 place count 344 transition count 658
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 235 place count 344 transition count 649
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 253 place count 335 transition count 649
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 269 place count 319 transition count 622
Iterating global reduction 6 with 16 rules applied. Total rules applied 285 place count 319 transition count 622
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 287 place count 319 transition count 620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 288 place count 318 transition count 620
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 293 place count 313 transition count 610
Iterating global reduction 8 with 5 rules applied. Total rules applied 298 place count 313 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 300 place count 313 transition count 608
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 301 place count 312 transition count 608
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 303 place count 310 transition count 603
Iterating global reduction 10 with 2 rules applied. Total rules applied 305 place count 310 transition count 603
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 307 place count 308 transition count 598
Iterating global reduction 10 with 2 rules applied. Total rules applied 309 place count 308 transition count 598
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 311 place count 306 transition count 593
Iterating global reduction 10 with 2 rules applied. Total rules applied 313 place count 306 transition count 593
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 315 place count 304 transition count 588
Iterating global reduction 10 with 2 rules applied. Total rules applied 317 place count 304 transition count 588
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 319 place count 302 transition count 583
Iterating global reduction 10 with 2 rules applied. Total rules applied 321 place count 302 transition count 583
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 323 place count 300 transition count 578
Iterating global reduction 10 with 2 rules applied. Total rules applied 325 place count 300 transition count 578
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 327 place count 298 transition count 573
Iterating global reduction 10 with 2 rules applied. Total rules applied 329 place count 298 transition count 573
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 331 place count 296 transition count 568
Iterating global reduction 10 with 2 rules applied. Total rules applied 333 place count 296 transition count 568
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 335 place count 294 transition count 564
Iterating global reduction 10 with 2 rules applied. Total rules applied 337 place count 294 transition count 564
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 339 place count 292 transition count 560
Iterating global reduction 10 with 2 rules applied. Total rules applied 341 place count 292 transition count 560
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 342 place count 291 transition count 558
Iterating global reduction 10 with 1 rules applied. Total rules applied 343 place count 291 transition count 558
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 38 rules applied. Total rules applied 381 place count 272 transition count 539
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 383 place count 270 transition count 535
Iterating global reduction 10 with 2 rules applied. Total rules applied 385 place count 270 transition count 535
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 386 place count 269 transition count 534
Applied a total of 386 rules in 154 ms. Remains 269 /467 variables (removed 198) and now considering 534/879 (removed 345) transitions.
[2024-06-03 00:13:09] [INFO ] Flow matrix only has 529 transitions (discarded 5 similar events)
// Phase 1: matrix 529 rows 269 cols
[2024-06-03 00:13:09] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:13:09] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-06-03 00:13:09] [INFO ] Flow matrix only has 529 transitions (discarded 5 similar events)
[2024-06-03 00:13:09] [INFO ] Invariant cache hit.
[2024-06-03 00:13:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-03 00:13:10] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2024-06-03 00:13:10] [INFO ] Redundant transitions in 28 ms returned []
Running 521 sub problems to find dead transitions.
[2024-06-03 00:13:10] [INFO ] Flow matrix only has 529 transitions (discarded 5 similar events)
[2024-06-03 00:13:10] [INFO ] Invariant cache hit.
[2024-06-03 00:13:10] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-03 00:13:12] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 0 ms to minimize.
[2024-06-03 00:13:13] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 0 ms to minimize.
[2024-06-03 00:13:13] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:13:13] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-06-03 00:13:13] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:13:13] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-06-03 00:13:14] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:13:14] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 0 ms to minimize.
[2024-06-03 00:13:14] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 1 ms to minimize.
[2024-06-03 00:13:14] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2024-06-03 00:13:14] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:13:16] [INFO ] Deduced a trap composed of 66 places in 38 ms of which 1 ms to minimize.
[2024-06-03 00:13:16] [INFO ] Deduced a trap composed of 189 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:13:16] [INFO ] Deduced a trap composed of 198 places in 92 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (OVERLAPS) 528/794 variables, 266/290 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/794 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 6 (OVERLAPS) 3/797 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/797 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 521 unsolved
[2024-06-03 00:13:40] [INFO ] Deduced a trap composed of 78 places in 96 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 Real declared 797/798 variables, and 297 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 269/269 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (OVERLAPS) 528/794 variables, 266/291 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/794 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 521/815 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 7 (OVERLAPS) 3/797 variables, 3/818 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/798 variables, and 818 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 269/269 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 15/15 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Starting structural reductions in SI_CTL mode, iteration 1 : 269/467 places, 534/879 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61267 ms. Remains : 269/467 places, 534/879 transitions.
[2024-06-03 00:14:10] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:14:10] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:14:10] [INFO ] Input system was already deterministic with 534 transitions.
[2024-06-03 00:14:10] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:14:10] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:14:10] [INFO ] Time to serialize gal into /tmp/CTLFireability14248082418520411747.gal : 4 ms
[2024-06-03 00:14:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15557438038097643783.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/CTLFireability14248082418520411747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15557438038097643783.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 00:14:40] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:14:40] [INFO ] Applying decomposition
[2024-06-03 00:14:40] [INFO ] Flatten gal took : 13 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/graph2400541783843260275.txt' '-o' '/tmp/graph2400541783843260275.bin' '-w' '/tmp/graph2400541783843260275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2400541783843260275.bin' '-l' '-1' '-v' '-w' '/tmp/graph2400541783843260275.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:14:40] [INFO ] Decomposing Gal with order
[2024-06-03 00:14:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:14:40] [INFO ] Removed a total of 675 redundant transitions.
[2024-06-03 00:14:40] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:14:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 10 ms.
[2024-06-03 00:14:40] [INFO ] Time to serialize gal into /tmp/CTLFireability24944509509667459.gal : 3 ms
[2024-06-03 00:14:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7415622917323061504.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/CTLFireability24944509509667459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7415622917323061504.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 879/879 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 438 transition count 787
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 438 transition count 787
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 438 transition count 786
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 78 place count 419 transition count 753
Iterating global reduction 1 with 19 rules applied. Total rules applied 97 place count 419 transition count 753
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 419 transition count 752
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 414 transition count 740
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 414 transition count 740
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 411 transition count 733
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 411 transition count 733
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 408 transition count 725
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 408 transition count 725
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 406 transition count 720
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 406 transition count 720
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 404 transition count 715
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 404 transition count 715
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 402 transition count 710
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 402 transition count 710
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 401 transition count 708
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 401 transition count 708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 400 transition count 705
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 400 transition count 705
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 399 transition count 703
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 399 transition count 703
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 398 transition count 701
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 398 transition count 701
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 397 transition count 699
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 397 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 396 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 396 transition count 698
Applied a total of 144 rules in 72 ms. Remains 396 /467 variables (removed 71) and now considering 698/879 (removed 181) transitions.
// Phase 1: matrix 698 rows 396 cols
[2024-06-03 00:15:10] [INFO ] Computed 10 invariants in 9 ms
[2024-06-03 00:15:11] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-06-03 00:15:11] [INFO ] Invariant cache hit.
[2024-06-03 00:15:11] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 697 sub problems to find dead transitions.
[2024-06-03 00:15:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (OVERLAPS) 1/396 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 697 unsolved
[2024-06-03 00:15:20] [INFO ] Deduced a trap composed of 229 places in 137 ms of which 2 ms to minimize.
[2024-06-03 00:15:20] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:15:20] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:15:20] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:15:21] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:15:21] [INFO ] Deduced a trap composed of 89 places in 50 ms of which 0 ms to minimize.
[2024-06-03 00:15:21] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:15:22] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:15:22] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:15:23] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
[2024-06-03 00:15:23] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:15:26] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:15:26] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:15:26] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 697 unsolved
[2024-06-03 00:15:30] [INFO ] Deduced a trap composed of 118 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 697 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 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.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 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.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 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 0.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 0.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)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1094 variables, and 25 constraints, problems are : Problem set: 0 solved, 697 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/396 constraints, PredecessorRefiner: 697/697 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 697 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (OVERLAPS) 1/396 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 4 (OVERLAPS) 698/1094 variables, 396/421 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1094 variables, 697/1118 constraints. Problems are: Problem set: 0 solved, 697 unsolved
[2024-06-03 00:15:59] [INFO ] Deduced a trap composed of 110 places in 144 ms of which 2 ms to minimize.
[2024-06-03 00:16:00] [INFO ] Deduced a trap composed of 232 places in 143 ms of which 3 ms to minimize.
[2024-06-03 00:16:00] [INFO ] Deduced a trap composed of 232 places in 143 ms of which 2 ms to minimize.
[2024-06-03 00:16:03] [INFO ] Deduced a trap composed of 237 places in 150 ms of which 3 ms to minimize.
[2024-06-03 00:16:06] [INFO ] Deduced a trap composed of 232 places in 141 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1094 variables, and 1123 constraints, problems are : Problem set: 0 solved, 697 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 697/697 constraints, Known Traps: 20/20 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 697 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 396/467 places, 698/879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61048 ms. Remains : 396/467 places, 698/879 transitions.
[2024-06-03 00:16:11] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:16:11] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:16:11] [INFO ] Input system was already deterministic with 698 transitions.
[2024-06-03 00:16:11] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:16:11] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:16:11] [INFO ] Time to serialize gal into /tmp/CTLFireability7121903099298415627.gal : 3 ms
[2024-06-03 00:16:11] [INFO ] Time to serialize properties into /tmp/CTLFireability7095847221149972407.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/CTLFireability7121903099298415627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7095847221149972407.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-06-03 00:16:42] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:16:42] [INFO ] Applying decomposition
[2024-06-03 00:16:42] [INFO ] Flatten gal took : 17 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/graph18360277912634089285.txt' '-o' '/tmp/graph18360277912634089285.bin' '-w' '/tmp/graph18360277912634089285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18360277912634089285.bin' '-l' '-1' '-v' '-w' '/tmp/graph18360277912634089285.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:16:42] [INFO ] Decomposing Gal with order
[2024-06-03 00:16:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:16:42] [INFO ] Removed a total of 790 redundant transitions.
[2024-06-03 00:16:42] [INFO ] Flatten gal took : 31 ms
[2024-06-03 00:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 8 ms.
[2024-06-03 00:16:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3290760581486866417.gal : 5 ms
[2024-06-03 00:16:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17688331550614853456.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/CTLFireability3290760581486866417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17688331550614853456.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 : 467/467 places, 879/879 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 439 transition count 762
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 439 transition count 762
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 439 transition count 760
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 76 place count 421 transition count 729
Iterating global reduction 1 with 18 rules applied. Total rules applied 94 place count 421 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 421 transition count 728
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 99 place count 417 transition count 721
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 417 transition count 721
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 417 transition count 720
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 416 transition count 717
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 416 transition count 717
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 415 transition count 715
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 415 transition count 715
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 414 transition count 712
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 414 transition count 712
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 413 transition count 710
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 413 transition count 710
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 412 transition count 707
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 412 transition count 707
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 411 transition count 705
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 411 transition count 705
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 410 transition count 702
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 410 transition count 702
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 409 transition count 700
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 409 transition count 700
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 408 transition count 698
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 408 transition count 698
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 407 transition count 696
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 407 transition count 696
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 406 transition count 695
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 406 transition count 695
Applied a total of 126 rules in 70 ms. Remains 406 /467 variables (removed 61) and now considering 695/879 (removed 184) transitions.
// Phase 1: matrix 695 rows 406 cols
[2024-06-03 00:17:12] [INFO ] Computed 10 invariants in 8 ms
[2024-06-03 00:17:12] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-03 00:17:12] [INFO ] Invariant cache hit.
[2024-06-03 00:17:12] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 694 sub problems to find dead transitions.
[2024-06-03 00:17:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (OVERLAPS) 1/406 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 694 unsolved
[2024-06-03 00:17:21] [INFO ] Deduced a trap composed of 232 places in 133 ms of which 3 ms to minimize.
[2024-06-03 00:17:21] [INFO ] Deduced a trap composed of 233 places in 126 ms of which 3 ms to minimize.
[2024-06-03 00:17:21] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 1 ms to minimize.
[2024-06-03 00:17:21] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 2 ms to minimize.
[2024-06-03 00:17:22] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 2 ms to minimize.
[2024-06-03 00:17:22] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-06-03 00:17:22] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 1 ms to minimize.
[2024-06-03 00:17:22] [INFO ] Deduced a trap composed of 237 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:17:22] [INFO ] Deduced a trap composed of 244 places in 142 ms of which 2 ms to minimize.
[2024-06-03 00:17:22] [INFO ] Deduced a trap composed of 246 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:17:23] [INFO ] Deduced a trap composed of 284 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:17:23] [INFO ] Deduced a trap composed of 230 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:17:23] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2024-06-03 00:17:23] [INFO ] Deduced a trap composed of 229 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:17:23] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:17:23] [INFO ] Deduced a trap composed of 236 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:17:23] [INFO ] Deduced a trap composed of 237 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:17:24] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 2 ms to minimize.
[2024-06-03 00:17:25] [INFO ] Deduced a trap composed of 233 places in 139 ms of which 3 ms to minimize.
[2024-06-03 00:17:26] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 694 unsolved
[2024-06-03 00:17:26] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-06-03 00:17:26] [INFO ] Deduced a trap composed of 234 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:17:27] [INFO ] Deduced a trap composed of 235 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:17:29] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 694 unsolved
[2024-06-03 00:17:38] [INFO ] Deduced a trap composed of 231 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:17:38] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 2 ms to minimize.
[2024-06-03 00:17:40] [INFO ] Deduced a trap composed of 250 places in 136 ms of which 2 ms to minimize.
[2024-06-03 00:17:41] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1101 variables, and 38 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/406 constraints, PredecessorRefiner: 694/694 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (OVERLAPS) 1/406 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 694 unsolved
[2024-06-03 00:17:47] [INFO ] Deduced a trap composed of 230 places in 132 ms of which 2 ms to minimize.
[2024-06-03 00:17:48] [INFO ] Deduced a trap composed of 230 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:17:49] [INFO ] Deduced a trap composed of 237 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 694 unsolved
[2024-06-03 00:17:57] [INFO ] Deduced a trap composed of 241 places in 140 ms of which 2 ms to minimize.
[2024-06-03 00:17:58] [INFO ] Deduced a trap composed of 88 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 694 unsolved
[2024-06-03 00:18:03] [INFO ] Deduced a trap composed of 117 places in 138 ms of which 2 ms to minimize.
[2024-06-03 00:18:05] [INFO ] Deduced a trap composed of 245 places in 134 ms of which 2 ms to minimize.
[2024-06-03 00:18:05] [INFO ] Deduced a trap composed of 241 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:18:06] [INFO ] Deduced a trap composed of 232 places in 134 ms of which 3 ms to minimize.
[2024-06-03 00:18:06] [INFO ] Deduced a trap composed of 237 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:18:06] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 694 unsolved
[2024-06-03 00:18:10] [INFO ] Deduced a trap composed of 241 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:18:10] [INFO ] Deduced a trap composed of 238 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:18:11] [INFO ] Deduced a trap composed of 232 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:18:11] [INFO ] Deduced a trap composed of 231 places in 136 ms of which 2 ms to minimize.
[2024-06-03 00:18:11] [INFO ] Deduced a trap composed of 231 places in 118 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1101 variables, and 54 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/406 constraints, PredecessorRefiner: 0/694 constraints, Known Traps: 44/44 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 694 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Starting structural reductions in LTL mode, iteration 1 : 406/467 places, 695/879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60950 ms. Remains : 406/467 places, 695/879 transitions.
[2024-06-03 00:18:13] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:18:13] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:18:13] [INFO ] Input system was already deterministic with 695 transitions.
[2024-06-03 00:18:13] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:18:13] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:18:13] [INFO ] Time to serialize gal into /tmp/CTLFireability323745450470467294.gal : 3 ms
[2024-06-03 00:18:13] [INFO ] Time to serialize properties into /tmp/CTLFireability16132340492435589375.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/CTLFireability323745450470467294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16132340492435589375.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-06-03 00:18:43] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:18:43] [INFO ] Applying decomposition
[2024-06-03 00:18:43] [INFO ] Flatten gal took : 15 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/graph925811483873851026.txt' '-o' '/tmp/graph925811483873851026.bin' '-w' '/tmp/graph925811483873851026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph925811483873851026.bin' '-l' '-1' '-v' '-w' '/tmp/graph925811483873851026.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:18:43] [INFO ] Decomposing Gal with order
[2024-06-03 00:18:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:18:43] [INFO ] Removed a total of 782 redundant transitions.
[2024-06-03 00:18:43] [INFO ] Flatten gal took : 29 ms
[2024-06-03 00:18:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 8 ms.
[2024-06-03 00:18:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4081325856010912743.gal : 5 ms
[2024-06-03 00:18:43] [INFO ] Time to serialize properties into /tmp/CTLFireability725351773022960750.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/CTLFireability4081325856010912743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability725351773022960750.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 -...261
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 : 467/467 places, 879/879 transitions.
Graph (trivial) has 320 edges and 467 vertex of which 11 / 467 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 458 transition count 815
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 115 place count 404 transition count 809
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 401 transition count 809
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 118 place count 401 transition count 777
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 182 place count 369 transition count 777
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 207 place count 344 transition count 659
Iterating global reduction 3 with 25 rules applied. Total rules applied 232 place count 344 transition count 659
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 236 place count 344 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 237 place count 343 transition count 655
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 237 place count 343 transition count 647
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 253 place count 335 transition count 647
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 268 place count 320 transition count 622
Iterating global reduction 5 with 15 rules applied. Total rules applied 283 place count 320 transition count 622
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 285 place count 320 transition count 620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 286 place count 319 transition count 620
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 292 place count 313 transition count 607
Iterating global reduction 7 with 6 rules applied. Total rules applied 298 place count 313 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 300 place count 313 transition count 605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 301 place count 312 transition count 605
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 304 place count 309 transition count 598
Iterating global reduction 9 with 3 rules applied. Total rules applied 307 place count 309 transition count 598
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 310 place count 306 transition count 590
Iterating global reduction 9 with 3 rules applied. Total rules applied 313 place count 306 transition count 590
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 316 place count 303 transition count 583
Iterating global reduction 9 with 3 rules applied. Total rules applied 319 place count 303 transition count 583
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 322 place count 300 transition count 575
Iterating global reduction 9 with 3 rules applied. Total rules applied 325 place count 300 transition count 575
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 328 place count 297 transition count 568
Iterating global reduction 9 with 3 rules applied. Total rules applied 331 place count 297 transition count 568
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 333 place count 295 transition count 563
Iterating global reduction 9 with 2 rules applied. Total rules applied 335 place count 295 transition count 563
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 337 place count 293 transition count 558
Iterating global reduction 9 with 2 rules applied. Total rules applied 339 place count 293 transition count 558
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 341 place count 291 transition count 554
Iterating global reduction 9 with 2 rules applied. Total rules applied 343 place count 291 transition count 554
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 345 place count 289 transition count 550
Iterating global reduction 9 with 2 rules applied. Total rules applied 347 place count 289 transition count 550
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 348 place count 288 transition count 548
Iterating global reduction 9 with 1 rules applied. Total rules applied 349 place count 288 transition count 548
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 389 place count 268 transition count 528
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 391 place count 266 transition count 524
Iterating global reduction 9 with 2 rules applied. Total rules applied 393 place count 266 transition count 524
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 394 place count 265 transition count 523
Applied a total of 394 rules in 94 ms. Remains 265 /467 variables (removed 202) and now considering 523/879 (removed 356) transitions.
[2024-06-03 00:19:13] [INFO ] Flow matrix only has 518 transitions (discarded 5 similar events)
// Phase 1: matrix 518 rows 265 cols
[2024-06-03 00:19:13] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:19:13] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-03 00:19:13] [INFO ] Flow matrix only has 518 transitions (discarded 5 similar events)
[2024-06-03 00:19:13] [INFO ] Invariant cache hit.
[2024-06-03 00:19:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-03 00:19:14] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2024-06-03 00:19:14] [INFO ] Redundant transitions in 9 ms returned []
Running 510 sub problems to find dead transitions.
[2024-06-03 00:19:14] [INFO ] Flow matrix only has 518 transitions (discarded 5 similar events)
[2024-06-03 00:19:14] [INFO ] Invariant cache hit.
[2024-06-03 00:19:14] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-06-03 00:19:16] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 0 ms to minimize.
[2024-06-03 00:19:17] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 0 ms to minimize.
[2024-06-03 00:19:17] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-06-03 00:19:17] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-06-03 00:19:18] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:19:18] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-06-03 00:19:18] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2024-06-03 00:19:18] [INFO ] Deduced a trap composed of 66 places in 34 ms of which 1 ms to minimize.
[2024-06-03 00:19:18] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:19:18] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2024-06-03 00:19:19] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-06-03 00:19:19] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:19:20] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-03 00:19:20] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 0 ms to minimize.
[2024-06-03 00:19:20] [INFO ] Deduced a trap composed of 189 places in 95 ms of which 2 ms to minimize.
[2024-06-03 00:19:20] [INFO ] Deduced a trap composed of 195 places in 93 ms of which 2 ms to minimize.
[2024-06-03 00:19:20] [INFO ] Deduced a trap composed of 192 places in 97 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 517/779 variables, 262/289 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/779 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/779 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (OVERLAPS) 3/782 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/783 variables, and 295 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 265/265 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 517/779 variables, 262/289 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/779 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/779 variables, 510/802 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 7 (OVERLAPS) 3/782 variables, 3/805 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/783 variables, and 805 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 265/265 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 17/17 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Starting structural reductions in SI_CTL mode, iteration 1 : 265/467 places, 523/879 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60954 ms. Remains : 265/467 places, 523/879 transitions.
[2024-06-03 00:20:14] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:20:14] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:20:14] [INFO ] Input system was already deterministic with 523 transitions.
[2024-06-03 00:20:14] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:20:14] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:20:14] [INFO ] Time to serialize gal into /tmp/CTLFireability142738915997735695.gal : 2 ms
[2024-06-03 00:20:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8044879655121892714.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/CTLFireability142738915997735695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8044879655121892714.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-06-03 00:20:44] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:20:44] [INFO ] Applying decomposition
[2024-06-03 00:20:44] [INFO ] Flatten gal took : 10 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/graph11223348875505302901.txt' '-o' '/tmp/graph11223348875505302901.bin' '-w' '/tmp/graph11223348875505302901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11223348875505302901.bin' '-l' '-1' '-v' '-w' '/tmp/graph11223348875505302901.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:20:44] [INFO ] Decomposing Gal with order
[2024-06-03 00:20:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:20:44] [INFO ] Removed a total of 659 redundant transitions.
[2024-06-03 00:20:44] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:20:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 12 ms.
[2024-06-03 00:20:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2012816800650371035.gal : 5 ms
[2024-06-03 00:20:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15873918819565132858.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/CTLFireability2012816800650371035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15873918819565132858.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 : 467/467 places, 879/879 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 437 transition count 757
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 437 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 437 transition count 756
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 81 place count 417 transition count 721
Iterating global reduction 1 with 20 rules applied. Total rules applied 101 place count 417 transition count 721
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 417 transition count 720
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 411 transition count 707
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 411 transition count 707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 411 transition count 706
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 408 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 408 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 405 transition count 691
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 405 transition count 691
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 130 place count 402 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 133 place count 402 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 136 place count 399 transition count 676
Iterating global reduction 3 with 3 rules applied. Total rules applied 139 place count 399 transition count 676
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 142 place count 396 transition count 669
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 396 transition count 669
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 393 transition count 661
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 393 transition count 661
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 154 place count 390 transition count 654
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 390 transition count 654
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 387 transition count 647
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 387 transition count 647
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 384 transition count 641
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 384 transition count 641
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 172 place count 381 transition count 636
Iterating global reduction 3 with 3 rules applied. Total rules applied 175 place count 381 transition count 636
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 379 transition count 633
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 379 transition count 633
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 378 transition count 632
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 378 transition count 632
Applied a total of 181 rules in 60 ms. Remains 378 /467 variables (removed 89) and now considering 632/879 (removed 247) transitions.
// Phase 1: matrix 632 rows 378 cols
[2024-06-03 00:21:15] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:21:15] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-03 00:21:15] [INFO ] Invariant cache hit.
[2024-06-03 00:21:15] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 631 sub problems to find dead transitions.
[2024-06-03 00:21:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:21:22] [INFO ] Deduced a trap composed of 249 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:21:22] [INFO ] Deduced a trap composed of 231 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:21:23] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:21:23] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:21:23] [INFO ] Deduced a trap composed of 76 places in 38 ms of which 1 ms to minimize.
[2024-06-03 00:21:23] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:21:24] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:21:24] [INFO ] Deduced a trap composed of 79 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:21:24] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:21:25] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:21:27] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:21:28] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:21:29] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (OVERLAPS) 632/1010 variables, 378/401 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:21:44] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:21:45] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:21:45] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 404 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (OVERLAPS) 632/1010 variables, 378/404 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 631/1035 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:22:01] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 3 ms to minimize.
[2024-06-03 00:22:02] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1037 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 18/18 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Starting structural reductions in LTL mode, iteration 1 : 378/467 places, 632/879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60845 ms. Remains : 378/467 places, 632/879 transitions.
[2024-06-03 00:22:15] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:22:15] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:22:15] [INFO ] Input system was already deterministic with 632 transitions.
[2024-06-03 00:22:15] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:22:15] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:22:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5166292428174956218.gal : 3 ms
[2024-06-03 00:22:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3228850648366087054.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/CTLFireability5166292428174956218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3228850648366087054.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-06-03 00:22:45] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:22:45] [INFO ] Applying decomposition
[2024-06-03 00:22:45] [INFO ] Flatten gal took : 13 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/graph467248568858238584.txt' '-o' '/tmp/graph467248568858238584.bin' '-w' '/tmp/graph467248568858238584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph467248568858238584.bin' '-l' '-1' '-v' '-w' '/tmp/graph467248568858238584.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:22:46] [INFO ] Decomposing Gal with order
[2024-06-03 00:22:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:22:46] [INFO ] Removed a total of 677 redundant transitions.
[2024-06-03 00:22:46] [INFO ] Flatten gal took : 23 ms
[2024-06-03 00:22:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 5 ms.
[2024-06-03 00:22:46] [INFO ] Time to serialize gal into /tmp/CTLFireability17475395956955420970.gal : 4 ms
[2024-06-03 00:22:46] [INFO ] Time to serialize properties into /tmp/CTLFireability554939263534073650.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/CTLFireability17475395956955420970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability554939263534073650.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 : 467/467 places, 879/879 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 440 transition count 790
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 440 transition count 790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 440 transition count 789
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 422 transition count 759
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 422 transition count 759
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 758
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 97 place count 417 transition count 747
Iterating global reduction 2 with 5 rules applied. Total rules applied 102 place count 417 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 417 transition count 746
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 415 transition count 742
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 415 transition count 742
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 413 transition count 736
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 413 transition count 736
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 411 transition count 732
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 411 transition count 732
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 409 transition count 726
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 409 transition count 726
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 407 transition count 722
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 407 transition count 722
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 405 transition count 716
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 405 transition count 716
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 403 transition count 712
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 403 transition count 712
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 401 transition count 707
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 401 transition count 707
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 400 transition count 705
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 400 transition count 705
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 399 transition count 704
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 399 transition count 704
Applied a total of 139 rules in 53 ms. Remains 399 /467 variables (removed 68) and now considering 704/879 (removed 175) transitions.
// Phase 1: matrix 704 rows 399 cols
[2024-06-03 00:23:16] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:23:16] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-03 00:23:16] [INFO ] Invariant cache hit.
[2024-06-03 00:23:16] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2024-06-03 00:23:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/399 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-03 00:23:25] [INFO ] Deduced a trap composed of 218 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:23:25] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:23:25] [INFO ] Deduced a trap composed of 76 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:23:26] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 2 ms to minimize.
[2024-06-03 00:23:26] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 0 ms to minimize.
[2024-06-03 00:23:26] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:23:27] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:23:27] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:23:27] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:23:28] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-06-03 00:23:28] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 3 ms to minimize.
[2024-06-03 00:23:28] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (OVERLAPS) 704/1103 variables, 399/421 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-03 00:23:44] [INFO ] Deduced a trap composed of 185 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 422 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/399 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (OVERLAPS) 704/1103 variables, 399/422 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1103 variables, 703/1125 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-03 00:24:02] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-06-03 00:24:05] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:24:06] [INFO ] Deduced a trap composed of 127 places in 157 ms of which 2 ms to minimize.
[2024-06-03 00:24:06] [INFO ] Deduced a trap composed of 118 places in 147 ms of which 3 ms to minimize.
[2024-06-03 00:24:09] [INFO ] Deduced a trap composed of 127 places in 152 ms of which 3 ms to minimize.
[2024-06-03 00:24:10] [INFO ] Deduced a trap composed of 236 places in 141 ms of which 2 ms to minimize.
[2024-06-03 00:24:11] [INFO ] Deduced a trap composed of 237 places in 155 ms of which 2 ms to minimize.
[2024-06-03 00:24:15] [INFO ] Deduced a trap composed of 232 places in 137 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 1103/1103 variables, and 1133 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 21/21 constraints]
After SMT, in 60294ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60300ms
Starting structural reductions in LTL mode, iteration 1 : 399/467 places, 704/879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60844 ms. Remains : 399/467 places, 704/879 transitions.
[2024-06-03 00:24:16] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:24:17] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:24:17] [INFO ] Input system was already deterministic with 704 transitions.
[2024-06-03 00:24:17] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:24:17] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:24:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11291443150426896311.gal : 3 ms
[2024-06-03 00:24:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12384096025237113263.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/CTLFireability11291443150426896311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12384096025237113263.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 00:24:47] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:24:47] [INFO ] Applying decomposition
[2024-06-03 00:24:47] [INFO ] Flatten gal took : 15 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/graph4309360957935645259.txt' '-o' '/tmp/graph4309360957935645259.bin' '-w' '/tmp/graph4309360957935645259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4309360957935645259.bin' '-l' '-1' '-v' '-w' '/tmp/graph4309360957935645259.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:24:47] [INFO ] Decomposing Gal with order
[2024-06-03 00:24:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:24:47] [INFO ] Removed a total of 808 redundant transitions.
[2024-06-03 00:24:47] [INFO ] Flatten gal took : 25 ms
[2024-06-03 00:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 7 ms.
[2024-06-03 00:24:47] [INFO ] Time to serialize gal into /tmp/CTLFireability17219048531018140994.gal : 5 ms
[2024-06-03 00:24:47] [INFO ] Time to serialize properties into /tmp/CTLFireability13733664949783642125.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/CTLFireability17219048531018140994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13733664949783642125.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 879/879 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 436 transition count 756
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 436 transition count 756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 436 transition count 754
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 84 place count 416 transition count 719
Iterating global reduction 1 with 20 rules applied. Total rules applied 104 place count 416 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 416 transition count 718
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 410 transition count 705
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 410 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 410 transition count 704
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 121 place count 407 transition count 697
Iterating global reduction 3 with 3 rules applied. Total rules applied 124 place count 407 transition count 697
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 404 transition count 689
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 404 transition count 689
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 401 transition count 682
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 401 transition count 682
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 138 place count 399 transition count 677
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 399 transition count 677
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 142 place count 397 transition count 672
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 397 transition count 672
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 395 transition count 667
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 395 transition count 667
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 393 transition count 662
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 393 transition count 662
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 391 transition count 657
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 391 transition count 657
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 389 transition count 653
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 389 transition count 653
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 162 place count 387 transition count 649
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 387 transition count 649
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 166 place count 385 transition count 646
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 385 transition count 646
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 384 transition count 645
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 384 transition count 645
Applied a total of 170 rules in 49 ms. Remains 384 /467 variables (removed 83) and now considering 645/879 (removed 234) transitions.
// Phase 1: matrix 645 rows 384 cols
[2024-06-03 00:25:17] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:25:17] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-03 00:25:17] [INFO ] Invariant cache hit.
[2024-06-03 00:25:17] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-03 00:25:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (OVERLAPS) 1/384 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-03 00:25:25] [INFO ] Deduced a trap composed of 239 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:25:25] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:25:25] [INFO ] Deduced a trap composed of 219 places in 116 ms of which 3 ms to minimize.
[2024-06-03 00:25:26] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:25:26] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:25:26] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:25:26] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:25:26] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:25:27] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 0 ms to minimize.
[2024-06-03 00:25:28] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:25:28] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:25:28] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:25:29] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-03 00:25:32] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 1 ms to minimize.
[2024-06-03 00:25:34] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (OVERLAPS) 645/1029 variables, 384/409 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1029/1029 variables, and 409 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 384/384 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (OVERLAPS) 1/384 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 645/1029 variables, 384/409 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 644/1053 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-03 00:26:03] [INFO ] Deduced a trap composed of 228 places in 135 ms of which 3 ms to minimize.
[2024-06-03 00:26:06] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/1029 variables, and 1055 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 384/384 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 17/17 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Starting structural reductions in LTL mode, iteration 1 : 384/467 places, 645/879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60770 ms. Remains : 384/467 places, 645/879 transitions.
[2024-06-03 00:26:18] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:26:18] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:26:18] [INFO ] Input system was already deterministic with 645 transitions.
[2024-06-03 00:26:18] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:26:18] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:26:18] [INFO ] Time to serialize gal into /tmp/CTLFireability270353265053489314.gal : 9 ms
[2024-06-03 00:26:18] [INFO ] Time to serialize properties into /tmp/CTLFireability15462613988681871957.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/CTLFireability270353265053489314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15462613988681871957.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-06-03 00:26:48] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:26:48] [INFO ] Applying decomposition
[2024-06-03 00:26:48] [INFO ] Flatten gal took : 16 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/graph9146373684813139108.txt' '-o' '/tmp/graph9146373684813139108.bin' '-w' '/tmp/graph9146373684813139108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9146373684813139108.bin' '-l' '-1' '-v' '-w' '/tmp/graph9146373684813139108.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:26:48] [INFO ] Decomposing Gal with order
[2024-06-03 00:26:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:26:48] [INFO ] Removed a total of 706 redundant transitions.
[2024-06-03 00:26:48] [INFO ] Flatten gal took : 23 ms
[2024-06-03 00:26:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2024-06-03 00:26:48] [INFO ] Time to serialize gal into /tmp/CTLFireability11115850648892668282.gal : 4 ms
[2024-06-03 00:26:48] [INFO ] Time to serialize properties into /tmp/CTLFireability7015504571649108743.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/CTLFireability11115850648892668282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7015504571649108743.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 : 467/467 places, 879/879 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 441 transition count 819
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 441 transition count 819
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 441 transition count 818
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 423 transition count 785
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 423 transition count 785
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 423 transition count 784
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 95 place count 418 transition count 773
Iterating global reduction 2 with 5 rules applied. Total rules applied 100 place count 418 transition count 773
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 418 transition count 772
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 415 transition count 765
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 415 transition count 765
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 412 transition count 757
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 412 transition count 757
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 409 transition count 750
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 409 transition count 750
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 406 transition count 742
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 406 transition count 742
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 128 place count 403 transition count 735
Iterating global reduction 3 with 3 rules applied. Total rules applied 131 place count 403 transition count 735
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 400 transition count 727
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 400 transition count 727
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 397 transition count 720
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 397 transition count 720
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 394 transition count 713
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 394 transition count 713
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 391 transition count 707
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 391 transition count 707
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 388 transition count 702
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 388 transition count 702
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 163 place count 386 transition count 699
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 386 transition count 699
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 385 transition count 698
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 385 transition count 698
Applied a total of 167 rules in 58 ms. Remains 385 /467 variables (removed 82) and now considering 698/879 (removed 181) transitions.
// Phase 1: matrix 698 rows 385 cols
[2024-06-03 00:27:18] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:27:18] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-03 00:27:18] [INFO ] Invariant cache hit.
[2024-06-03 00:27:19] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 697 sub problems to find dead transitions.
[2024-06-03 00:27:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 697 unsolved
[2024-06-03 00:27:27] [INFO ] Deduced a trap composed of 230 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:27:27] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:27:28] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:27:28] [INFO ] Deduced a trap composed of 224 places in 138 ms of which 3 ms to minimize.
[2024-06-03 00:27:28] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:27:29] [INFO ] Deduced a trap composed of 81 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:27:29] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
[2024-06-03 00:27:30] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:27:30] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:27:33] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:27:33] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 697 unsolved
[2024-06-03 00:27:37] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:27:37] [INFO ] Deduced a trap composed of 80 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:27:37] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 697 unsolved
[2024-06-03 00:27:47] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.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 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.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 0.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 0.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 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.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 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 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 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.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 0.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 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 0.0)
(s266 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/1083 variables, and 25 constraints, problems are : Problem set: 0 solved, 697 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/385 constraints, PredecessorRefiner: 697/697 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 697 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 4 (OVERLAPS) 698/1083 variables, 385/410 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1083 variables, 697/1107 constraints. Problems are: Problem set: 0 solved, 697 unsolved
[2024-06-03 00:28:06] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:28:08] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-03 00:28:09] [INFO ] Deduced a trap composed of 219 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1083/1083 variables, and 1110 constraints, problems are : Problem set: 0 solved, 697 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 697/697 constraints, Known Traps: 18/18 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 697 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Starting structural reductions in LTL mode, iteration 1 : 385/467 places, 698/879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60849 ms. Remains : 385/467 places, 698/879 transitions.
[2024-06-03 00:28:19] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:28:19] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:28:19] [INFO ] Input system was already deterministic with 698 transitions.
[2024-06-03 00:28:19] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:28:19] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:28:19] [INFO ] Time to serialize gal into /tmp/CTLFireability3016087427695477788.gal : 2 ms
[2024-06-03 00:28:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5526056452043908799.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/CTLFireability3016087427695477788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5526056452043908799.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-06-03 00:28:49] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:28:49] [INFO ] Applying decomposition
[2024-06-03 00:28:49] [INFO ] Flatten gal took : 15 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/graph14270570294917748368.txt' '-o' '/tmp/graph14270570294917748368.bin' '-w' '/tmp/graph14270570294917748368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14270570294917748368.bin' '-l' '-1' '-v' '-w' '/tmp/graph14270570294917748368.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:28:49] [INFO ] Decomposing Gal with order
[2024-06-03 00:28:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:28:49] [INFO ] Removed a total of 784 redundant transitions.
[2024-06-03 00:28:49] [INFO ] Flatten gal took : 26 ms
[2024-06-03 00:28:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 6 ms.
[2024-06-03 00:28:49] [INFO ] Time to serialize gal into /tmp/CTLFireability12834880685866885956.gal : 4 ms
[2024-06-03 00:28:49] [INFO ] Time to serialize properties into /tmp/CTLFireability9509199877846424099.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/CTLFireability12834880685866885956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9509199877846424099.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 : 467/467 places, 879/879 transitions.
Graph (trivial) has 324 edges and 467 vertex of which 11 / 467 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 458 transition count 815
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 115 place count 404 transition count 809
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 401 transition count 809
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 118 place count 401 transition count 777
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 182 place count 369 transition count 777
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 209 place count 342 transition count 657
Iterating global reduction 3 with 27 rules applied. Total rules applied 236 place count 342 transition count 657
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 240 place count 342 transition count 653
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 241 place count 341 transition count 653
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 241 place count 341 transition count 644
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 259 place count 332 transition count 644
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 276 place count 315 transition count 615
Iterating global reduction 5 with 17 rules applied. Total rules applied 293 place count 315 transition count 615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 295 place count 315 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 296 place count 314 transition count 613
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 302 place count 308 transition count 600
Iterating global reduction 7 with 6 rules applied. Total rules applied 308 place count 308 transition count 600
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 310 place count 308 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 311 place count 307 transition count 598
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 314 place count 304 transition count 591
Iterating global reduction 9 with 3 rules applied. Total rules applied 317 place count 304 transition count 591
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 320 place count 301 transition count 583
Iterating global reduction 9 with 3 rules applied. Total rules applied 323 place count 301 transition count 583
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 326 place count 298 transition count 576
Iterating global reduction 9 with 3 rules applied. Total rules applied 329 place count 298 transition count 576
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 332 place count 295 transition count 568
Iterating global reduction 9 with 3 rules applied. Total rules applied 335 place count 295 transition count 568
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 338 place count 292 transition count 561
Iterating global reduction 9 with 3 rules applied. Total rules applied 341 place count 292 transition count 561
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 344 place count 289 transition count 553
Iterating global reduction 9 with 3 rules applied. Total rules applied 347 place count 289 transition count 553
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 350 place count 286 transition count 546
Iterating global reduction 9 with 3 rules applied. Total rules applied 353 place count 286 transition count 546
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 356 place count 283 transition count 539
Iterating global reduction 9 with 3 rules applied. Total rules applied 359 place count 283 transition count 539
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 362 place count 280 transition count 533
Iterating global reduction 9 with 3 rules applied. Total rules applied 365 place count 280 transition count 533
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 367 place count 278 transition count 529
Iterating global reduction 9 with 2 rules applied. Total rules applied 369 place count 278 transition count 529
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 370 place count 277 transition count 527
Iterating global reduction 9 with 1 rules applied. Total rules applied 371 place count 277 transition count 527
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 409 place count 258 transition count 508
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 411 place count 256 transition count 504
Iterating global reduction 9 with 2 rules applied. Total rules applied 413 place count 256 transition count 504
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 414 place count 255 transition count 503
Applied a total of 414 rules in 91 ms. Remains 255 /467 variables (removed 212) and now considering 503/879 (removed 376) transitions.
[2024-06-03 00:29:19] [INFO ] Flow matrix only has 498 transitions (discarded 5 similar events)
// Phase 1: matrix 498 rows 255 cols
[2024-06-03 00:29:19] [INFO ] Computed 10 invariants in 4 ms
[2024-06-03 00:29:19] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-03 00:29:19] [INFO ] Flow matrix only has 498 transitions (discarded 5 similar events)
[2024-06-03 00:29:19] [INFO ] Invariant cache hit.
[2024-06-03 00:29:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-03 00:29:20] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-06-03 00:29:20] [INFO ] Redundant transitions in 4 ms returned []
Running 490 sub problems to find dead transitions.
[2024-06-03 00:29:20] [INFO ] Flow matrix only has 498 transitions (discarded 5 similar events)
[2024-06-03 00:29:20] [INFO ] Invariant cache hit.
[2024-06-03 00:29:20] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-03 00:29:22] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 0 ms to minimize.
[2024-06-03 00:29:22] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 0 ms to minimize.
[2024-06-03 00:29:23] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:29:23] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 1 ms to minimize.
[2024-06-03 00:29:23] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-06-03 00:29:23] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-06-03 00:29:24] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-03 00:29:24] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:29:24] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-06-03 00:29:25] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-03 00:29:25] [INFO ] Deduced a trap composed of 173 places in 97 ms of which 1 ms to minimize.
[2024-06-03 00:29:25] [INFO ] Deduced a trap composed of 184 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:29:26] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (OVERLAPS) 497/749 variables, 252/275 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/749 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-03 00:29:37] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 7 (OVERLAPS) 3/752 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/753 variables, and 282 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 255/255 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-03 00:29:52] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:29:52] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (OVERLAPS) 497/749 variables, 252/278 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 490/771 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 8 (OVERLAPS) 3/752 variables, 3/774 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 774 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 255/255 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 16/16 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Starting structural reductions in SI_CTL mode, iteration 1 : 255/467 places, 503/879 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60725 ms. Remains : 255/467 places, 503/879 transitions.
[2024-06-03 00:30:20] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:30:20] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:30:20] [INFO ] Input system was already deterministic with 503 transitions.
[2024-06-03 00:30:20] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:30:20] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:30:20] [INFO ] Time to serialize gal into /tmp/CTLFireability17898055822730435729.gal : 2 ms
[2024-06-03 00:30:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7003783856554521240.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/CTLFireability17898055822730435729.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7003783856554521240.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-06-03 00:30:50] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:30:50] [INFO ] Applying decomposition
[2024-06-03 00:30:50] [INFO ] Flatten gal took : 10 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/graph5457676331351025249.txt' '-o' '/tmp/graph5457676331351025249.bin' '-w' '/tmp/graph5457676331351025249.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5457676331351025249.bin' '-l' '-1' '-v' '-w' '/tmp/graph5457676331351025249.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:30:50] [INFO ] Decomposing Gal with order
[2024-06-03 00:30:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:30:50] [INFO ] Removed a total of 622 redundant transitions.
[2024-06-03 00:30:50] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:30:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 5 ms.
[2024-06-03 00:30:50] [INFO ] Time to serialize gal into /tmp/CTLFireability13192203152926770108.gal : 2 ms
[2024-06-03 00:30:50] [INFO ] Time to serialize properties into /tmp/CTLFireability8389890127618051761.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/CTLFireability13192203152926770108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8389890127618051761.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 : 467/467 places, 879/879 transitions.
Graph (trivial) has 317 edges and 467 vertex of which 11 / 467 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 458 transition count 816
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 113 place count 405 transition count 810
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 117 place count 402 transition count 809
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 401 transition count 809
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 118 place count 401 transition count 777
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 182 place count 369 transition count 777
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 208 place count 343 transition count 687
Iterating global reduction 4 with 26 rules applied. Total rules applied 234 place count 343 transition count 687
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 237 place count 343 transition count 684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 342 transition count 684
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 238 place count 342 transition count 676
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 254 place count 334 transition count 676
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 271 place count 317 transition count 647
Iterating global reduction 6 with 17 rules applied. Total rules applied 288 place count 317 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 290 place count 317 transition count 645
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 291 place count 316 transition count 645
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 297 place count 310 transition count 632
Iterating global reduction 8 with 6 rules applied. Total rules applied 303 place count 310 transition count 632
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 305 place count 310 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 306 place count 309 transition count 630
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 309 place count 306 transition count 623
Iterating global reduction 10 with 3 rules applied. Total rules applied 312 place count 306 transition count 623
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 315 place count 303 transition count 615
Iterating global reduction 10 with 3 rules applied. Total rules applied 318 place count 303 transition count 615
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 321 place count 300 transition count 608
Iterating global reduction 10 with 3 rules applied. Total rules applied 324 place count 300 transition count 608
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 327 place count 297 transition count 600
Iterating global reduction 10 with 3 rules applied. Total rules applied 330 place count 297 transition count 600
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 333 place count 294 transition count 593
Iterating global reduction 10 with 3 rules applied. Total rules applied 336 place count 294 transition count 593
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 339 place count 291 transition count 585
Iterating global reduction 10 with 3 rules applied. Total rules applied 342 place count 291 transition count 585
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 345 place count 288 transition count 578
Iterating global reduction 10 with 3 rules applied. Total rules applied 348 place count 288 transition count 578
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 351 place count 285 transition count 571
Iterating global reduction 10 with 3 rules applied. Total rules applied 354 place count 285 transition count 571
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 357 place count 282 transition count 565
Iterating global reduction 10 with 3 rules applied. Total rules applied 360 place count 282 transition count 565
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 362 place count 280 transition count 561
Iterating global reduction 10 with 2 rules applied. Total rules applied 364 place count 280 transition count 561
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 365 place count 279 transition count 559
Iterating global reduction 10 with 1 rules applied. Total rules applied 366 place count 279 transition count 559
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 38 rules applied. Total rules applied 404 place count 260 transition count 540
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 406 place count 258 transition count 536
Iterating global reduction 10 with 2 rules applied. Total rules applied 408 place count 258 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 409 place count 257 transition count 535
Applied a total of 409 rules in 100 ms. Remains 257 /467 variables (removed 210) and now considering 535/879 (removed 344) transitions.
[2024-06-03 00:31:20] [INFO ] Flow matrix only has 530 transitions (discarded 5 similar events)
// Phase 1: matrix 530 rows 257 cols
[2024-06-03 00:31:20] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:31:20] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-03 00:31:20] [INFO ] Flow matrix only has 530 transitions (discarded 5 similar events)
[2024-06-03 00:31:20] [INFO ] Invariant cache hit.
[2024-06-03 00:31:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-03 00:31:21] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-06-03 00:31:21] [INFO ] Redundant transitions in 4 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-03 00:31:21] [INFO ] Flow matrix only has 530 transitions (discarded 5 similar events)
[2024-06-03 00:31:21] [INFO ] Invariant cache hit.
[2024-06-03 00:31:21] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-03 00:31:23] [INFO ] Deduced a trap composed of 54 places in 34 ms of which 1 ms to minimize.
[2024-06-03 00:31:24] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 0 ms to minimize.
[2024-06-03 00:31:24] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:31:24] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:31:24] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-06-03 00:31:25] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:31:25] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-06-03 00:31:25] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:31:25] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-06-03 00:31:26] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-06-03 00:31:26] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-03 00:31:27] [INFO ] Deduced a trap composed of 185 places in 97 ms of which 1 ms to minimize.
[2024-06-03 00:31:27] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 1 ms to minimize.
[2024-06-03 00:31:27] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2024-06-03 00:31:27] [INFO ] Deduced a trap composed of 128 places in 105 ms of which 1 ms to minimize.
[2024-06-03 00:31:27] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-06-03 00:31:27] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:31:28] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-06-03 00:31:28] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 529/783 variables, 254/283 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (OVERLAPS) 3/786 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 522 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 786/787 variables, and 289 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (OVERLAPS) 529/783 variables, 254/283 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/783 variables, 522/808 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/783 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (OVERLAPS) 3/786 variables, 3/811 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/787 variables, and 811 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 257/257 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 19/19 constraints]
After SMT, in 60255ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Starting structural reductions in SI_CTL mode, iteration 1 : 257/467 places, 535/879 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60978 ms. Remains : 257/467 places, 535/879 transitions.
[2024-06-03 00:32:21] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:32:21] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:32:21] [INFO ] Input system was already deterministic with 535 transitions.
[2024-06-03 00:32:21] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:32:21] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:32:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17158681688842316296.gal : 2 ms
[2024-06-03 00:32:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5255381320437709024.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/CTLFireability17158681688842316296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5255381320437709024.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-06-03 00:32:51] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:32:51] [INFO ] Applying decomposition
[2024-06-03 00:32:51] [INFO ] Flatten gal took : 11 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/graph14000320497839779023.txt' '-o' '/tmp/graph14000320497839779023.bin' '-w' '/tmp/graph14000320497839779023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14000320497839779023.bin' '-l' '-1' '-v' '-w' '/tmp/graph14000320497839779023.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:32:51] [INFO ] Decomposing Gal with order
[2024-06-03 00:32:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:32:51] [INFO ] Removed a total of 708 redundant transitions.
[2024-06-03 00:32:51] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:32:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 4 ms.
[2024-06-03 00:32:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11916450656470025359.gal : 3 ms
[2024-06-03 00:32:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1618795733326032508.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/CTLFireability11916450656470025359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1618795733326032508.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 : 467/467 places, 879/879 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 438 transition count 788
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 438 transition count 788
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 438 transition count 786
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 79 place count 419 transition count 752
Iterating global reduction 1 with 19 rules applied. Total rules applied 98 place count 419 transition count 752
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 413 transition count 739
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 413 transition count 739
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 111 place count 413 transition count 738
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 410 transition count 731
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 410 transition count 731
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 407 transition count 723
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 407 transition count 723
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 126 place count 404 transition count 716
Iterating global reduction 2 with 3 rules applied. Total rules applied 129 place count 404 transition count 716
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 401 transition count 708
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 401 transition count 708
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 398 transition count 701
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 398 transition count 701
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 395 transition count 693
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 395 transition count 693
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 392 transition count 686
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 392 transition count 686
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 156 place count 389 transition count 679
Iterating global reduction 2 with 3 rules applied. Total rules applied 159 place count 389 transition count 679
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 162 place count 386 transition count 673
Iterating global reduction 2 with 3 rules applied. Total rules applied 165 place count 386 transition count 673
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 383 transition count 668
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 383 transition count 668
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 173 place count 381 transition count 665
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 381 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 380 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 380 transition count 664
Applied a total of 177 rules in 59 ms. Remains 380 /467 variables (removed 87) and now considering 664/879 (removed 215) transitions.
// Phase 1: matrix 664 rows 380 cols
[2024-06-03 00:33:22] [INFO ] Computed 10 invariants in 9 ms
[2024-06-03 00:33:22] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-03 00:33:22] [INFO ] Invariant cache hit.
[2024-06-03 00:33:22] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 663 sub problems to find dead transitions.
[2024-06-03 00:33:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-03 00:33:30] [INFO ] Deduced a trap composed of 232 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:33:30] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:33:30] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:33:30] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:33:31] [INFO ] Deduced a trap composed of 79 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:33:32] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:33:32] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:33:33] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:33:33] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-03 00:33:37] [INFO ] Deduced a trap composed of 92 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:33:38] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 5 (OVERLAPS) 664/1044 variables, 380/401 constraints. Problems are: Problem set: 0 solved, 663 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 1044/1044 variables, and 401 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 4 (OVERLAPS) 664/1044 variables, 380/401 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1044 variables, 663/1064 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-03 00:34:08] [INFO ] Deduced a trap composed of 127 places in 136 ms of which 2 ms to minimize.
[2024-06-03 00:34:08] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 2 ms to minimize.
[2024-06-03 00:34:10] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:34:10] [INFO ] Deduced a trap composed of 197 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:34:12] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-06-03 00:34:13] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 2 ms to minimize.
[2024-06-03 00:34:13] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:34:13] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:34:13] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 2 ms to minimize.
[2024-06-03 00:34:13] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:34:14] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1044/1044 variables, and 1075 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 22/22 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Starting structural reductions in LTL mode, iteration 1 : 380/467 places, 664/879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60832 ms. Remains : 380/467 places, 664/879 transitions.
[2024-06-03 00:34:22] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:34:22] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:34:22] [INFO ] Input system was already deterministic with 664 transitions.
[2024-06-03 00:34:22] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:34:22] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:34:22] [INFO ] Time to serialize gal into /tmp/CTLFireability11547309943184811951.gal : 2 ms
[2024-06-03 00:34:22] [INFO ] Time to serialize properties into /tmp/CTLFireability13639821178291522303.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/CTLFireability11547309943184811951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13639821178291522303.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 00:34:52] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:34:52] [INFO ] Applying decomposition
[2024-06-03 00:34:52] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2306409284985297628.txt' '-o' '/tmp/graph2306409284985297628.bin' '-w' '/tmp/graph2306409284985297628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2306409284985297628.bin' '-l' '-1' '-v' '-w' '/tmp/graph2306409284985297628.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:34:53] [INFO ] Decomposing Gal with order
[2024-06-03 00:34:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:34:53] [INFO ] Removed a total of 773 redundant transitions.
[2024-06-03 00:34:53] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:34:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 6 ms.
[2024-06-03 00:34:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9625087891791295372.gal : 3 ms
[2024-06-03 00:34:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10692988495230053523.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/CTLFireability9625087891791295372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10692988495230053523.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 : 467/467 places, 879/879 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 441 transition count 848
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 441 transition count 848
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 441 transition count 847
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 72 place count 422 transition count 814
Iterating global reduction 1 with 19 rules applied. Total rules applied 91 place count 422 transition count 814
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 813
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 98 place count 416 transition count 800
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 416 transition count 800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 416 transition count 799
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 413 transition count 792
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 413 transition count 792
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 411 transition count 787
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 411 transition count 787
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 409 transition count 782
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 409 transition count 782
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 408 transition count 779
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 408 transition count 779
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 407 transition count 777
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 407 transition count 777
Applied a total of 123 rules in 37 ms. Remains 407 /467 variables (removed 60) and now considering 777/879 (removed 102) transitions.
// Phase 1: matrix 777 rows 407 cols
[2024-06-03 00:35:23] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:35:23] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-03 00:35:23] [INFO ] Invariant cache hit.
[2024-06-03 00:35:23] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 776 sub problems to find dead transitions.
[2024-06-03 00:35:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 776 unsolved
At refinement iteration 1 (OVERLAPS) 1/407 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 776 unsolved
[2024-06-03 00:35:33] [INFO ] Deduced a trap composed of 262 places in 146 ms of which 3 ms to minimize.
[2024-06-03 00:35:33] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 2 ms to minimize.
[2024-06-03 00:35:33] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:35:33] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 0 ms to minimize.
[2024-06-03 00:35:33] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:35:34] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:35:34] [INFO ] Deduced a trap composed of 99 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:35:35] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:35:35] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:35:35] [INFO ] Deduced a trap composed of 89 places in 47 ms of which 0 ms to minimize.
[2024-06-03 00:35:36] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-06-03 00:35:36] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 776 unsolved
[2024-06-03 00:35:42] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 776 unsolved
[2024-06-03 00:35:53] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/1184 variables, and 24 constraints, problems are : Problem set: 0 solved, 776 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/407 constraints, PredecessorRefiner: 776/776 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 776 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 776 unsolved
At refinement iteration 1 (OVERLAPS) 1/407 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 776 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 776 unsolved
[2024-06-03 00:35:58] [INFO ] Deduced a trap composed of 251 places in 140 ms of which 2 ms to minimize.
[2024-06-03 00:35:59] [INFO ] Deduced a trap composed of 216 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:36:00] [INFO ] Deduced a trap composed of 233 places in 149 ms of which 2 ms to minimize.
[2024-06-03 00:36:00] [INFO ] Deduced a trap composed of 230 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:36:01] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 229 places in 143 ms of which 2 ms to minimize.
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 228 places in 149 ms of which 2 ms to minimize.
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 234 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 230 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:36:02] [INFO ] Deduced a trap composed of 230 places in 136 ms of which 3 ms to minimize.
[2024-06-03 00:36:03] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:36:03] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:36:03] [INFO ] Deduced a trap composed of 243 places in 133 ms of which 2 ms to minimize.
[2024-06-03 00:36:03] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 3 ms to minimize.
[2024-06-03 00:36:04] [INFO ] Deduced a trap composed of 229 places in 138 ms of which 2 ms to minimize.
[2024-06-03 00:36:04] [INFO ] Deduced a trap composed of 232 places in 130 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 776 unsolved
[2024-06-03 00:36:09] [INFO ] Deduced a trap composed of 242 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:36:09] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:36:09] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-06-03 00:36:09] [INFO ] Deduced a trap composed of 233 places in 126 ms of which 2 ms to minimize.
[2024-06-03 00:36:09] [INFO ] Deduced a trap composed of 231 places in 132 ms of which 2 ms to minimize.
[2024-06-03 00:36:09] [INFO ] Deduced a trap composed of 231 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 776 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/1184 variables, and 46 constraints, problems are : Problem set: 0 solved, 776 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/407 constraints, PredecessorRefiner: 0/776 constraints, Known Traps: 36/36 constraints]
After SMT, in 60373ms problems are : Problem set: 0 solved, 776 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Starting structural reductions in LTL mode, iteration 1 : 407/467 places, 777/879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60942 ms. Remains : 407/467 places, 777/879 transitions.
[2024-06-03 00:36:24] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:36:24] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:36:24] [INFO ] Input system was already deterministic with 777 transitions.
[2024-06-03 00:36:24] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:36:24] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:36:24] [INFO ] Time to serialize gal into /tmp/CTLFireability17443061088288080670.gal : 3 ms
[2024-06-03 00:36:24] [INFO ] Time to serialize properties into /tmp/CTLFireability1555034349728463955.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/CTLFireability17443061088288080670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1555034349728463955.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-06-03 00:36:54] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:36:54] [INFO ] Applying decomposition
[2024-06-03 00:36:54] [INFO ] Flatten gal took : 16 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/graph18419527774041422241.txt' '-o' '/tmp/graph18419527774041422241.bin' '-w' '/tmp/graph18419527774041422241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18419527774041422241.bin' '-l' '-1' '-v' '-w' '/tmp/graph18419527774041422241.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:36:54] [INFO ] Decomposing Gal with order
[2024-06-03 00:36:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:36:54] [INFO ] Removed a total of 902 redundant transitions.
[2024-06-03 00:36:54] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:36:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 6 ms.
[2024-06-03 00:36:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2565014120035771164.gal : 4 ms
[2024-06-03 00:36:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7543706280600267499.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/CTLFireability2565014120035771164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7543706280600267499.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 : 467/467 places, 879/879 transitions.
Graph (trivial) has 321 edges and 467 vertex of which 11 / 467 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 458 transition count 816
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 59 rules applied. Total rules applied 113 place count 405 transition count 810
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 402 transition count 810
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 116 place count 402 transition count 778
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 180 place count 370 transition count 778
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 205 place count 345 transition count 689
Iterating global reduction 3 with 25 rules applied. Total rules applied 230 place count 345 transition count 689
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 232 place count 345 transition count 687
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 232 place count 345 transition count 679
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 248 place count 337 transition count 679
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 265 place count 320 transition count 650
Iterating global reduction 4 with 17 rules applied. Total rules applied 282 place count 320 transition count 650
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 284 place count 320 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 285 place count 319 transition count 648
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 291 place count 313 transition count 635
Iterating global reduction 6 with 6 rules applied. Total rules applied 297 place count 313 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 299 place count 313 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 300 place count 312 transition count 633
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 303 place count 309 transition count 626
Iterating global reduction 8 with 3 rules applied. Total rules applied 306 place count 309 transition count 626
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 309 place count 306 transition count 618
Iterating global reduction 8 with 3 rules applied. Total rules applied 312 place count 306 transition count 618
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 315 place count 303 transition count 611
Iterating global reduction 8 with 3 rules applied. Total rules applied 318 place count 303 transition count 611
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 321 place count 300 transition count 603
Iterating global reduction 8 with 3 rules applied. Total rules applied 324 place count 300 transition count 603
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 327 place count 297 transition count 596
Iterating global reduction 8 with 3 rules applied. Total rules applied 330 place count 297 transition count 596
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 333 place count 294 transition count 588
Iterating global reduction 8 with 3 rules applied. Total rules applied 336 place count 294 transition count 588
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 339 place count 291 transition count 581
Iterating global reduction 8 with 3 rules applied. Total rules applied 342 place count 291 transition count 581
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 345 place count 288 transition count 574
Iterating global reduction 8 with 3 rules applied. Total rules applied 348 place count 288 transition count 574
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 351 place count 285 transition count 568
Iterating global reduction 8 with 3 rules applied. Total rules applied 354 place count 285 transition count 568
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 356 place count 283 transition count 564
Iterating global reduction 8 with 2 rules applied. Total rules applied 358 place count 283 transition count 564
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 359 place count 282 transition count 562
Iterating global reduction 8 with 1 rules applied. Total rules applied 360 place count 282 transition count 562
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 398 place count 263 transition count 543
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 400 place count 261 transition count 539
Iterating global reduction 8 with 2 rules applied. Total rules applied 402 place count 261 transition count 539
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 403 place count 261 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 404 place count 260 transition count 538
Applied a total of 404 rules in 87 ms. Remains 260 /467 variables (removed 207) and now considering 538/879 (removed 341) transitions.
[2024-06-03 00:37:24] [INFO ] Flow matrix only has 533 transitions (discarded 5 similar events)
// Phase 1: matrix 533 rows 260 cols
[2024-06-03 00:37:24] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:37:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-03 00:37:24] [INFO ] Flow matrix only has 533 transitions (discarded 5 similar events)
[2024-06-03 00:37:24] [INFO ] Invariant cache hit.
[2024-06-03 00:37:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-03 00:37:25] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-06-03 00:37:25] [INFO ] Redundant transitions in 4 ms returned []
Running 524 sub problems to find dead transitions.
[2024-06-03 00:37:25] [INFO ] Flow matrix only has 533 transitions (discarded 5 similar events)
[2024-06-03 00:37:25] [INFO ] Invariant cache hit.
[2024-06-03 00:37:25] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-03 00:37:27] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:37:28] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 1 ms to minimize.
[2024-06-03 00:37:28] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 1 ms to minimize.
[2024-06-03 00:37:28] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-06-03 00:37:28] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-06-03 00:37:28] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2024-06-03 00:37:28] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:37:30] [INFO ] Deduced a trap composed of 188 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:37:30] [INFO ] Deduced a trap composed of 187 places in 91 ms of which 1 ms to minimize.
[2024-06-03 00:37:30] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-06-03 00:37:31] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 1 ms to minimize.
[2024-06-03 00:37:31] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:37:31] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-03 00:37:34] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-06-03 00:37:34] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-03 00:37:35] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 1/257 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-03 00:37:41] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (OVERLAPS) 532/789 variables, 257/284 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-03 00:37:54] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-06-03 00:37:54] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-06-03 00:37:54] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 1 ms to minimize.
[2024-06-03 00:37:54] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 789/793 variables, and 291 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 257/260 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (OVERLAPS) 1/257 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 532/789 variables, 257/288 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/789 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 524/815 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/789 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 10 (OVERLAPS) 3/792 variables, 3/818 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 792/793 variables, and 818 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 260/260 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 21/21 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Starting structural reductions in SI_CTL mode, iteration 1 : 260/467 places, 538/879 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60879 ms. Remains : 260/467 places, 538/879 transitions.
[2024-06-03 00:38:25] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:38:25] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:38:25] [INFO ] Input system was already deterministic with 538 transitions.
[2024-06-03 00:38:25] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:38:25] [INFO ] Flatten gal took : 10 ms
[2024-06-03 00:38:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12157974131064890046.gal : 2 ms
[2024-06-03 00:38:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6190868177075138458.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/CTLFireability12157974131064890046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6190868177075138458.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-06-03 00:38:55] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:38:55] [INFO ] Applying decomposition
[2024-06-03 00:38:55] [INFO ] Flatten gal took : 11 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/graph7871475565425589665.txt' '-o' '/tmp/graph7871475565425589665.bin' '-w' '/tmp/graph7871475565425589665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7871475565425589665.bin' '-l' '-1' '-v' '-w' '/tmp/graph7871475565425589665.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:38:55] [INFO ] Decomposing Gal with order
[2024-06-03 00:38:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:38:55] [INFO ] Removed a total of 707 redundant transitions.
[2024-06-03 00:38:55] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:38:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 4 ms.
[2024-06-03 00:38:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8245336574156024344.gal : 2 ms
[2024-06-03 00:38:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10401384041346571370.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/CTLFireability8245336574156024344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10401384041346571370.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 : 467/467 places, 879/879 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 438 transition count 758
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 438 transition count 758
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 438 transition count 756
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 78 place count 420 transition count 724
Iterating global reduction 1 with 18 rules applied. Total rules applied 96 place count 420 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 97 place count 420 transition count 723
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 416 transition count 715
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 416 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 416 transition count 714
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 414 transition count 709
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 414 transition count 709
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 412 transition count 704
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 412 transition count 704
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 410 transition count 699
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 410 transition count 699
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 408 transition count 694
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 408 transition count 694
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 406 transition count 689
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 406 transition count 689
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 404 transition count 684
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 404 transition count 684
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 402 transition count 679
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 402 transition count 679
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 400 transition count 675
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 400 transition count 675
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 398 transition count 671
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 398 transition count 671
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 396 transition count 668
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 396 transition count 668
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 395 transition count 667
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 395 transition count 667
Applied a total of 148 rules in 53 ms. Remains 395 /467 variables (removed 72) and now considering 667/879 (removed 212) transitions.
// Phase 1: matrix 667 rows 395 cols
[2024-06-03 00:39:25] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:39:25] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-03 00:39:25] [INFO ] Invariant cache hit.
[2024-06-03 00:39:26] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 666 sub problems to find dead transitions.
[2024-06-03 00:39:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-03 00:39:34] [INFO ] Deduced a trap composed of 250 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:39:34] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
[2024-06-03 00:39:34] [INFO ] Deduced a trap composed of 224 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:39:34] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 0 ms to minimize.
[2024-06-03 00:39:35] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:39:35] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:39:35] [INFO ] Deduced a trap composed of 89 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:39:36] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:39:36] [INFO ] Deduced a trap composed of 94 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:39:37] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:39:37] [INFO ] Deduced a trap composed of 79 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-03 00:39:40] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 3 ms to minimize.
[2024-06-03 00:39:40] [INFO ] Deduced a trap composed of 235 places in 121 ms of which 2 ms to minimize.
[2024-06-03 00:39:41] [INFO ] Deduced a trap composed of 234 places in 119 ms of which 2 ms to minimize.
[2024-06-03 00:39:41] [INFO ] Deduced a trap composed of 225 places in 113 ms of which 2 ms to minimize.
[2024-06-03 00:39:41] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 3 ms to minimize.
[2024-06-03 00:39:41] [INFO ] Deduced a trap composed of 231 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:39:42] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:39:42] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:39:42] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 2 ms to minimize.
[2024-06-03 00:39:42] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 2 ms to minimize.
[2024-06-03 00:39:43] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:39:44] [INFO ] Deduced a trap composed of 116 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-03 00:39:52] [INFO ] Deduced a trap composed of 230 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:39:54] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.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 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.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 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 395/1062 variables, and 35 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/395 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-03 00:40:00] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-06-03 00:40:01] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:40:01] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-06-03 00:40:02] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 3 ms to minimize.
[2024-06-03 00:40:02] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 2 ms to minimize.
[2024-06-03 00:40:02] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 5 (OVERLAPS) 667/1062 variables, 395/436 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1062 variables, 666/1102 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-06-03 00:40:21] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1062/1062 variables, and 1103 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 395/395 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 32/32 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Starting structural reductions in LTL mode, iteration 1 : 395/467 places, 667/879 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60785 ms. Remains : 395/467 places, 667/879 transitions.
[2024-06-03 00:40:26] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:40:26] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:40:26] [INFO ] Input system was already deterministic with 667 transitions.
[2024-06-03 00:40:26] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:40:26] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:40:26] [INFO ] Time to serialize gal into /tmp/CTLFireability14293551913285136856.gal : 2 ms
[2024-06-03 00:40:26] [INFO ] Time to serialize properties into /tmp/CTLFireability18383933979380296390.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/CTLFireability14293551913285136856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18383933979380296390.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-03 00:40:56] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:40:56] [INFO ] Applying decomposition
[2024-06-03 00:40:56] [INFO ] Flatten gal took : 13 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/graph11947942707586777070.txt' '-o' '/tmp/graph11947942707586777070.bin' '-w' '/tmp/graph11947942707586777070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11947942707586777070.bin' '-l' '-1' '-v' '-w' '/tmp/graph11947942707586777070.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:40:56] [INFO ] Decomposing Gal with order
[2024-06-03 00:40:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:40:56] [INFO ] Removed a total of 727 redundant transitions.
[2024-06-03 00:40:56] [INFO ] Flatten gal took : 28 ms
[2024-06-03 00:40:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 6 ms.
[2024-06-03 00:40:56] [INFO ] Time to serialize gal into /tmp/CTLFireability6792753562077493363.gal : 4 ms
[2024-06-03 00:40:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9413456151341857221.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/CTLFireability6792753562077493363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9413456151341857221.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.
[2024-06-03 00:41:26] [INFO ] Flatten gal took : 22 ms
[2024-06-03 00:41:26] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:41:26] [INFO ] Applying decomposition
[2024-06-03 00:41:26] [INFO ] Flatten gal took : 19 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/graph17852731232175215464.txt' '-o' '/tmp/graph17852731232175215464.bin' '-w' '/tmp/graph17852731232175215464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17852731232175215464.bin' '-l' '-1' '-v' '-w' '/tmp/graph17852731232175215464.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:41:26] [INFO ] Decomposing Gal with order
[2024-06-03 00:41:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:41:26] [INFO ] Removed a total of 1012 redundant transitions.
[2024-06-03 00:41:26] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:41:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 4 ms.
[2024-06-03 00:41:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5601127295686075951.gal : 4 ms
[2024-06-03 00:41:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9016442458085260692.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/CTLFireability5601127295686075951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9016442458085260692.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 16 CTL formulae.
ITS-tools command line returned an error code 137
[2024-06-03 00:51:32] [INFO ] Applying decomposition
[2024-06-03 00:51:32] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:51:32] [INFO ] Decomposing Gal with order
[2024-06-03 00:51:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:51:32] [INFO ] Removed a total of 817 redundant transitions.
[2024-06-03 00:51:32] [INFO ] Flatten gal took : 46 ms
[2024-06-03 00:51:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 649 labels/synchronizations in 10 ms.
[2024-06-03 00:51:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7983524683872698541.gal : 6 ms
[2024-06-03 00:51:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3112407444932783969.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/CTLFireability7983524683872698541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3112407444932783969.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 16 CTL formulae.
ITS-tools command line returned an error code 137
[2024-06-03 01:02:01] [INFO ] Flatten gal took : 22 ms
[2024-06-03 01:02:01] [INFO ] Input system was already deterministic with 879 transitions.
[2024-06-03 01:02:01] [INFO ] Transformed 467 places.
[2024-06-03 01:02:01] [INFO ] Transformed 879 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-03 01:02:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8347098734822241445.gal : 3 ms
[2024-06-03 01:02:01] [INFO ] Time to serialize properties into /tmp/CTLFireability17064405730130899768.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/CTLFireability8347098734822241445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17064405730130899768.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 16 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../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
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-20, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734899100322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;