About the Execution of ITS-Tools for DES-PT-05b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.964 | 3206255.00 | 3332745.00 | 9615.10 | ???????T?T?????? | normal |
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.r092-tall-171624189700658.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 DES-PT-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189700658
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 08:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-05b-CTLFireability-2024-00
FORMULA_NAME DES-PT-05b-CTLFireability-2024-01
FORMULA_NAME DES-PT-05b-CTLFireability-2024-02
FORMULA_NAME DES-PT-05b-CTLFireability-2024-03
FORMULA_NAME DES-PT-05b-CTLFireability-2024-04
FORMULA_NAME DES-PT-05b-CTLFireability-2024-05
FORMULA_NAME DES-PT-05b-CTLFireability-2024-06
FORMULA_NAME DES-PT-05b-CTLFireability-2024-07
FORMULA_NAME DES-PT-05b-CTLFireability-2024-08
FORMULA_NAME DES-PT-05b-CTLFireability-2024-09
FORMULA_NAME DES-PT-05b-CTLFireability-2024-10
FORMULA_NAME DES-PT-05b-CTLFireability-2024-11
FORMULA_NAME DES-PT-05b-CTLFireability-2023-12
FORMULA_NAME DES-PT-05b-CTLFireability-2023-13
FORMULA_NAME DES-PT-05b-CTLFireability-2023-14
FORMULA_NAME DES-PT-05b-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716340432921
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 01:13:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 01:13:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:13:54] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-22 01:13:54] [INFO ] Transformed 300 places.
[2024-05-22 01:13:54] [INFO ] Transformed 251 transitions.
[2024-05-22 01:13:54] [INFO ] Found NUPN structural information;
[2024-05-22 01:13:54] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 165 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 297 transition count 251
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 289 transition count 243
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 289 transition count 243
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 286 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 286 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 286 transition count 239
Applied a total of 26 rules in 54 ms. Remains 286 /300 variables (removed 14) and now considering 239/251 (removed 12) transitions.
// Phase 1: matrix 239 rows 286 cols
[2024-05-22 01:13:54] [INFO ] Computed 62 invariants in 24 ms
[2024-05-22 01:13:54] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-22 01:13:54] [INFO ] Invariant cache hit.
[2024-05-22 01:13:54] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-05-22 01:13:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/286 variables, 32/47 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 239/525 variables, 286/348 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:13:59] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 16 ms to minimize.
[2024-05-22 01:13:59] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-22 01:13:59] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 3 ms to minimize.
[2024-05-22 01:13:59] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-22 01:13:59] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:13:59] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-05-22 01:13:59] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:13:59] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:14:00] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:14:00] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:14:00] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:14:00] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:14:00] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:14:00] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:14:00] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:14:01] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:14:01] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:14:01] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 18/366 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:05] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:14:05] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-22 01:14:05] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-22 01:14:05] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:14:05] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/525 variables, 5/371 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:07] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:14:07] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:14:07] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:14:08] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:14:08] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-22 01:14:08] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:14:08] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:14:08] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 8/379 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:13] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:14:13] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/525 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:14] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-22 01:14:15] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:19] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/525 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:21] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:14:21] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:14:22] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:14:22] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 388 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (OVERLAPS) 1/286 variables, 32/47 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 40/102 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:26] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:14:26] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:14:26] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:14:26] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:14:26] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-05-22 01:14:27] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-22 01:14:27] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:28] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:30] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:31] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:32] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-22 01:14:32] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-22 01:14:33] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:14:33] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:34] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:14:34] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:14:34] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:36] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (OVERLAPS) 239/525 variables, 286/406 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 238/644 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-05-22 01:14:45] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-22 01:14:45] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:14:45] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:14:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 4/648 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 648 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 62/62 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 286/300 places, 239/251 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60768 ms. Remains : 286/300 places, 239/251 transitions.
Support contains 165 out of 286 places after structural reductions.
[2024-05-22 01:14:55] [INFO ] Flatten gal took : 41 ms
[2024-05-22 01:14:55] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:14:55] [INFO ] Input system was already deterministic with 239 transitions.
Support contains 162 out of 286 places (down from 165) after GAL structural reductions.
RANDOM walk for 40000 steps (340 resets) in 1996 ms. (20 steps per ms) remains 9/103 properties
BEST_FIRST walk for 40004 steps (47 resets) in 265 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 135 ms. (294 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (50 resets) in 150 ms. (264 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (43 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (40 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (47 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (52 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (56 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
[2024-05-22 01:14:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 77/98 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 77/175 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 01:14:56] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:14:56] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-22 01:14:56] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-22 01:14:56] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-22 01:14:56] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 6 (OVERLAPS) 88/263 variables, 27/64 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-22 01:14:56] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:14:56] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:14:57] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:14:57] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 4/68 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/68 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/268 variables, 3/71 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp88 is UNSAT
At refinement iteration 11 (OVERLAPS) 223/491 variables, 268/339 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-22 01:14:57] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 01:14:57] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:14:57] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 3/342 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 0/342 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 20/511 variables, 11/353 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/511 variables, 0/353 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 6/517 variables, 3/356 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-22 01:14:57] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:14:57] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 2/358 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/358 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/521 variables, 2/360 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/521 variables, 0/360 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 4/525 variables, 2/362 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/525 variables, 0/362 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/525 variables, 0/362 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 362 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1394 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/54 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 117/171 variables, 23/32 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 5/37 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-22 01:14:58] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 1/38 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/38 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 91/262 variables, 27/65 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 4/69 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-22 01:14:58] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:14:58] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:14:58] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2024-05-22 01:14:58] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 4/73 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-22 01:14:58] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 1/74 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/74 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/267 variables, 3/77 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/77 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 223/490 variables, 267/344 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 4/348 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-22 01:14:58] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/490 variables, 1/349 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 0/349 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 21/511 variables, 12/361 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/511 variables, 5/366 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 0/366 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 6/517 variables, 3/369 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/517 variables, 0/369 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 4/521 variables, 2/371 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/521 variables, 0/371 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 4/525 variables, 2/373 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/525 variables, 0/373 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/525 variables, 0/373 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 373 constraints, problems are : Problem set: 3 solved, 4 unsolved in 1978 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 21/21 constraints]
After SMT, in 3383ms problems are : Problem set: 3 solved, 4 unsolved
Parikh walk visited 0 properties in 4408 ms.
Support contains 12 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 282 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 282 transition count 218
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 267 transition count 218
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 267 transition count 208
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 257 transition count 208
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 241 transition count 192
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 241 transition count 192
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 2 with 2 rules applied. Total rules applied 87 place count 241 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 240 transition count 190
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 100 place count 228 transition count 178
Iterating global reduction 4 with 12 rules applied. Total rules applied 112 place count 228 transition count 178
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 12 rules applied. Total rules applied 124 place count 228 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 126 place count 227 transition count 165
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 126 place count 227 transition count 162
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 132 place count 224 transition count 162
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 274 place count 153 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 278 place count 151 transition count 93
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 279 place count 151 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 280 place count 150 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 281 place count 149 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 282 place count 148 transition count 91
Applied a total of 282 rules in 78 ms. Remains 148 /286 variables (removed 138) and now considering 91/239 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 148/286 places, 91/239 transitions.
RANDOM walk for 40000 steps (1489 resets) in 758 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (266 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (269 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (251 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (272 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 901670 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :0 out of 4
Probabilistic random walk after 901670 steps, saw 127286 distinct states, run finished after 3011 ms. (steps per millisecond=299 ) properties seen :0
// Phase 1: matrix 91 rows 148 cols
[2024-05-22 01:15:07] [INFO ] Computed 63 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 36/77 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 01:15:07] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-22 01:15:07] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/127 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/134 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/136 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 87/223 variables, 136/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 01:15:07] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-22 01:15:08] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-22 01:15:08] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-22 01:15:08] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:15:08] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/237 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/237 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/237 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/239 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/239 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/239 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/239 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 218 constraints, problems are : Problem set: 0 solved, 4 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 36/77 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 01:15:08] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 50/127 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 7/134 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/136 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 87/223 variables, 136/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 01:15:08] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-22 01:15:08] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/223 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/223 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 14/237 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/237 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/237 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/239 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/239 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/239 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/239 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 225 constraints, problems are : Problem set: 0 solved, 4 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 1002ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1288 ms.
Support contains 12 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 91/91 transitions.
Applied a total of 0 rules in 15 ms. Remains 148 /148 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 148/148 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-22 01:15:10] [INFO ] Invariant cache hit.
[2024-05-22 01:15:10] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-22 01:15:10] [INFO ] Invariant cache hit.
[2024-05-22 01:15:10] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-22 01:15:10] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-22 01:15:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 1/146 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 2/148 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 91/239 variables, 148/211 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-22 01:15:11] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-22 01:15:11] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-22 01:15:11] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-22 01:15:11] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-22 01:15:11] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 5/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-22 01:15:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:15:12] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-22 01:15:12] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/239 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 13 (OVERLAPS) 0/239 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 219 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3530 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 1/146 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 2/148 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 91/239 variables, 148/219 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 88/307 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-22 01:15:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 01:15:16] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-22 01:15:16] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-22 01:15:16] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-22 01:15:18] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-22 01:15:18] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-22 01:15:19] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-22 01:15:19] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 16 (OVERLAPS) 0/239 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 315 constraints, problems are : Problem set: 0 solved, 88 unsolved in 13978 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 16/16 constraints]
After SMT, in 17527ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 17528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17757 ms. Remains : 148/148 places, 91/91 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-22 01:15:27] [INFO ] Invariant cache hit.
[2024-05-22 01:15:27] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:15:27] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 22 ms returned sat
[2024-05-22 01:15:27] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:15:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:15:28] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 6 ms returned sat
[2024-05-22 01:15:28] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 01:15:28] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:15:28] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-22 01:15:28] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-22 01:15:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 100 ms
TRAPS : Iteration 1
[2024-05-22 01:15:28] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 01:15:28] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 510 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-22 01:15:28] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:15:28] [INFO ] Flatten gal took : 16 ms
[2024-05-22 01:15:28] [INFO ] Input system was already deterministic with 239 transitions.
Computed a total of 82 stabilizing places and 74 stable transitions
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 269 transition count 222
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 269 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 269 transition count 221
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 47 place count 257 transition count 209
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 257 transition count 209
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 69 place count 257 transition count 199
Applied a total of 69 rules in 21 ms. Remains 257 /286 variables (removed 29) and now considering 199/239 (removed 40) transitions.
// Phase 1: matrix 199 rows 257 cols
[2024-05-22 01:15:28] [INFO ] Computed 62 invariants in 4 ms
[2024-05-22 01:15:28] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-22 01:15:28] [INFO ] Invariant cache hit.
[2024-05-22 01:15:28] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 319 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 256/286 places, 199/239 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 345 ms. Remains : 256/286 places, 199/239 transitions.
[2024-05-22 01:15:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:15:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:15:28] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-22 01:15:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:15:28] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:15:28] [INFO ] Time to serialize gal into /tmp/CTLFireability16881622108417532099.gal : 5 ms
[2024-05-22 01:15:28] [INFO ] Time to serialize properties into /tmp/CTLFireability2548715262202827629.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/CTLFireability16881622108417532099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2548715262202827629.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:15:58] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:15:58] [INFO ] Applying decomposition
[2024-05-22 01:15:58] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1444648033177781936.txt' '-o' '/tmp/graph1444648033177781936.bin' '-w' '/tmp/graph1444648033177781936.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1444648033177781936.bin' '-l' '-1' '-v' '-w' '/tmp/graph1444648033177781936.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:15:59] [INFO ] Decomposing Gal with order
[2024-05-22 01:15:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:15:59] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:15:59] [INFO ] Flatten gal took : 42 ms
[2024-05-22 01:15:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2024-05-22 01:15:59] [INFO ] Time to serialize gal into /tmp/CTLFireability4244001852587275357.gal : 6 ms
[2024-05-22 01:15:59] [INFO ] Time to serialize properties into /tmp/CTLFireability18084786144418562706.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/CTLFireability4244001852587275357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18084786144418562706.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.94021e+18,2.56302,83096,4598,243,181231,1435,723,190404,117,4874,0
Converting to forward existential form...Done !
original formula: A(AG(!(((E((i3.i1.u22.p101==1) U ((i5.u35.p153==1)&&(i5.u35.p155==1))) + ((i0.u7.p49==1) * AF((i8.i1.u53.p211==1)))) * EF((i0.u5.p35!=1))...431
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!((E(!(!(!(EG(!(((i3.i1.u24.p105==1)&&(i2.i0.u32.p146==1))))))) U (!(EG(!(EX(!((i3.i0.u2...3443
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t147, t160, t161, t193, i0.t123, i0.u6.t128, i0.u6.t129, i0.u7.t125, i0.u7.t126...769
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 268 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 268 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 268 transition count 220
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 256 transition count 208
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 256 transition count 208
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 256 transition count 198
Applied a total of 71 rules in 14 ms. Remains 256 /286 variables (removed 30) and now considering 198/239 (removed 41) transitions.
// Phase 1: matrix 198 rows 256 cols
[2024-05-22 01:16:29] [INFO ] Computed 62 invariants in 2 ms
[2024-05-22 01:16:29] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 01:16:29] [INFO ] Invariant cache hit.
[2024-05-22 01:16:29] [INFO ] Implicit Places using invariants and state equation in 236 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 384 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/286 places, 198/239 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 402 ms. Remains : 255/286 places, 198/239 transitions.
[2024-05-22 01:16:29] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:16:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:16:29] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-22 01:16:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:16:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:16:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10891351173512250235.gal : 2 ms
[2024-05-22 01:16:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10074208011775136800.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/CTLFireability10891351173512250235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10074208011775136800.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-05-22 01:16:59] [INFO ] Flatten gal took : 24 ms
[2024-05-22 01:16:59] [INFO ] Applying decomposition
[2024-05-22 01:16:59] [INFO ] Flatten gal took : 7 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/graph12728701469174772916.txt' '-o' '/tmp/graph12728701469174772916.bin' '-w' '/tmp/graph12728701469174772916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12728701469174772916.bin' '-l' '-1' '-v' '-w' '/tmp/graph12728701469174772916.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:16:59] [INFO ] Decomposing Gal with order
[2024-05-22 01:16:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:16:59] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 01:16:59] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:16:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 01:16:59] [INFO ] Time to serialize gal into /tmp/CTLFireability13495420388047600021.gal : 10 ms
[2024-05-22 01:16:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5446333271434171634.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/CTLFireability13495420388047600021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5446333271434171634.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.46395e+18,1.53204,56392,4126,221,123298,1138,691,157350,118,3589,0
Converting to forward existential form...Done !
original formula: EG(A(((!(AF(((i8.u75.p288==1)&&(i12.u78.p298==1)))) + (i10.i0.u43.p169==1)) + ((i6.u2.p5==1)&&(i6.u37.p151==1))) U (EX(((i7.i0.u61.p228==...280
=> equivalent forward existential formula: [FwdG(Init,!((E(!((EX(((i7.i0.u61.p228==1)||(i1.u3.p29!=1))) * !((E(!(!((((i8.u75.p288==1)&&(i12.u78.p298==1))&&...1209
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t58, t87, t146, t159, t160, t192, i0.u34.t79, i1.u14.t109, i2.t122, i2.u6.t127, i2.u...736
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 278 transition count 221
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 265 transition count 221
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 265 transition count 211
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 255 transition count 211
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 61 place count 241 transition count 197
Iterating global reduction 2 with 14 rules applied. Total rules applied 75 place count 241 transition count 197
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 2 with 2 rules applied. Total rules applied 77 place count 241 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 240 transition count 195
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 87 place count 231 transition count 186
Iterating global reduction 4 with 9 rules applied. Total rules applied 96 place count 231 transition count 186
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 10 rules applied. Total rules applied 106 place count 231 transition count 176
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 108 place count 230 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 108 place count 230 transition count 174
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 110 place count 229 transition count 174
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 6 with 136 rules applied. Total rules applied 246 place count 161 transition count 106
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 161 transition count 106
Applied a total of 248 rules in 53 ms. Remains 161 /286 variables (removed 125) and now considering 106/239 (removed 133) transitions.
// Phase 1: matrix 106 rows 161 cols
[2024-05-22 01:17:29] [INFO ] Computed 59 invariants in 1 ms
[2024-05-22 01:17:30] [INFO ] Implicit Places using invariants in 85 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 160/286 places, 106/239 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 143 ms. Remains : 160/286 places, 106/239 transitions.
[2024-05-22 01:17:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:17:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:17:30] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-22 01:17:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:17:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:17:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7969184462918430362.gal : 1 ms
[2024-05-22 01:17:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1300550056961418302.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/CTLFireability7969184462918430362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1300550056961418302.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:18:00] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:18:00] [INFO ] Applying decomposition
[2024-05-22 01:18:00] [INFO ] Flatten gal took : 5 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/graph10492806062509515828.txt' '-o' '/tmp/graph10492806062509515828.bin' '-w' '/tmp/graph10492806062509515828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10492806062509515828.bin' '-l' '-1' '-v' '-w' '/tmp/graph10492806062509515828.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:18:00] [INFO ] Decomposing Gal with order
[2024-05-22 01:18:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:18:00] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-22 01:18:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:18:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 01:18:00] [INFO ] Time to serialize gal into /tmp/CTLFireability2487399409219590421.gal : 1 ms
[2024-05-22 01:18:00] [INFO ] Time to serialize properties into /tmp/CTLFireability12130262365086958230.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/CTLFireability2487399409219590421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12130262365086958230.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.59978e+13,1.12028,41964,4661,229,107590,1057,452,63171,116,3434,0
Converting to forward existential form...Done !
original formula: AG(E(E((EF((i8.i3.u34.p233==1)) + ((i1.i1.u11.p127!=1)&&((u14.p1==1)||((i1.i0.u7.p97==1)&&(i2.u9.p118==1))))) U ((i11.u4.p71==1)&&(i11.u4...191
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E((E(TRUE U (i8.i3.u34.p233==1)) + ((i1.i1.u11.p127!=1)&&((u14.p1==1)||((i1.i0.u7.p97==1...251
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t28, t69, t70, t73, t90, t91, t97, u14.t26, u15.t74, u48.t2, u48.t99, i0.t13, i0.u2.t...368
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 270 transition count 223
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 270 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 270 transition count 222
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 44 place count 259 transition count 211
Iterating global reduction 1 with 11 rules applied. Total rules applied 55 place count 259 transition count 211
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 65 place count 259 transition count 201
Applied a total of 65 rules in 7 ms. Remains 259 /286 variables (removed 27) and now considering 201/239 (removed 38) transitions.
// Phase 1: matrix 201 rows 259 cols
[2024-05-22 01:18:30] [INFO ] Computed 62 invariants in 4 ms
[2024-05-22 01:18:30] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 01:18:30] [INFO ] Invariant cache hit.
[2024-05-22 01:18:30] [INFO ] Implicit Places using invariants and state equation in 200 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 307 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/286 places, 201/239 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 316 ms. Remains : 258/286 places, 201/239 transitions.
[2024-05-22 01:18:30] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:18:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:18:30] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-22 01:18:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:18:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:18:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16009357750487959179.gal : 1 ms
[2024-05-22 01:18:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17496542179988068061.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/CTLFireability16009357750487959179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17496542179988068061.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-05-22 01:19:00] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:19:00] [INFO ] Applying decomposition
[2024-05-22 01:19:00] [INFO ] Flatten gal took : 6 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/graph11080553766597798410.txt' '-o' '/tmp/graph11080553766597798410.bin' '-w' '/tmp/graph11080553766597798410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11080553766597798410.bin' '-l' '-1' '-v' '-w' '/tmp/graph11080553766597798410.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:19:00] [INFO ] Decomposing Gal with order
[2024-05-22 01:19:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:19:00] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 01:19:00] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:19:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 01:19:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17125039728876313847.gal : 3 ms
[2024-05-22 01:19:00] [INFO ] Time to serialize properties into /tmp/CTLFireability11187792500296104312.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/CTLFireability17125039728876313847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11187792500296104312.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.98375e+18,4.28868,117936,7085,272,272763,1484,729,248413,129,4907,0
Converting to forward existential form...Done !
original formula: E((EX(AG(AF(((i4.i0.u18.p92==1)&&(i11.u59.p251==1))))) + (EX(!(AX((i3.u11.p64==1)))) * EG(!(((i0.i0.u33.p22==1)&&(i0.i0.u33.p144==1))))))...623
=> equivalent forward existential formula: [((FwdU(Init,(EX(!(E(TRUE U !(!(EG(!(((i4.i0.u18.p92==1)&&(i11.u59.p251==1))))))))) + (EX(!(!(EX(!((i3.u11.p64==...824
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t122, t148, t161, t162, t194, i0.i0.u33.t79, i1.u7.t129, i1.u7.t130, i1.u12.t113, i1...817
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 269 transition count 222
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 269 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 269 transition count 221
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 47 place count 257 transition count 209
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 257 transition count 209
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 69 place count 257 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 256 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 256 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 256 transition count 197
Applied a total of 72 rules in 17 ms. Remains 256 /286 variables (removed 30) and now considering 197/239 (removed 42) transitions.
// Phase 1: matrix 197 rows 256 cols
[2024-05-22 01:19:30] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 01:19:30] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 01:19:30] [INFO ] Invariant cache hit.
[2024-05-22 01:19:31] [INFO ] Implicit Places using invariants and state equation in 204 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 330 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/286 places, 197/239 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 355 ms. Remains : 255/286 places, 197/239 transitions.
[2024-05-22 01:19:31] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:19:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:19:31] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 01:19:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:19:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:19:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9130301960542328307.gal : 2 ms
[2024-05-22 01:19:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5168954527615022914.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/CTLFireability9130301960542328307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5168954527615022914.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:20:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:20:01] [INFO ] Applying decomposition
[2024-05-22 01:20:01] [INFO ] Flatten gal took : 5 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/graph15883928222511176456.txt' '-o' '/tmp/graph15883928222511176456.bin' '-w' '/tmp/graph15883928222511176456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15883928222511176456.bin' '-l' '-1' '-v' '-w' '/tmp/graph15883928222511176456.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:20:01] [INFO ] Decomposing Gal with order
[2024-05-22 01:20:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:20:01] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 01:20:01] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:20:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-22 01:20:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12304336327968692979.gal : 10 ms
[2024-05-22 01:20:01] [INFO ] Time to serialize properties into /tmp/CTLFireability993881701875931358.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/CTLFireability12304336327968692979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability993881701875931358.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.20603e+18,3.30087,105076,14894,282,268155,1572,643,188683,143,4790,0
Converting to forward existential form...Done !
original formula: A((E(((i5.u16.p90==1)&&(i5.u24.p120==1)) U EX(A((i5.u15.p88==1) U (i8.i0.i0.u48.p208==1)))) + (!(A(!(((i2.u29.p21==1)&&(i2.u29.p144==1)))...326
=> equivalent forward existential formula: [((Init * !(EG(!(E(((i4.u8.p27==1)&&(i4.u8.p50==1)) U (((i8.i1.i0.u44.p197==1)&&(u31.p152==1))&&(i10.u34.p260==1...823
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t145, t158, t159, t191, u31.t76, i0.u12.t109, i0.u12.t111, i2.u29.t79, i3.t121, i3.u...745
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 270 transition count 223
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 270 transition count 223
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 260 transition count 213
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 260 transition count 213
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 60 place count 260 transition count 205
Applied a total of 60 rules in 13 ms. Remains 260 /286 variables (removed 26) and now considering 205/239 (removed 34) transitions.
// Phase 1: matrix 205 rows 260 cols
[2024-05-22 01:20:31] [INFO ] Computed 62 invariants in 7 ms
[2024-05-22 01:20:31] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-22 01:20:31] [INFO ] Invariant cache hit.
[2024-05-22 01:20:31] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 344 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/286 places, 205/239 transitions.
Applied a total of 0 rules in 3 ms. Remains 259 /259 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 259/286 places, 205/239 transitions.
[2024-05-22 01:20:31] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:20:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:20:31] [INFO ] Input system was already deterministic with 205 transitions.
[2024-05-22 01:20:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:20:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:20:31] [INFO ] Time to serialize gal into /tmp/CTLFireability11864247086406182614.gal : 1 ms
[2024-05-22 01:20:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7263522361623528413.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/CTLFireability11864247086406182614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7263522361623528413.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:21:01] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:21:01] [INFO ] Applying decomposition
[2024-05-22 01:21:01] [INFO ] Flatten gal took : 5 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/graph6554967765495777470.txt' '-o' '/tmp/graph6554967765495777470.bin' '-w' '/tmp/graph6554967765495777470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6554967765495777470.bin' '-l' '-1' '-v' '-w' '/tmp/graph6554967765495777470.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:21:01] [INFO ] Decomposing Gal with order
[2024-05-22 01:21:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:21:01] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-22 01:21:01] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:21:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-22 01:21:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12892645945509601387.gal : 3 ms
[2024-05-22 01:21:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10348675335700392181.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/CTLFireability12892645945509601387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10348675335700392181.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.20615e+18,1.14824,43748,3315,282,93722,2105,693,107555,141,5742,0
Converting to forward existential form...Done !
original formula: EG(((AX((i2.u8.p63==0)) + AG((i8.u35.p148==0))) + (((((i11.u68.p256==0) + EG(((i5.u5.p41==0)||(i5.u22.p95==0)))) + ((!(E((i8.u35.p156==1)...729
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!((i2.u8.p63==0)))) + !(E(TRUE U !((i8.u35.p148==0))))) + (((((i11.u68.p256==0) + EG(((i5.u5.p...808
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t89, t101, t124, t150, t165, t166, t198, i0.u34.t79, i1.u6.t127, i1.u6.t128, i2...748
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 277 transition count 219
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 263 transition count 219
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 29 place count 263 transition count 212
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 43 place count 256 transition count 212
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 56 place count 243 transition count 199
Iterating global reduction 2 with 13 rules applied. Total rules applied 69 place count 243 transition count 199
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 2 with 2 rules applied. Total rules applied 71 place count 243 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 242 transition count 197
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 82 place count 232 transition count 187
Iterating global reduction 4 with 10 rules applied. Total rules applied 92 place count 232 transition count 187
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 102 place count 232 transition count 177
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 102 place count 232 transition count 174
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 108 place count 229 transition count 174
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 242 place count 162 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 162 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 245 place count 160 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 159 transition count 104
Applied a total of 246 rules in 45 ms. Remains 159 /286 variables (removed 127) and now considering 104/239 (removed 135) transitions.
// Phase 1: matrix 104 rows 159 cols
[2024-05-22 01:21:32] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 01:21:32] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-22 01:21:32] [INFO ] Invariant cache hit.
[2024-05-22 01:21:32] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-22 01:21:32] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-22 01:21:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/157 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/159 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 104/263 variables, 159/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:21:33] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 8 ms to minimize.
[2024-05-22 01:21:34] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:21:34] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-22 01:21:34] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:21:34] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:21:35] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:21:35] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:21:36] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:21:36] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:21:37] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 17 (OVERLAPS) 0/263 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 227 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6162 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 2/157 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 2/159 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 104/263 variables, 159/227 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 100/327 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:21:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/263 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:21:48] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/263 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:21:50] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 18 (OVERLAPS) 0/263 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 330 constraints, problems are : Problem set: 0 solved, 100 unsolved in 22188 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 13/13 constraints]
After SMT, in 28363ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 28365ms
Starting structural reductions in SI_CTL mode, iteration 1 : 159/286 places, 104/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28647 ms. Remains : 159/286 places, 104/239 transitions.
[2024-05-22 01:22:00] [INFO ] Flatten gal took : 8 ms
[2024-05-22 01:22:00] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:22:00] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-22 01:22:00] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:22:00] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:22:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9278429573283542536.gal : 1 ms
[2024-05-22 01:22:00] [INFO ] Time to serialize properties into /tmp/CTLFireability98780868406159549.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/CTLFireability9278429573283542536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability98780868406159549.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:22:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:22:30] [INFO ] Applying decomposition
[2024-05-22 01:22:30] [INFO ] Flatten gal took : 3 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/graph7332838855880231684.txt' '-o' '/tmp/graph7332838855880231684.bin' '-w' '/tmp/graph7332838855880231684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7332838855880231684.bin' '-l' '-1' '-v' '-w' '/tmp/graph7332838855880231684.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:22:30] [INFO ] Decomposing Gal with order
[2024-05-22 01:22:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:22:30] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 01:22:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:22:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 01:22:30] [INFO ] Time to serialize gal into /tmp/CTLFireability882965066498718328.gal : 1 ms
[2024-05-22 01:22:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11839886768740438941.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/CTLFireability882965066498718328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11839886768740438941.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.2945e+13,0.252689,15416,1773,222,29717,961,409,35162,114,3123,0
Converting to forward existential form...Done !
original formula: AF(((A(!((EF(((u16.p153==1)&&(u16.p155==1))) + (i0.u3.p51==1))) U EG((!(((i8.u26.p192==1)&&(i8.u34.p224==1))) * A((i3.u6.p91==1) U ((u15....248
=> equivalent forward existential formula: [FwdG(Init,!(((!((E(!(EG((!(((i8.u26.p192==1)&&(i8.u34.p224==1))) * !((E(!(((u15.p20==1)&&(u15.p144==1))) U (!((...783
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t89, t92, t93, t94, t97, u15.t5, u15.t25, u16.t73, u51.t1, u51.t99, i0.t14, i0.u3.t...393
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 269 transition count 222
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 269 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 269 transition count 221
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 259 transition count 211
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 259 transition count 211
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 63 place count 259 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 258 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 258 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 258 transition count 201
Applied a total of 66 rules in 18 ms. Remains 258 /286 variables (removed 28) and now considering 201/239 (removed 38) transitions.
// Phase 1: matrix 201 rows 258 cols
[2024-05-22 01:23:00] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 01:23:01] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-22 01:23:01] [INFO ] Invariant cache hit.
[2024-05-22 01:23:01] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 319 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/286 places, 201/239 transitions.
Applied a total of 0 rules in 3 ms. Remains 257 /257 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 340 ms. Remains : 257/286 places, 201/239 transitions.
[2024-05-22 01:23:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:23:01] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:23:01] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-22 01:23:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:23:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:23:01] [INFO ] Time to serialize gal into /tmp/CTLFireability18242352639277809388.gal : 1 ms
[2024-05-22 01:23:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2560209361044238475.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/CTLFireability18242352639277809388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2560209361044238475.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:23:31] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:23:31] [INFO ] Applying decomposition
[2024-05-22 01:23:31] [INFO ] Flatten gal took : 8 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/graph968387120950267650.txt' '-o' '/tmp/graph968387120950267650.bin' '-w' '/tmp/graph968387120950267650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph968387120950267650.bin' '-l' '-1' '-v' '-w' '/tmp/graph968387120950267650.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:23:31] [INFO ] Decomposing Gal with order
[2024-05-22 01:23:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:23:31] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-22 01:23:31] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:23:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2024-05-22 01:23:31] [INFO ] Time to serialize gal into /tmp/CTLFireability12070346389757491929.gal : 3 ms
[2024-05-22 01:23:31] [INFO ] Time to serialize properties into /tmp/CTLFireability16553627130910449778.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/CTLFireability12070346389757491929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16553627130910449778.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.99048e+18,4.3759,139112,10623,245,362003,1607,770,303425,134,4689,0
Converting to forward existential form...Done !
original formula: EF(AX((E((i3.i0.u12.p68==1) U (i11.i1.u76.p289==1)) * (((i3.i1.u15.p81==1)&&(i11.i1.u75.p279==1))||((i1.i1.u8.p46==1)&&(i1.i1.u29.p124==1...161
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((E((i3.i0.u12.p68==1) U (i11.i1.u76.p289==1)) * (((i3.i1.u15.p81==1)&&(i11.i1.u75.p27...219
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t87, t147, t162, t163, t195, i0.t76, i1.t122, i1.i0.u7.t128, i1.i0.u7.t129, i1.i1.u8...801
(forward)formula 0,1,20.6896,549244,1,0,1.23868e+06,3751,3678,1.55211e+06,835,17936,1884006
FORMULA DES-PT-05b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 277 transition count 221
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 265 transition count 221
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 265 transition count 210
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 254 transition count 210
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 61 place count 240 transition count 196
Iterating global reduction 2 with 14 rules applied. Total rules applied 75 place count 240 transition count 196
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 2 with 2 rules applied. Total rules applied 77 place count 240 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 239 transition count 194
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 88 place count 229 transition count 184
Iterating global reduction 4 with 10 rules applied. Total rules applied 98 place count 229 transition count 184
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 10 rules applied. Total rules applied 108 place count 229 transition count 174
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 228 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 110 place count 228 transition count 172
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 112 place count 227 transition count 172
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 252 place count 157 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 254 place count 155 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 255 place count 154 transition count 100
Applied a total of 255 rules in 33 ms. Remains 154 /286 variables (removed 132) and now considering 100/239 (removed 139) transitions.
// Phase 1: matrix 100 rows 154 cols
[2024-05-22 01:23:52] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 01:23:52] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-22 01:23:52] [INFO ] Invariant cache hit.
[2024-05-22 01:23:52] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-22 01:23:52] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-22 01:23:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/152 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/153 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 100/253 variables, 153/211 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 1/254 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 01:23:55] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:23:55] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 01:23:55] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-22 01:23:55] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/254 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 01:23:56] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (OVERLAPS) 0/254 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 217 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5126 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/152 variables, 25/51 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/153 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 100/253 variables, 153/216 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 97/313 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 1/254 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 01:24:01] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:24:01] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (OVERLAPS) 0/254 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 316 constraints, problems are : Problem set: 0 solved, 97 unsolved in 13446 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints]
After SMT, in 18588ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 18591ms
Starting structural reductions in SI_CTL mode, iteration 1 : 154/286 places, 100/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18827 ms. Remains : 154/286 places, 100/239 transitions.
[2024-05-22 01:24:10] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:24:10] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:24:10] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-22 01:24:11] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:24:11] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:24:11] [INFO ] Time to serialize gal into /tmp/CTLFireability539604136288465062.gal : 1 ms
[2024-05-22 01:24:11] [INFO ] Time to serialize properties into /tmp/CTLFireability16688044227244423143.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/CTLFireability539604136288465062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16688044227244423143.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:24:41] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:24:41] [INFO ] Applying decomposition
[2024-05-22 01:24:41] [INFO ] Flatten gal took : 3 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/graph3240612659913620715.txt' '-o' '/tmp/graph3240612659913620715.bin' '-w' '/tmp/graph3240612659913620715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3240612659913620715.bin' '-l' '-1' '-v' '-w' '/tmp/graph3240612659913620715.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:24:41] [INFO ] Decomposing Gal with order
[2024-05-22 01:24:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:24:41] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 01:24:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 01:24:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 01:24:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16778190333725090784.gal : 1 ms
[2024-05-22 01:24:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12137257584619325297.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/CTLFireability16778190333725090784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12137257584619325297.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18709e+13,0.404826,19708,2222,227,38395,656,412,45611,112,2550,0
Converting to forward existential form...Done !
original formula: A(EF((A((i1.i1.u51.p289==1) U (i1.i0.u6.p78==1)) + (i4.i1.u14.p133==1))) U ((u52.p16==1)&&(u52.p292==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((u52.p16==1)&&(u52.p292==1)))))) * !(E(!(((u52.p16==1)&&(u52.p292==1))) U (!(E(TRUE U (!((E(!(...327
Reverse transition relation is NOT exact ! Due to transitions t64, t84, t85, t88, t89, t90, t93, u0.t56, u17.t69, u52.t55, u52.t95, i0.t12, i0.u2.t16, i0.u...366
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 277 transition count 220
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 264 transition count 220
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 264 transition count 210
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 254 transition count 210
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 63 place count 238 transition count 194
Iterating global reduction 2 with 16 rules applied. Total rules applied 79 place count 238 transition count 194
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 2 with 2 rules applied. Total rules applied 81 place count 238 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 237 transition count 192
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 93 place count 226 transition count 181
Iterating global reduction 4 with 11 rules applied. Total rules applied 104 place count 226 transition count 181
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 11 rules applied. Total rules applied 115 place count 226 transition count 170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 117 place count 225 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 117 place count 225 transition count 166
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 123 place count 222 transition count 166
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 257 place count 155 transition count 99
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 259 place count 155 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 153 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 262 place count 152 transition count 97
Applied a total of 262 rules in 29 ms. Remains 152 /286 variables (removed 134) and now considering 97/239 (removed 142) transitions.
// Phase 1: matrix 97 rows 152 cols
[2024-05-22 01:25:11] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 01:25:11] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 01:25:11] [INFO ] Invariant cache hit.
[2024-05-22 01:25:11] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-22 01:25:11] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-22 01:25:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 1/148 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 01:25:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 3/151 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 97/248 variables, 151/210 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 01:25:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 01:25:13] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-22 01:25:14] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 01:25:14] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:25:14] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:25:14] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 01:25:14] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 01:25:14] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 01:25:14] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 01:25:15] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 15 (OVERLAPS) 1/249 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 17 (OVERLAPS) 0/249 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 221 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5838 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 1/148 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 3/151 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 97/248 variables, 151/220 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 92/312 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 14 (OVERLAPS) 1/249 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 16 (OVERLAPS) 0/249 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 313 constraints, problems are : Problem set: 0 solved, 92 unsolved in 8642 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 11/11 constraints]
After SMT, in 14493ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 14494ms
Starting structural reductions in SI_CTL mode, iteration 1 : 152/286 places, 97/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14804 ms. Remains : 152/286 places, 97/239 transitions.
[2024-05-22 01:25:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:25:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:25:25] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 01:25:25] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:25:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:25:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13780999908503315898.gal : 1 ms
[2024-05-22 01:25:25] [INFO ] Time to serialize properties into /tmp/CTLFireability4212556561116070609.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/CTLFireability13780999908503315898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4212556561116070609.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:25:56] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:25:56] [INFO ] Applying decomposition
[2024-05-22 01:25:56] [INFO ] Flatten gal took : 3 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/graph4192037146866160104.txt' '-o' '/tmp/graph4192037146866160104.bin' '-w' '/tmp/graph4192037146866160104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4192037146866160104.bin' '-l' '-1' '-v' '-w' '/tmp/graph4192037146866160104.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:25:56] [INFO ] Decomposing Gal with order
[2024-05-22 01:25:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:25:56] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-22 01:25:56] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:25:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 1 ms.
[2024-05-22 01:25:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9237872961372494460.gal : 1 ms
[2024-05-22 01:25:56] [INFO ] Time to serialize properties into /tmp/CTLFireability10271347022545822352.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/CTLFireability9237872961372494460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10271347022545822352.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.08421e+12,0.510877,29120,5095,206,77205,537,386,47174,111,1878,0
Converting to forward existential form...Done !
original formula: AG(((EF((((i12.u30.p205==0)||(i3.u2.p48==0))||(i3.u1.p124==0))) + (i7.i0.u29.p194==1)) + (i14.u52.p289==0)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((i14.u52.p289==0))) * !((i7.i0.u29.p194==1))) * !(E(TRUE U (((i12.u30.p205==0)||(i3.u2.p...192
Reverse transition relation is NOT exact ! Due to transitions t63, t72, t80, t83, t84, t85, t88, t95, u16.t26, u53.t1, u53.t90, i0.t13, i0.u3.t17, i0.u3.t2...337
(forward)formula 0,1,2.69705,136912,1,0,466631,2118,1852,294578,699,7146,735962
FORMULA DES-PT-05b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 270 transition count 223
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 270 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 270 transition count 222
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 44 place count 259 transition count 211
Iterating global reduction 1 with 11 rules applied. Total rules applied 55 place count 259 transition count 211
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 259 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 258 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 258 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 258 transition count 200
Applied a total of 67 rules in 14 ms. Remains 258 /286 variables (removed 28) and now considering 200/239 (removed 39) transitions.
// Phase 1: matrix 200 rows 258 cols
[2024-05-22 01:25:58] [INFO ] Computed 62 invariants in 4 ms
[2024-05-22 01:25:58] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-22 01:25:58] [INFO ] Invariant cache hit.
[2024-05-22 01:25:59] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 350 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/286 places, 200/239 transitions.
Applied a total of 0 rules in 4 ms. Remains 257 /257 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 369 ms. Remains : 257/286 places, 200/239 transitions.
[2024-05-22 01:25:59] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:25:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:25:59] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-22 01:25:59] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:25:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:25:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8743773648962204023.gal : 1 ms
[2024-05-22 01:25:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5820522107127525900.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/CTLFireability8743773648962204023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5820522107127525900.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:26:29] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:26:29] [INFO ] Applying decomposition
[2024-05-22 01:26:29] [INFO ] Flatten gal took : 4 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/graph702352033730788725.txt' '-o' '/tmp/graph702352033730788725.bin' '-w' '/tmp/graph702352033730788725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph702352033730788725.bin' '-l' '-1' '-v' '-w' '/tmp/graph702352033730788725.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:26:29] [INFO ] Decomposing Gal with order
[2024-05-22 01:26:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:26:29] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:26:29] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:26:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 01:26:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3969143350890288383.gal : 2 ms
[2024-05-22 01:26:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17223927735377002853.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/CTLFireability3969143350890288383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17223927735377002853.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.29693e+18,1.4672,54008,4163,280,125925,1758,715,118890,147,4633,0
Converting to forward existential form...Done !
original formula: EX((AF((((E((i11.i1.u10.p68==1) U (i5.u26.p127==1)) + ((EF((i8.i1.u53.p223==1)) * (i12.u67.p273==1)) * (i12.u69.p282==1))) * ((i0.u29.p20...309
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!((((E((i11.i1.u10.p68==1) U (i5.u26.p127==1)) + ((E(TRUE U (i8.i1.u53.p223==1)) * (i12.u67.p...397
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t147, t160, t161, t193, i0.u29.t79, i1.u31.t76, i1.u68.t25, i2.t123, i2.u6.t128...784
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 268 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 268 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 268 transition count 220
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 255 transition count 207
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 255 transition count 207
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 74 place count 255 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 254 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 254 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 254 transition count 194
Applied a total of 77 rules in 17 ms. Remains 254 /286 variables (removed 32) and now considering 194/239 (removed 45) transitions.
// Phase 1: matrix 194 rows 254 cols
[2024-05-22 01:26:59] [INFO ] Computed 62 invariants in 2 ms
[2024-05-22 01:26:59] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 01:26:59] [INFO ] Invariant cache hit.
[2024-05-22 01:26:59] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 314 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 253/286 places, 194/239 transitions.
Applied a total of 0 rules in 2 ms. Remains 253 /253 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 333 ms. Remains : 253/286 places, 194/239 transitions.
[2024-05-22 01:26:59] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:26:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:26:59] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-22 01:26:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:26:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:26:59] [INFO ] Time to serialize gal into /tmp/CTLFireability961214869347097606.gal : 1 ms
[2024-05-22 01:26:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7480909845064266854.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/CTLFireability961214869347097606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7480909845064266854.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:27:29] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:27:29] [INFO ] Applying decomposition
[2024-05-22 01:27:29] [INFO ] Flatten gal took : 4 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/graph6052456709372239953.txt' '-o' '/tmp/graph6052456709372239953.bin' '-w' '/tmp/graph6052456709372239953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6052456709372239953.bin' '-l' '-1' '-v' '-w' '/tmp/graph6052456709372239953.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:27:29] [INFO ] Decomposing Gal with order
[2024-05-22 01:27:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:27:29] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 01:27:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 01:27:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 01:27:29] [INFO ] Time to serialize gal into /tmp/CTLFireability2737284740421394971.gal : 2 ms
[2024-05-22 01:27:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9853986339019730824.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/CTLFireability2737284740421394971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9853986339019730824.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.47069e+18,1.12642,45692,4696,274,98318,2255,647,140647,140,6334,0
Converting to forward existential form...Done !
original formula: E((i0.u14.p82!=1) U !(EG(EX(AF((i8.u38.p168==1))))))
=> equivalent forward existential formula: [(FwdU(Init,(i0.u14.p82!=1)) * !(EG(EX(!(EG(!((i8.u38.p168==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t143, t155, t156, t188, u75.t17, u75.t134, i0.u13.t109, i1.t119, i1.u6.t124, i1...730
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 268 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 268 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 268 transition count 220
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 256 transition count 208
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 256 transition count 208
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 256 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 255 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 255 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 255 transition count 196
Applied a total of 74 rules in 15 ms. Remains 255 /286 variables (removed 31) and now considering 196/239 (removed 43) transitions.
// Phase 1: matrix 196 rows 255 cols
[2024-05-22 01:27:59] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 01:28:00] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-22 01:28:00] [INFO ] Invariant cache hit.
[2024-05-22 01:28:00] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-22 01:28:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/451 variables, 255/317 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-22 01:28:03] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-22 01:28:03] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-22 01:28:03] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:28:03] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 6/323 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 6 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:28:08] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 01:28:08] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-22 01:28:08] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:28:08] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:28:08] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:28:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-22 01:28:08] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:28:08] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/451 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-22 01:28:09] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-22 01:28:09] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:28:09] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-22 01:28:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:28:10] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-22 01:28:11] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-22 01:28:12] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:28:12] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-22 01:28:12] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:28:12] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:28:12] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-22 01:28:12] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:28:12] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-22 01:28:13] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 13 (OVERLAPS) 0/451 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 357 constraints, problems are : Problem set: 0 solved, 195 unsolved in 18115 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 40/102 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-22 01:28:19] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:28:19] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:28:19] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-05-22 01:28:19] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-22 01:28:19] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:28:19] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:28:19] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:28:19] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-22 01:28:20] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-22 01:28:21] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-22 01:28:21] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:28:21] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-22 01:28:22] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:28:22] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
[2024-05-22 01:28:22] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 196/451 variables, 255/384 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 195/579 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-22 01:28:27] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-22 01:28:31] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-22 01:28:44] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:28:44] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-22 01:28:44] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:28:45] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:28:45] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 586 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 74/74 constraints]
After SMT, in 48152ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 48156ms
Starting structural reductions in LTL mode, iteration 1 : 255/286 places, 196/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48473 ms. Remains : 255/286 places, 196/239 transitions.
[2024-05-22 01:28:48] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:28:48] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:28:48] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-22 01:28:48] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:28:48] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:28:48] [INFO ] Time to serialize gal into /tmp/CTLFireability13839733864345690429.gal : 1 ms
[2024-05-22 01:28:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3056855193034316263.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/CTLFireability13839733864345690429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3056855193034316263.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:29:18] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:29:18] [INFO ] Applying decomposition
[2024-05-22 01:29:18] [INFO ] Flatten gal took : 5 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/graph12636569932414928770.txt' '-o' '/tmp/graph12636569932414928770.bin' '-w' '/tmp/graph12636569932414928770.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12636569932414928770.bin' '-l' '-1' '-v' '-w' '/tmp/graph12636569932414928770.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:29:18] [INFO ] Decomposing Gal with order
[2024-05-22 01:29:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:29:18] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 01:29:18] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:29:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 01:29:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9657752274369873807.gal : 2 ms
[2024-05-22 01:29:18] [INFO ] Time to serialize properties into /tmp/CTLFireability4654544974895410018.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/CTLFireability9657752274369873807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4654544974895410018.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.77255e+18,2.24776,70084,4694,304,152121,1692,648,217953,136,6490,0
Converting to forward existential form...Done !
original formula: A((AF(EX(!(((i8.i2.u59.p229==1)||((i6.u33.p9==1)&&(i6.u33.p151==1)))))) * !((((EF(!(((i4.u28.p122==1)&&(i4.u30.p128==1)))) + (((i6.u33.p6...418
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(((i2.u6.p42==1)||(i5.i0.u17.p93!=1))))))))) * !(E(!(!(E(TRUE U !(((i2.u6.p42==1)||...629
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t144, t156, t157, t189, i0.u32.t79, i1.u13.t110, i2.t120, i2.u6.t125, i2.u6.t126, i2...731
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Graph (complete) has 538 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 277 transition count 221
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 265 transition count 221
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 265 transition count 210
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 47 place count 254 transition count 210
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 63 place count 238 transition count 194
Iterating global reduction 2 with 16 rules applied. Total rules applied 79 place count 238 transition count 194
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 2 with 2 rules applied. Total rules applied 81 place count 238 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 237 transition count 192
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 93 place count 226 transition count 181
Iterating global reduction 4 with 11 rules applied. Total rules applied 104 place count 226 transition count 181
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 11 rules applied. Total rules applied 115 place count 226 transition count 170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 117 place count 225 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 117 place count 225 transition count 167
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 121 place count 223 transition count 167
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 245 place count 161 transition count 105
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 247 place count 161 transition count 105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 249 place count 159 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 250 place count 158 transition count 103
Applied a total of 250 rules in 36 ms. Remains 158 /286 variables (removed 128) and now considering 103/239 (removed 136) transitions.
// Phase 1: matrix 103 rows 158 cols
[2024-05-22 01:29:48] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 01:29:48] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-22 01:29:48] [INFO ] Invariant cache hit.
[2024-05-22 01:29:48] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-22 01:29:48] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-22 01:29:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/157 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/158 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:29:50] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:29:50] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:29:50] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:29:51] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:29:51] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-22 01:29:52] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:29:52] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:29:52] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:29:53] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-22 01:29:53] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-22 01:29:53] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:29:53] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-22 01:29:53] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/261 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:29:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/261 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/261 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 18 (OVERLAPS) 0/261 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 230 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7695 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 2/157 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/158 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 103/261 variables, 158/230 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 100/330 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-22 01:29:59] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 0/261 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 331 constraints, problems are : Problem set: 0 solved, 100 unsolved in 12975 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 15/15 constraints]
After SMT, in 20691ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 20692ms
Starting structural reductions in SI_CTL mode, iteration 1 : 158/286 places, 103/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20988 ms. Remains : 158/286 places, 103/239 transitions.
[2024-05-22 01:30:09] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:30:09] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:30:09] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-22 01:30:09] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:30:09] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:30:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6031399424952597816.gal : 3 ms
[2024-05-22 01:30:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14418611134349871289.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/CTLFireability6031399424952597816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14418611134349871289.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 01:30:39] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:30:39] [INFO ] Applying decomposition
[2024-05-22 01:30:39] [INFO ] Flatten gal took : 3 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/graph95011381736101109.txt' '-o' '/tmp/graph95011381736101109.bin' '-w' '/tmp/graph95011381736101109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph95011381736101109.bin' '-l' '-1' '-v' '-w' '/tmp/graph95011381736101109.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:30:39] [INFO ] Decomposing Gal with order
[2024-05-22 01:30:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:30:39] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-22 01:30:39] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:30:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 01:30:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8780826336385811014.gal : 1 ms
[2024-05-22 01:30:39] [INFO ] Time to serialize properties into /tmp/CTLFireability9864473025877965456.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/CTLFireability8780826336385811014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9864473025877965456.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.0712e+13,0.183427,11512,1463,249,20215,901,396,21726,118,3029,0
Converting to forward existential form...Done !
original formula: (AF(EG(((i11.u4.p73==0)||(i11.u47.p258==0)))) + EF((((AF(((i7.u35.p223==0)&&((u14.p19==0)||(u14.p144==0)))) * AF(((i1.u7.p97==0)||(i2.u9....247
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (((!(EG(!(((i7.u35.p223==0)&&((u14.p19==0)||(u14.p144==0)))))) * !(EG(!(((i1.u7.p97==0)...313
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t28, t47, t70, t80, t87, t94, u14.t5, u14.t26, u52.t58, u52.t96, i0.t13, i0.u2.t17, i...384
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 268 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 268 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 268 transition count 220
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 256 transition count 208
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 256 transition count 208
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 71 place count 256 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 255 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 255 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 255 transition count 196
Applied a total of 74 rules in 18 ms. Remains 255 /286 variables (removed 31) and now considering 196/239 (removed 43) transitions.
// Phase 1: matrix 196 rows 255 cols
[2024-05-22 01:31:09] [INFO ] Computed 62 invariants in 1 ms
[2024-05-22 01:31:09] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 01:31:09] [INFO ] Invariant cache hit.
[2024-05-22 01:31:10] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 310 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 254/286 places, 196/239 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 332 ms. Remains : 254/286 places, 196/239 transitions.
[2024-05-22 01:31:10] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:31:10] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:31:10] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-22 01:31:10] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:31:10] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:31:10] [INFO ] Time to serialize gal into /tmp/CTLFireability17534529070391557754.gal : 1 ms
[2024-05-22 01:31:10] [INFO ] Time to serialize properties into /tmp/CTLFireability18096566093166500498.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/CTLFireability17534529070391557754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18096566093166500498.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-05-22 01:31:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 01:31:40] [INFO ] Applying decomposition
[2024-05-22 01:31:40] [INFO ] Flatten gal took : 4 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/graph16017643240609150363.txt' '-o' '/tmp/graph16017643240609150363.bin' '-w' '/tmp/graph16017643240609150363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16017643240609150363.bin' '-l' '-1' '-v' '-w' '/tmp/graph16017643240609150363.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:31:40] [INFO ] Decomposing Gal with order
[2024-05-22 01:31:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:31:40] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:31:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 01:31:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-22 01:31:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12384225489411424808.gal : 3 ms
[2024-05-22 01:31:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15988604186438646381.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/CTLFireability12384225489411424808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15988604186438646381.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.26346e+18,2.52408,81464,4694,297,183721,1874,716,227092,140,5775,0
Converting to forward existential form...Done !
original formula: E((i3.i1.u28.p137==1) U AX((A(EG((i3.i1.u28.p138==1)) U (i11.i1.u41.p177==1)) * !(((i2.i1.u15.p77==1)&&(i7.u72.p279==1))))))
=> equivalent forward existential formula: [(FwdU(Init,(i3.i1.u28.p137==1)) * !(EX(!((!((E(!((i11.i1.u41.p177==1)) U (!(EG((i3.i1.u28.p138==1))) * !((i11.i...263
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t87, t144, t157, t158, t190, u75.t17, u75.t135, i0.i1.u30.t79, i1.t116, i2.i0.t...760
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 239/239 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 272 transition count 225
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 272 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 272 transition count 224
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 39 place count 262 transition count 214
Iterating global reduction 1 with 10 rules applied. Total rules applied 49 place count 262 transition count 214
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 57 place count 262 transition count 206
Applied a total of 57 rules in 5 ms. Remains 262 /286 variables (removed 24) and now considering 206/239 (removed 33) transitions.
// Phase 1: matrix 206 rows 262 cols
[2024-05-22 01:32:10] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 01:32:10] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 01:32:10] [INFO ] Invariant cache hit.
[2024-05-22 01:32:10] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 327 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/286 places, 206/239 transitions.
Applied a total of 0 rules in 2 ms. Remains 261 /261 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 335 ms. Remains : 261/286 places, 206/239 transitions.
[2024-05-22 01:32:10] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:32:10] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:32:10] [INFO ] Input system was already deterministic with 206 transitions.
[2024-05-22 01:32:10] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:32:10] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:32:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15740067432571364343.gal : 2 ms
[2024-05-22 01:32:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15532571542358450422.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/CTLFireability15740067432571364343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15532571542358450422.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-05-22 01:32:40] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:32:40] [INFO ] Applying decomposition
[2024-05-22 01:32:40] [INFO ] Flatten gal took : 4 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/graph13323950792253324747.txt' '-o' '/tmp/graph13323950792253324747.bin' '-w' '/tmp/graph13323950792253324747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13323950792253324747.bin' '-l' '-1' '-v' '-w' '/tmp/graph13323950792253324747.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:32:40] [INFO ] Decomposing Gal with order
[2024-05-22 01:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:32:40] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-22 01:32:40] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:32:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 01:32:40] [INFO ] Time to serialize gal into /tmp/CTLFireability5450671171367323662.gal : 2 ms
[2024-05-22 01:32:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3921045571588338732.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/CTLFireability5450671171367323662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3921045571588338732.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37084e+19,1.97662,70612,5998,249,155657,1532,678,189014,129,4436,0
Converting to forward existential form...Done !
original formula: ((AX((((!(A((i1.u5.p34==1) U (i6.u30.p126==1))) + ((i4.u3.p30==0)&&((i4.u32.p20==0)||(i4.u32.p144==0)))) + ((i0.u14.p78==0)&&(i3.u11.p57=...772
=> equivalent forward existential formula: [(EY((((FwdU((Init * !((!(EX(!((((!(!((E(!((i6.u30.p126==1)) U (!((i1.u5.p34==1)) * !((i6.u30.p126==1)))) + EG(!...1182
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t54, t87, t92, t124, t152, t167, t168, t200, i0.u12.t115, i0.u14.t110, i0.u14.t112, ...794
Detected timeout of ITS tools.
[2024-05-22 01:33:10] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:33:10] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:33:10] [INFO ] Applying decomposition
[2024-05-22 01:33:10] [INFO ] Flatten gal took : 5 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/graph3120143137226235210.txt' '-o' '/tmp/graph3120143137226235210.bin' '-w' '/tmp/graph3120143137226235210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3120143137226235210.bin' '-l' '-1' '-v' '-w' '/tmp/graph3120143137226235210.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:33:10] [INFO ] Decomposing Gal with order
[2024-05-22 01:33:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:33:10] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-22 01:33:10] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:33:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-22 01:33:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1694508272105345698.gal : 3 ms
[2024-05-22 01:33:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15181735649328404377.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/CTLFireability1694508272105345698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15181735649328404377.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 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3646e+20,5.23232,116424,7091,267,201702,2493,808,499080,146,6450,0
Converting to forward existential form...Done !
original formula: A(AG(!(((E((i6.i1.u24.p101==1) U ((u41.p153==1)&&(u41.p155==1))) + ((i2.i1.u9.p49==1) * AF((i12.i3.u60.p211==1)))) * EF((i2.i0.u5.p35!=1)...426
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!((E(!(!(!(EG(!(((i6.i1.u27.p105==1)&&(i0.u39.p146==1))))))) U (!(EG(!(EX(!((i7.i1.u30.p...3318
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t60, t95, t146, t196, u41.t78, i0.u39.t81, i2.i1.t151, i2.i1.u8.t148, i2.i1.u9....942
ITS-tools command line returned an error code 139
[2024-05-22 01:42:43] [INFO ] Applying decomposition
[2024-05-22 01:42:43] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:42:43] [INFO ] Decomposing Gal with order
[2024-05-22 01:42:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:42:43] [INFO ] Removed a total of 37 redundant transitions.
[2024-05-22 01:42:43] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:42:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 164 labels/synchronizations in 7 ms.
[2024-05-22 01:42:43] [INFO ] Time to serialize gal into /tmp/CTLFireability1826365538327925955.gal : 2 ms
[2024-05-22 01:42:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13814413574717629359.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/CTLFireability1826365538327925955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13814413574717629359.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 14 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 01:55:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:55:57] [INFO ] Input system was already deterministic with 239 transitions.
[2024-05-22 01:55:57] [INFO ] Transformed 286 places.
[2024-05-22 01:55:57] [INFO ] Transformed 239 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-05-22 01:55:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5292388311193296566.gal : 2 ms
[2024-05-22 01:55:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2495551400464890185.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/CTLFireability5292388311193296566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2495551400464890185.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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3646e+20,55.8197,1347856,2,256958,5,5.76826e+06,6,0,1383,6.41765e+06,0
Converting to forward existential form...Done !
original formula: A(AG(!(((E((p101==1) U ((p153==1)&&(p155==1))) + ((p49==1) * AF((p211==1)))) * EF((p35!=1))))) U A((!((E((p34==1) U (p53==1)) + E((p234==...284
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!((E(!(!(!(EG(!(((p105==1)&&(p146==1))))))) U (!(EG(!(EX(!((p114==1)))))) * !(!(!(EG(!((...2404
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t10, t17, t23, t25, t27, t36, t39, t50, t52, t53, t54, t55, t56, t57, t58, t59, t60, ...491
ITS-tools command line returned an error code 137
Total runtime 3205047 ms.
BK_STOP 1716343639176
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="DES-PT-05b"
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 DES-PT-05b, 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 r092-tall-171624189700658"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b 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 ;