About the Execution of ITS-Tools for EisenbergMcGuire-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7737.655 | 3600000.00 | 3792491.00 | 10599.40 | ??????????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.r158-smll-171636266300162.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 EisenbergMcGuire-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K 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 EisenbergMcGuire-PT-05-CTLFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716513006628
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 01:10:09] [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-24 01:10:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 01:10:09] [INFO ] Load time of PNML (sax parser for PT used): 271 ms
[2024-05-24 01:10:09] [INFO ] Transformed 295 places.
[2024-05-24 01:10:09] [INFO ] Transformed 800 transitions.
[2024-05-24 01:10:09] [INFO ] Found NUPN structural information;
[2024-05-24 01:10:09] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 523 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Support contains 91 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 285 transition count 750
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 285 transition count 750
Applied a total of 20 rules in 141 ms. Remains 285 /295 variables (removed 10) and now considering 750/800 (removed 50) transitions.
[2024-05-24 01:10:10] [INFO ] Flow matrix only has 415 transitions (discarded 335 similar events)
// Phase 1: matrix 415 rows 285 cols
[2024-05-24 01:10:10] [INFO ] Computed 16 invariants in 27 ms
[2024-05-24 01:10:10] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-24 01:10:10] [INFO ] Flow matrix only has 415 transitions (discarded 335 similar events)
[2024-05-24 01:10:10] [INFO ] Invariant cache hit.
[2024-05-24 01:10:11] [INFO ] State equation strengthened by 156 read => feed constraints.
[2024-05-24 01:10:11] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
Running 745 sub problems to find dead transitions.
[2024-05-24 01:10:11] [INFO ] Flow matrix only has 415 transitions (discarded 335 similar events)
[2024-05-24 01:10:11] [INFO ] Invariant cache hit.
[2024-05-24 01:10:12] [INFO ] State equation strengthened by 156 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-24 01:10:19] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 104 ms to minimize.
[2024-05-24 01:10:19] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-24 01:10:20] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 4 ms to minimize.
[2024-05-24 01:10:20] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:10:20] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 3 ms to minimize.
[2024-05-24 01:10:20] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 3 ms to minimize.
[2024-05-24 01:10:20] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 4 ms to minimize.
[2024-05-24 01:10:21] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 4 ms to minimize.
[2024-05-24 01:10:21] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 3 ms to minimize.
[2024-05-24 01:10:21] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 2 ms to minimize.
[2024-05-24 01:10:21] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 3 ms to minimize.
[2024-05-24 01:10:21] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:10:22] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:10:22] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
[2024-05-24 01:10:23] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 3 ms to minimize.
[2024-05-24 01:10:23] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 3 ms to minimize.
[2024-05-24 01:10:23] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:10:23] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 3 ms to minimize.
[2024-05-24 01:10:23] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 3 ms to minimize.
[2024-05-24 01:10:24] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-24 01:10:24] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-24 01:10:24] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-24 01:10:24] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 3 ms to minimize.
[2024-05-24 01:10:24] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-24 01:10:24] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:10:25] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:10:25] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:10:25] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 3 ms to minimize.
[2024-05-24 01:10:25] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 3 ms to minimize.
[2024-05-24 01:10:26] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 4 ms to minimize.
[2024-05-24 01:10:26] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:10:26] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 3 ms to minimize.
[2024-05-24 01:10:26] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 3 ms to minimize.
[2024-05-24 01:10:27] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-05-24 01:10:27] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-24 01:10:27] [INFO ] Deduced a trap composed of 85 places in 214 ms of which 4 ms to minimize.
[2024-05-24 01:10:27] [INFO ] Deduced a trap composed of 90 places in 216 ms of which 4 ms to minimize.
[2024-05-24 01:10:27] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 01:10:27] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-05-24 01:10:28] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-24 01:10:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2024-05-24 01:10:33] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:10:33] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
[2024-05-24 01:10:34] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 3 ms to minimize.
[2024-05-24 01:10:34] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:10:34] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 5 ms to minimize.
[2024-05-24 01:10:35] [INFO ] Deduced a trap composed of 67 places in 172 ms of which 3 ms to minimize.
[2024-05-24 01:10:35] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:10:35] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:10:36] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:10:36] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 4 ms to minimize.
[2024-05-24 01:10:36] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:10:37] [INFO ] Deduced a trap composed of 90 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:10:38] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:10:38] [INFO ] Deduced a trap composed of 83 places in 205 ms of which 4 ms to minimize.
[2024-05-24 01:10:38] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:10:38] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 3 ms to minimize.
[2024-05-24 01:10:38] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 3 ms to minimize.
[2024-05-24 01:10:39] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 3 ms to minimize.
[2024-05-24 01:10:39] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-24 01:10:41] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:10:41] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-24 01:10:41] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/700 variables, and 79 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/285 constraints, ReadFeed: 0/156 constraints, PredecessorRefiner: 745/745 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 745 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-24 01:10:44] [INFO ] Deduced a trap composed of 83 places in 264 ms of which 4 ms to minimize.
[2024-05-24 01:10:45] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 2 ms to minimize.
[2024-05-24 01:10:45] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:10:45] [INFO ] Deduced a trap composed of 80 places in 200 ms of which 4 ms to minimize.
[2024-05-24 01:10:45] [INFO ] Deduced a trap composed of 88 places in 247 ms of which 4 ms to minimize.
[2024-05-24 01:10:45] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:10:46] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 3 ms to minimize.
[2024-05-24 01:10:46] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 4 ms to minimize.
[2024-05-24 01:10:46] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:10:46] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 2 ms to minimize.
[2024-05-24 01:10:46] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 2 ms to minimize.
[2024-05-24 01:10:47] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-05-24 01:10:47] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:10:47] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-05-24 01:10:48] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-05-24 01:10:48] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:10:49] [INFO ] Deduced a trap composed of 49 places in 239 ms of which 4 ms to minimize.
[2024-05-24 01:10:50] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 4 ms to minimize.
[2024-05-24 01:10:50] [INFO ] Deduced a trap composed of 60 places in 204 ms of which 4 ms to minimize.
[2024-05-24 01:10:51] [INFO ] Deduced a trap composed of 61 places in 194 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-24 01:10:55] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:10:55] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:10:55] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:10:55] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 2 ms to minimize.
[2024-05-24 01:10:55] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
[2024-05-24 01:10:55] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 2 ms to minimize.
[2024-05-24 01:10:55] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 3 ms to minimize.
[2024-05-24 01:10:56] [INFO ] Deduced a trap composed of 54 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:10:56] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 3 ms to minimize.
[2024-05-24 01:10:56] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:10:56] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:10:56] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 3 ms to minimize.
[2024-05-24 01:10:57] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 2 ms to minimize.
[2024-05-24 01:10:57] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 3 ms to minimize.
[2024-05-24 01:10:57] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2024-05-24 01:10:57] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 2 ms to minimize.
[2024-05-24 01:10:57] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 3 ms to minimize.
[2024-05-24 01:10:58] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:10:58] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 2 ms to minimize.
[2024-05-24 01:10:58] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-24 01:10:59] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:11:00] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 3 ms to minimize.
[2024-05-24 01:11:00] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:11:07] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:11:07] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:11:07] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-24 01:11:07] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 7/126 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-24 01:11:09] [INFO ] Deduced a trap composed of 62 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:11:10] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:11:10] [INFO ] Deduced a trap composed of 79 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:11:11] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-24 01:11:12] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:11:12] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/700 variables, and 132 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/285 constraints, ReadFeed: 0/156 constraints, PredecessorRefiner: 0/745 constraints, Known Traps: 116/116 constraints]
After SMT, in 60885ms problems are : Problem set: 0 solved, 745 unsolved
Search for dead transitions found 0 dead transitions in 60943ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 750/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63021 ms. Remains : 285/295 places, 750/800 transitions.
Support contains 91 out of 285 places after structural reductions.
[2024-05-24 01:11:13] [INFO ] Flatten gal took : 117 ms
[2024-05-24 01:11:13] [INFO ] Flatten gal took : 70 ms
[2024-05-24 01:11:13] [INFO ] Input system was already deterministic with 750 transitions.
Support contains 90 out of 285 places (down from 91) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3524 ms. (11 steps per ms) remains 44/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
[2024-05-24 01:11:15] [INFO ] Flow matrix only has 415 transitions (discarded 335 similar events)
[2024-05-24 01:11:15] [INFO ] Invariant cache hit.
[2024-05-24 01:11:15] [INFO ] State equation strengthened by 156 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (OVERLAPS) 226/285 variables, 10/11 constraints. Problems are: Problem set: 2 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 5/16 constraints. Problems are: Problem set: 2 solved, 40 unsolved
[2024-05-24 01:11:15] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:11:15] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:11:15] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 01:11:15] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-24 01:11:16] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-24 01:11:16] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 4 ms to minimize.
[2024-05-24 01:11:16] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-05-24 01:11:16] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 2 ms to minimize.
[2024-05-24 01:11:16] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-05-24 01:11:16] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 01:11:17] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:11:17] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-24 01:11:17] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:11:17] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 4 ms to minimize.
[2024-05-24 01:11:17] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
Problem AtomicPropp67 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 15/31 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-24 01:11:17] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 1/32 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-24 01:11:18] [INFO ] Deduced a trap composed of 61 places in 282 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/33 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 415/700 variables, 285/318 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 156/474 constraints. Problems are: Problem set: 3 solved, 39 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 700/700 variables, and 474 constraints, problems are : Problem set: 3 solved, 39 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 285/285 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 3 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 230/285 variables, 10/11 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 5/16 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 17/33 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-24 01:11:20] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 5 ms to minimize.
[2024-05-24 01:11:21] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 5 ms to minimize.
[2024-05-24 01:11:21] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 4 ms to minimize.
[2024-05-24 01:11:21] [INFO ] Deduced a trap composed of 58 places in 301 ms of which 4 ms to minimize.
[2024-05-24 01:11:22] [INFO ] Deduced a trap composed of 56 places in 255 ms of which 4 ms to minimize.
[2024-05-24 01:11:22] [INFO ] Deduced a trap composed of 49 places in 272 ms of which 4 ms to minimize.
[2024-05-24 01:11:22] [INFO ] Deduced a trap composed of 51 places in 268 ms of which 4 ms to minimize.
[2024-05-24 01:11:23] [INFO ] Deduced a trap composed of 55 places in 271 ms of which 4 ms to minimize.
[2024-05-24 01:11:23] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 9/42 constraints. Problems are: Problem set: 3 solved, 39 unsolved
[2024-05-24 01:11:24] [INFO ] Deduced a trap composed of 48 places in 289 ms of which 4 ms to minimize.
[2024-05-24 01:11:24] [INFO ] Deduced a trap composed of 71 places in 281 ms of which 4 ms to minimize.
[2024-05-24 01:11:24] [INFO ] Deduced a trap composed of 87 places in 296 ms of which 4 ms to minimize.
[2024-05-24 01:11:25] [INFO ] Deduced a trap composed of 70 places in 296 ms of which 5 ms to minimize.
[2024-05-24 01:11:25] [INFO ] Deduced a trap composed of 83 places in 239 ms of which 3 ms to minimize.
SMT process timed out in 10225ms, After SMT, problems are : Problem set: 3 solved, 39 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 10 place count 280 transition count 675
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 150 place count 210 transition count 675
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 154 place count 206 transition count 655
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 206 transition count 655
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 196 place count 187 transition count 636
Applied a total of 196 rules in 188 ms. Remains 187 /285 variables (removed 98) and now considering 636/750 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 187/285 places, 636/750 transitions.
RANDOM walk for 40000 steps (8 resets) in 1015 ms. (39 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
Interrupted probabilistic random walk after 179220 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :14 out of 36
Probabilistic random walk after 179220 steps, saw 50577 distinct states, run finished after 3007 ms. (steps per millisecond=59 ) properties seen :14
[2024-05-24 01:11:29] [INFO ] Flow matrix only has 301 transitions (discarded 335 similar events)
// Phase 1: matrix 301 rows 187 cols
[2024-05-24 01:11:29] [INFO ] Computed 16 invariants in 4 ms
[2024-05-24 01:11:29] [INFO ] State equation strengthened by 140 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 146/187 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:29] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 01:11:29] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 3 ms to minimize.
[2024-05-24 01:11:29] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-24 01:11:29] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 01:11:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 01:11:30] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:30] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:11:30] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:11:30] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:11:30] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:11:31] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 3 ms to minimize.
[2024-05-24 01:11:31] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 3 ms to minimize.
[2024-05-24 01:11:31] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 3 ms to minimize.
[2024-05-24 01:11:31] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:32] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:32] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:32] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:11:33] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:11:33] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 3 ms to minimize.
[2024-05-24 01:11:33] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:33] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 3 ms to minimize.
[2024-05-24 01:11:34] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 301/488 variables, 187/225 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 140/365 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:34] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/488 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 366 constraints, problems are : Problem set: 0 solved, 22 unsolved in 6894 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 187/187 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 146/187 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:36] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 3 ms to minimize.
[2024-05-24 01:11:36] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 3 ms to minimize.
[2024-05-24 01:11:37] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 3 ms to minimize.
[2024-05-24 01:11:37] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 2 ms to minimize.
[2024-05-24 01:11:37] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-05-24 01:11:37] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 3 ms to minimize.
[2024-05-24 01:11:37] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 2 ms to minimize.
[2024-05-24 01:11:37] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
[2024-05-24 01:11:38] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 3 ms to minimize.
[2024-05-24 01:11:38] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 3 ms to minimize.
[2024-05-24 01:11:38] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 4 ms to minimize.
[2024-05-24 01:11:38] [INFO ] Deduced a trap composed of 44 places in 239 ms of which 4 ms to minimize.
[2024-05-24 01:11:39] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 3 ms to minimize.
[2024-05-24 01:11:39] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 3 ms to minimize.
[2024-05-24 01:11:39] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:11:39] [INFO ] Deduced a trap composed of 51 places in 206 ms of which 3 ms to minimize.
[2024-05-24 01:11:39] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:40] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 301/488 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 140/384 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 22/406 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:42] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:43] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:44] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:44] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:11:45] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-24 01:11:45] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:11:46] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/488 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/488 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/488 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 413 constraints, problems are : Problem set: 0 solved, 22 unsolved in 13158 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 187/187 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 48/48 constraints]
After SMT, in 20083ms problems are : Problem set: 0 solved, 22 unsolved
Parikh walk visited 1 properties in 2989 ms.
Support contains 39 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 636/636 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 187 transition count 629
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 180 transition count 629
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 177 transition count 614
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 177 transition count 614
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 176 transition count 613
Applied a total of 22 rules in 43 ms. Remains 176 /187 variables (removed 11) and now considering 613/636 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 176/187 places, 613/636 transitions.
RANDOM walk for 40000 steps (8 resets) in 544 ms. (73 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 217650 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 20
Probabilistic random walk after 217650 steps, saw 54505 distinct states, run finished after 3004 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-24 01:11:55] [INFO ] Flow matrix only has 278 transitions (discarded 335 similar events)
// Phase 1: matrix 278 rows 176 cols
[2024-05-24 01:11:55] [INFO ] Computed 16 invariants in 4 ms
[2024-05-24 01:11:55] [INFO ] State equation strengthened by 128 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 138/176 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:11:56] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
[2024-05-24 01:11:56] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 3 ms to minimize.
[2024-05-24 01:11:56] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-05-24 01:11:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 01:11:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 01:11:56] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:11:56] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-24 01:11:57] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:11:57] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-24 01:11:57] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 3 ms to minimize.
[2024-05-24 01:11:57] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 3 ms to minimize.
[2024-05-24 01:11:57] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 278/454 variables, 176/204 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 128/332 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:11:58] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:11:59] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/454 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 334 constraints, problems are : Problem set: 0 solved, 20 unsolved in 4180 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 176/176 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 138/176 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:00] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 3 ms to minimize.
[2024-05-24 01:12:00] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 3 ms to minimize.
[2024-05-24 01:12:00] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 2 ms to minimize.
[2024-05-24 01:12:01] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 3 ms to minimize.
[2024-05-24 01:12:01] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 2 ms to minimize.
[2024-05-24 01:12:01] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:12:01] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:01] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 3 ms to minimize.
[2024-05-24 01:12:01] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:12:02] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-24 01:12:02] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:12:02] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:02] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 3 ms to minimize.
[2024-05-24 01:12:03] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 3 ms to minimize.
[2024-05-24 01:12:03] [INFO ] Deduced a trap composed of 60 places in 170 ms of which 2 ms to minimize.
[2024-05-24 01:12:03] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:03] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:04] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 278/454 variables, 176/224 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 128/352 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:05] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:06] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/454 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/454 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 0/454 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 374 constraints, problems are : Problem set: 0 solved, 20 unsolved in 8197 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 176/176 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 34/34 constraints]
After SMT, in 12409ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 0 properties in 1831 ms.
Support contains 38 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 613/613 transitions.
Applied a total of 0 rules in 28 ms. Remains 176 /176 variables (removed 0) and now considering 613/613 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 176/176 places, 613/613 transitions.
RANDOM walk for 40000 steps (8 resets) in 592 ms. (67 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 227982 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 20
Probabilistic random walk after 227982 steps, saw 56206 distinct states, run finished after 3004 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-24 01:12:13] [INFO ] Flow matrix only has 278 transitions (discarded 335 similar events)
[2024-05-24 01:12:13] [INFO ] Invariant cache hit.
[2024-05-24 01:12:13] [INFO ] State equation strengthened by 128 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 138/176 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 01:12:14] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-05-24 01:12:14] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 3 ms to minimize.
[2024-05-24 01:12:14] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 01:12:14] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 01:12:14] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:14] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 3 ms to minimize.
[2024-05-24 01:12:14] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 2 ms to minimize.
[2024-05-24 01:12:14] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-24 01:12:15] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-24 01:12:15] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:12:15] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-24 01:12:15] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 3 ms to minimize.
[2024-05-24 01:12:15] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 3 ms to minimize.
[2024-05-24 01:12:15] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 3 ms to minimize.
[2024-05-24 01:12:16] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:16] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 4 ms to minimize.
[2024-05-24 01:12:16] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:12:16] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 3 ms to minimize.
[2024-05-24 01:12:17] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 5 ms to minimize.
[2024-05-24 01:12:17] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 2 ms to minimize.
[2024-05-24 01:12:17] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:12:17] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-05-24 01:12:17] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-24 01:12:17] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 4 ms to minimize.
[2024-05-24 01:12:18] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 3 ms to minimize.
[2024-05-24 01:12:18] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 6 ms to minimize.
[2024-05-24 01:12:18] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 4 ms to minimize.
[2024-05-24 01:12:18] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:18] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:19] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:19] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 278/454 variables, 176/224 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 128/352 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/454 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 352 constraints, problems are : Problem set: 0 solved, 20 unsolved in 6508 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 176/176 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 138/176 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 278/454 variables, 176/224 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 128/352 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:21] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 3 ms to minimize.
[2024-05-24 01:12:21] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 3 ms to minimize.
[2024-05-24 01:12:21] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 01:12:22] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/454 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/454 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 376 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3493 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 176/176 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 36/36 constraints]
After SMT, in 10040ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 0 properties in 2867 ms.
Support contains 38 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 613/613 transitions.
Applied a total of 0 rules in 30 ms. Remains 176 /176 variables (removed 0) and now considering 613/613 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 176/176 places, 613/613 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 613/613 transitions.
Applied a total of 0 rules in 14 ms. Remains 176 /176 variables (removed 0) and now considering 613/613 (removed 0) transitions.
[2024-05-24 01:12:26] [INFO ] Flow matrix only has 278 transitions (discarded 335 similar events)
[2024-05-24 01:12:26] [INFO ] Invariant cache hit.
[2024-05-24 01:12:26] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-24 01:12:26] [INFO ] Flow matrix only has 278 transitions (discarded 335 similar events)
[2024-05-24 01:12:26] [INFO ] Invariant cache hit.
[2024-05-24 01:12:26] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-05-24 01:12:27] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2024-05-24 01:12:27] [INFO ] Redundant transitions in 37 ms returned []
Running 608 sub problems to find dead transitions.
[2024-05-24 01:12:27] [INFO ] Flow matrix only has 278 transitions (discarded 335 similar events)
[2024-05-24 01:12:27] [INFO ] Invariant cache hit.
[2024-05-24 01:12:27] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:12:30] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:12:30] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:12:30] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 2 ms to minimize.
[2024-05-24 01:12:30] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-05-24 01:12:31] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:12:31] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:12:31] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 2 ms to minimize.
[2024-05-24 01:12:31] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 3 ms to minimize.
[2024-05-24 01:12:32] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:12:32] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-05-24 01:12:32] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-24 01:12:32] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:12:32] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:12:32] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 3 ms to minimize.
[2024-05-24 01:12:32] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:12:32] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-24 01:12:33] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-24 01:12:33] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
[2024-05-24 01:12:33] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-24 01:12:33] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:12:34] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2024-05-24 01:12:34] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:12:34] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-24 01:12:34] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:12:34] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-24 01:12:34] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2024-05-24 01:12:35] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-24 01:12:35] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-24 01:12:36] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-24 01:12:36] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-24 01:12:36] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-24 01:12:36] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-24 01:12:36] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-24 01:12:36] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-24 01:12:36] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 01:12:37] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:12:37] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:12:37] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 2 ms to minimize.
[2024-05-24 01:12:37] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:12:37] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:12:41] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-24 01:12:41] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-24 01:12:42] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-24 01:12:42] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-24 01:12:43] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-24 01:12:43] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:12:43] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2024-05-24 01:12:43] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-24 01:12:43] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-24 01:12:43] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 1 ms to minimize.
[2024-05-24 01:12:43] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:12:44] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:12:44] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-24 01:12:45] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:12:46] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-05-24 01:12:46] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-24 01:12:46] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:12:46] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-24 01:12:47] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:12:47] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 2 ms to minimize.
[2024-05-24 01:12:47] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:12:47] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:12:48] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:12:48] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2024-05-24 01:12:48] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:12:49] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-05-24 01:12:49] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:12:49] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:12:49] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 3 ms to minimize.
[2024-05-24 01:12:50] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 3 ms to minimize.
[2024-05-24 01:12:50] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 2 ms to minimize.
[2024-05-24 01:12:50] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-05-24 01:12:51] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
[2024-05-24 01:12:51] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:12:55] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-24 01:12:55] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-05-24 01:12:56] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:12:56] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 2 ms to minimize.
[2024-05-24 01:12:56] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 3 ms to minimize.
[2024-05-24 01:12:56] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-05-24 01:12:56] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 3 ms to minimize.
[2024-05-24 01:12:57] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 3 ms to minimize.
[2024-05-24 01:12:57] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:12:57] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 2 ms to minimize.
SMT process timed out in 30364ms, After SMT, problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 30373ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31148 ms. Remains : 176/176 places, 613/613 transitions.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-24 01:12:57] [INFO ] Flatten gal took : 71 ms
[2024-05-24 01:12:57] [INFO ] Flatten gal took : 88 ms
[2024-05-24 01:12:58] [INFO ] Input system was already deterministic with 750 transitions.
Support contains 85 out of 285 places (down from 86) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 275 transition count 700
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 275 transition count 700
Applied a total of 20 rules in 22 ms. Remains 275 /285 variables (removed 10) and now considering 700/750 (removed 50) transitions.
[2024-05-24 01:12:58] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-24 01:12:58] [INFO ] Computed 16 invariants in 4 ms
[2024-05-24 01:12:58] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-24 01:12:58] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 01:12:58] [INFO ] Invariant cache hit.
[2024-05-24 01:12:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 01:12:59] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-24 01:12:59] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 01:12:59] [INFO ] Invariant cache hit.
[2024-05-24 01:12:59] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 01:13:06] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-24 01:13:06] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 2 ms to minimize.
[2024-05-24 01:13:07] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 4 ms to minimize.
[2024-05-24 01:13:07] [INFO ] Deduced a trap composed of 49 places in 227 ms of which 4 ms to minimize.
[2024-05-24 01:13:07] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 3 ms to minimize.
[2024-05-24 01:13:07] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 3 ms to minimize.
[2024-05-24 01:13:08] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 4 ms to minimize.
[2024-05-24 01:13:08] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 4 ms to minimize.
[2024-05-24 01:13:08] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 3 ms to minimize.
[2024-05-24 01:13:08] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:13:08] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 4 ms to minimize.
[2024-05-24 01:13:09] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-24 01:13:09] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 5 ms to minimize.
[2024-05-24 01:13:10] [INFO ] Deduced a trap composed of 51 places in 260 ms of which 4 ms to minimize.
[2024-05-24 01:13:10] [INFO ] Deduced a trap composed of 72 places in 237 ms of which 3 ms to minimize.
[2024-05-24 01:13:10] [INFO ] Deduced a trap composed of 60 places in 260 ms of which 4 ms to minimize.
[2024-05-24 01:13:11] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 4 ms to minimize.
[2024-05-24 01:13:11] [INFO ] Deduced a trap composed of 54 places in 252 ms of which 4 ms to minimize.
[2024-05-24 01:13:11] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 4 ms to minimize.
[2024-05-24 01:13:11] [INFO ] Deduced a trap composed of 66 places in 247 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 01:13:12] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:13:12] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-05-24 01:13:13] [INFO ] Deduced a trap composed of 57 places in 269 ms of which 4 ms to minimize.
[2024-05-24 01:13:13] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 4 ms to minimize.
[2024-05-24 01:13:14] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 5 ms to minimize.
[2024-05-24 01:13:14] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 4 ms to minimize.
[2024-05-24 01:13:14] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-05-24 01:13:14] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 4 ms to minimize.
[2024-05-24 01:13:15] [INFO ] Deduced a trap composed of 72 places in 220 ms of which 4 ms to minimize.
[2024-05-24 01:13:15] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 4 ms to minimize.
[2024-05-24 01:13:15] [INFO ] Deduced a trap composed of 66 places in 278 ms of which 4 ms to minimize.
[2024-05-24 01:13:15] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 4 ms to minimize.
[2024-05-24 01:13:16] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 3 ms to minimize.
[2024-05-24 01:13:16] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 4 ms to minimize.
[2024-05-24 01:13:16] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-05-24 01:13:16] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-05-24 01:13:16] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 01:13:17] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-24 01:13:17] [INFO ] Deduced a trap composed of 64 places in 320 ms of which 5 ms to minimize.
[2024-05-24 01:13:18] [INFO ] Deduced a trap composed of 32 places in 329 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 01:13:26] [INFO ] Deduced a trap composed of 77 places in 307 ms of which 5 ms to minimize.
[2024-05-24 01:13:26] [INFO ] Deduced a trap composed of 86 places in 260 ms of which 4 ms to minimize.
[2024-05-24 01:13:26] [INFO ] Deduced a trap composed of 71 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:13:26] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 4 ms to minimize.
[2024-05-24 01:13:27] [INFO ] Deduced a trap composed of 56 places in 255 ms of which 4 ms to minimize.
[2024-05-24 01:13:27] [INFO ] Deduced a trap composed of 54 places in 248 ms of which 4 ms to minimize.
[2024-05-24 01:13:27] [INFO ] Deduced a trap composed of 61 places in 263 ms of which 4 ms to minimize.
[2024-05-24 01:13:28] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 4 ms to minimize.
[2024-05-24 01:13:28] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 4 ms to minimize.
[2024-05-24 01:13:29] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 4 ms to minimize.
[2024-05-24 01:13:29] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 4 ms to minimize.
[2024-05-24 01:13:29] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 4 ms to minimize.
SMT process timed out in 30306ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 30314ms
Starting structural reductions in LTL mode, iteration 1 : 275/285 places, 700/750 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31479 ms. Remains : 275/285 places, 700/750 transitions.
[2024-05-24 01:13:29] [INFO ] Flatten gal took : 53 ms
[2024-05-24 01:13:29] [INFO ] Flatten gal took : 48 ms
[2024-05-24 01:13:29] [INFO ] Input system was already deterministic with 700 transitions.
[2024-05-24 01:13:29] [INFO ] Flatten gal took : 45 ms
[2024-05-24 01:13:29] [INFO ] Flatten gal took : 44 ms
[2024-05-24 01:13:29] [INFO ] Time to serialize gal into /tmp/CTLFireability12481412817027179682.gal : 42 ms
[2024-05-24 01:13:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5260940153474189452.ctl : 5 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/CTLFireability12481412817027179682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5260940153474189452.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-24 01:14:00] [INFO ] Flatten gal took : 40 ms
[2024-05-24 01:14:00] [INFO ] Applying decomposition
[2024-05-24 01:14:00] [INFO ] Flatten gal took : 41 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/graph11131315548774637757.txt' '-o' '/tmp/graph11131315548774637757.bin' '-w' '/tmp/graph11131315548774637757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11131315548774637757.bin' '-l' '-1' '-v' '-w' '/tmp/graph11131315548774637757.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:14:00] [INFO ] Decomposing Gal with order
[2024-05-24 01:14:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:14:00] [INFO ] Removed a total of 1062 redundant transitions.
[2024-05-24 01:14:00] [INFO ] Flatten gal took : 232 ms
[2024-05-24 01:14:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 253 labels/synchronizations in 53 ms.
[2024-05-24 01:14:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11362028889509039250.gal : 21 ms
[2024-05-24 01:14:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9432244523347239334.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/CTLFireability11362028889509039250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9432244523347239334.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 10 place count 280 transition count 668
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 164 place count 203 transition count 668
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 173 place count 194 transition count 623
Iterating global reduction 2 with 9 rules applied. Total rules applied 182 place count 194 transition count 623
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 220 place count 175 transition count 604
Applied a total of 220 rules in 58 ms. Remains 175 /285 variables (removed 110) and now considering 604/750 (removed 146) transitions.
[2024-05-24 01:14:31] [INFO ] Flow matrix only has 269 transitions (discarded 335 similar events)
// Phase 1: matrix 269 rows 175 cols
[2024-05-24 01:14:31] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 01:14:31] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-24 01:14:31] [INFO ] Flow matrix only has 269 transitions (discarded 335 similar events)
[2024-05-24 01:14:31] [INFO ] Invariant cache hit.
[2024-05-24 01:14:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 01:14:31] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2024-05-24 01:14:31] [INFO ] Redundant transitions in 8 ms returned []
Running 599 sub problems to find dead transitions.
[2024-05-24 01:14:31] [INFO ] Flow matrix only has 269 transitions (discarded 335 similar events)
[2024-05-24 01:14:31] [INFO ] Invariant cache hit.
[2024-05-24 01:14:32] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-05-24 01:14:36] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 3 ms to minimize.
[2024-05-24 01:14:36] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 01:14:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 01:14:36] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-24 01:14:36] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 3 ms to minimize.
[2024-05-24 01:14:36] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 3 ms to minimize.
[2024-05-24 01:14:36] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 2 ms to minimize.
[2024-05-24 01:14:37] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:14:37] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 7 ms to minimize.
[2024-05-24 01:14:37] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:14:37] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 2 ms to minimize.
[2024-05-24 01:14:37] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-05-24 01:14:37] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 3 ms to minimize.
[2024-05-24 01:14:38] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2024-05-24 01:14:38] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2024-05-24 01:14:38] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 2 ms to minimize.
[2024-05-24 01:14:38] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:14:38] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:14:38] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 2 ms to minimize.
[2024-05-24 01:14:38] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-05-24 01:14:39] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-24 01:14:39] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:14:40] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:14:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-24 01:14:40] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-24 01:14:40] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:14:41] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:14:41] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-05-24 01:14:41] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-24 01:14:42] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:14:42] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-24 01:14:42] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-24 01:14:42] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-05-24 01:14:43] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 2 ms to minimize.
[2024-05-24 01:14:43] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-24 01:14:43] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-24 01:14:43] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-24 01:14:43] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-24 01:14:43] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 1 ms to minimize.
[2024-05-24 01:14:43] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-05-24 01:14:47] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:14:47] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-24 01:14:47] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:14:47] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-24 01:14:47] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:14:48] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 3 ms to minimize.
[2024-05-24 01:14:48] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-24 01:14:48] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-24 01:14:48] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-24 01:14:48] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-05-24 01:14:48] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-24 01:14:48] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:14:49] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:14:49] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-05-24 01:14:49] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:14:49] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 2 ms to minimize.
[2024-05-24 01:14:50] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-24 01:14:50] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:14:50] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:14:50] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-05-24 01:14:51] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:14:51] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:14:51] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-24 01:14:51] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 2 ms to minimize.
[2024-05-24 01:14:51] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:14:51] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-24 01:14:52] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:14:52] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:14:52] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:14:52] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:14:53] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:14:53] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-05-24 01:14:53] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:14:53] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-05-24 01:14:53] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 01:14:53] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-24 01:14:54] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-24 01:14:54] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:14:54] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:14:54] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-05-24 01:14:55] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-24 01:14:55] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2024-05-24 01:14:55] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:14:57] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2024-05-24 01:14:57] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-24 01:14:57] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:14:57] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:14:57] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 1 ms to minimize.
[2024-05-24 01:14:57] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-24 01:14:57] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:14:58] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-24 01:14:58] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 1 ms to minimize.
[2024-05-24 01:14:59] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/444 variables, and 116 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/175 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-05-24 01:15:04] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 2 ms to minimize.
[2024-05-24 01:15:04] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-05-24 01:15:04] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-24 01:15:04] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:15:04] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-24 01:15:05] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-24 01:15:05] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:15:05] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2024-05-24 01:15:05] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-05-24 01:15:05] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:15:05] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 3 ms to minimize.
[2024-05-24 01:15:05] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 3 ms to minimize.
[2024-05-24 01:15:06] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-24 01:15:06] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:15:06] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:15:06] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:15:06] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-24 01:15:06] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-24 01:15:07] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:15:07] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-05-24 01:15:11] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:15:11] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2024-05-24 01:15:11] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 2 ms to minimize.
[2024-05-24 01:15:11] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:15:11] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:15:12] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 3 ms to minimize.
[2024-05-24 01:15:12] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:15:13] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-05-24 01:15:17] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2024-05-24 01:15:17] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 1 ms to minimize.
[2024-05-24 01:15:17] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:15:17] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:15:17] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
[2024-05-24 01:15:17] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:15:17] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:15:18] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:15:18] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:15:18] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:15:18] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:15:18] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:15:18] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2024-05-24 01:15:19] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-24 01:15:19] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2024-05-24 01:15:19] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:15:19] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:15:20] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-24 01:15:21] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-24 01:15:21] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-05-24 01:15:22] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:15:22] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:15:22] [INFO ] Deduced a trap composed of 58 places in 192 ms of which 3 ms to minimize.
[2024-05-24 01:15:22] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 2 ms to minimize.
[2024-05-24 01:15:23] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:15:23] [INFO ] Deduced a trap composed of 56 places in 222 ms of which 3 ms to minimize.
[2024-05-24 01:15:23] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 3 ms to minimize.
[2024-05-24 01:15:23] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:15:24] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-24 01:15:24] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 3 ms to minimize.
[2024-05-24 01:15:24] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:15:24] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 2 ms to minimize.
[2024-05-24 01:15:24] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:15:25] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 3 ms to minimize.
[2024-05-24 01:15:25] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 3 ms to minimize.
[2024-05-24 01:15:25] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
[2024-05-24 01:15:25] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-05-24 01:15:25] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:15:26] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 2 ms to minimize.
[2024-05-24 01:15:26] [INFO ] Deduced a trap composed of 58 places in 184 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-05-24 01:15:27] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2024-05-24 01:15:27] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 3 ms to minimize.
[2024-05-24 01:15:28] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-05-24 01:15:28] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:15:28] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-05-24 01:15:28] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 175/444 variables, and 190 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/175 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/599 constraints, Known Traps: 174/174 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Starting structural reductions in SI_CTL mode, iteration 1 : 175/285 places, 604/750 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61425 ms. Remains : 175/285 places, 604/750 transitions.
[2024-05-24 01:15:32] [INFO ] Flatten gal took : 33 ms
[2024-05-24 01:15:32] [INFO ] Flatten gal took : 35 ms
[2024-05-24 01:15:32] [INFO ] Input system was already deterministic with 604 transitions.
[2024-05-24 01:15:32] [INFO ] Flatten gal took : 34 ms
[2024-05-24 01:15:32] [INFO ] Flatten gal took : 36 ms
[2024-05-24 01:15:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12686662283945510940.gal : 8 ms
[2024-05-24 01:15:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10237469629318435314.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/CTLFireability12686662283945510940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10237469629318435314.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-24 01:16:02] [INFO ] Flatten gal took : 20 ms
[2024-05-24 01:16:02] [INFO ] Applying decomposition
[2024-05-24 01:16:02] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5082727171894274802.txt' '-o' '/tmp/graph5082727171894274802.bin' '-w' '/tmp/graph5082727171894274802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5082727171894274802.bin' '-l' '-1' '-v' '-w' '/tmp/graph5082727171894274802.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:16:02] [INFO ] Decomposing Gal with order
[2024-05-24 01:16:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:16:02] [INFO ] Removed a total of 1010 redundant transitions.
[2024-05-24 01:16:02] [INFO ] Flatten gal took : 55 ms
[2024-05-24 01:16:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 19 ms.
[2024-05-24 01:16:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8879091391384604111.gal : 7 ms
[2024-05-24 01:16:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10717536914496720182.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/CTLFireability8879091391384604111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10717536914496720182.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 280 transition count 667
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 202 transition count 667
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 173 place count 195 transition count 632
Iterating global reduction 2 with 7 rules applied. Total rules applied 180 place count 195 transition count 632
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 218 place count 176 transition count 613
Applied a total of 218 rules in 55 ms. Remains 176 /285 variables (removed 109) and now considering 613/750 (removed 137) transitions.
[2024-05-24 01:16:33] [INFO ] Flow matrix only has 278 transitions (discarded 335 similar events)
// Phase 1: matrix 278 rows 176 cols
[2024-05-24 01:16:33] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 01:16:33] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-24 01:16:33] [INFO ] Flow matrix only has 278 transitions (discarded 335 similar events)
[2024-05-24 01:16:33] [INFO ] Invariant cache hit.
[2024-05-24 01:16:33] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-05-24 01:16:34] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2024-05-24 01:16:34] [INFO ] Redundant transitions in 5 ms returned []
Running 608 sub problems to find dead transitions.
[2024-05-24 01:16:34] [INFO ] Flow matrix only has 278 transitions (discarded 335 similar events)
[2024-05-24 01:16:34] [INFO ] Invariant cache hit.
[2024-05-24 01:16:34] [INFO ] State equation strengthened by 128 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:16:38] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:16:38] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-24 01:16:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 01:16:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-24 01:16:39] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-24 01:16:39] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2024-05-24 01:16:39] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:16:39] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:16:39] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2024-05-24 01:16:40] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:16:40] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-24 01:16:40] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 01:16:40] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:16:40] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:16:40] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 01:16:40] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:16:40] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:16:41] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:16:41] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:16:41] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:16:42] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:16:42] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:16:43] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-24 01:16:43] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 2 ms to minimize.
[2024-05-24 01:16:44] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 2 ms to minimize.
[2024-05-24 01:16:44] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:16:44] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:16:44] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 5 ms to minimize.
[2024-05-24 01:16:44] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:16:44] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:16:45] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-05-24 01:16:45] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:16:45] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:16:45] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-24 01:16:45] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-24 01:16:45] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-24 01:16:46] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2024-05-24 01:16:46] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-24 01:16:46] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:16:51] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:16:52] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:16:53] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:16:55] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:16:55] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:16:55] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-05-24 01:16:55] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-05-24 01:16:55] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-24 01:16:56] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:16:56] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 2 ms to minimize.
[2024-05-24 01:16:56] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 3 ms to minimize.
[2024-05-24 01:16:56] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:16:57] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:16:57] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:16:57] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 3 ms to minimize.
[2024-05-24 01:16:58] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:16:59] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-05-24 01:16:59] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:16:59] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 5 ms to minimize.
[2024-05-24 01:17:00] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:17:00] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:17:00] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 3 ms to minimize.
[2024-05-24 01:17:02] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/454 variables, and 78 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/176 constraints, ReadFeed: 0/128 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 62/78 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:17:06] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 2 ms to minimize.
[2024-05-24 01:17:06] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-05-24 01:17:09] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2024-05-24 01:17:09] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 2 ms to minimize.
[2024-05-24 01:17:09] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:17:09] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 3 ms to minimize.
[2024-05-24 01:17:10] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 3 ms to minimize.
[2024-05-24 01:17:12] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:17:16] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 2 ms to minimize.
[2024-05-24 01:17:16] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2024-05-24 01:17:16] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:17:16] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-24 01:17:17] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:17:18] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:17:18] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-24 01:17:18] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-24 01:17:18] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 6 ms to minimize.
[2024-05-24 01:17:18] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 10/96 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:17:21] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:17:21] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-05-24 01:17:21] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:17:26] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-05-24 01:17:27] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 2 ms to minimize.
[2024-05-24 01:17:27] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 2 ms to minimize.
[2024-05-24 01:17:27] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:17:27] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:17:28] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-24 01:17:34] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
SMT process timed out in 60370ms, After SMT, problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Starting structural reductions in SI_CTL mode, iteration 1 : 176/285 places, 613/750 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61497 ms. Remains : 176/285 places, 613/750 transitions.
[2024-05-24 01:17:34] [INFO ] Flatten gal took : 27 ms
[2024-05-24 01:17:34] [INFO ] Flatten gal took : 30 ms
[2024-05-24 01:17:34] [INFO ] Input system was already deterministic with 613 transitions.
[2024-05-24 01:17:34] [INFO ] Flatten gal took : 35 ms
[2024-05-24 01:17:34] [INFO ] Flatten gal took : 28 ms
[2024-05-24 01:17:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15264112125929636601.gal : 7 ms
[2024-05-24 01:17:34] [INFO ] Time to serialize properties into /tmp/CTLFireability3476082630925951182.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/CTLFireability15264112125929636601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3476082630925951182.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-24 01:18:04] [INFO ] Flatten gal took : 19 ms
[2024-05-24 01:18:04] [INFO ] Applying decomposition
[2024-05-24 01:18:04] [INFO ] Flatten gal took : 18 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/graph1497993417099019557.txt' '-o' '/tmp/graph1497993417099019557.bin' '-w' '/tmp/graph1497993417099019557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1497993417099019557.bin' '-l' '-1' '-v' '-w' '/tmp/graph1497993417099019557.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:18:04] [INFO ] Decomposing Gal with order
[2024-05-24 01:18:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:18:05] [INFO ] Removed a total of 995 redundant transitions.
[2024-05-24 01:18:05] [INFO ] Flatten gal took : 83 ms
[2024-05-24 01:18:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 243 labels/synchronizations in 33 ms.
[2024-05-24 01:18:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4519239278135510294.gal : 11 ms
[2024-05-24 01:18:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14114426119685938075.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/CTLFireability4519239278135510294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14114426119685938075.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 280 transition count 666
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 201 transition count 666
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 177 place count 192 transition count 621
Iterating global reduction 2 with 9 rules applied. Total rules applied 186 place count 192 transition count 621
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 226 place count 172 transition count 601
Applied a total of 226 rules in 43 ms. Remains 172 /285 variables (removed 113) and now considering 601/750 (removed 149) transitions.
[2024-05-24 01:18:35] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
// Phase 1: matrix 266 rows 172 cols
[2024-05-24 01:18:35] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 01:18:35] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-24 01:18:35] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2024-05-24 01:18:35] [INFO ] Invariant cache hit.
[2024-05-24 01:18:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 01:18:36] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2024-05-24 01:18:36] [INFO ] Redundant transitions in 5 ms returned []
Running 596 sub problems to find dead transitions.
[2024-05-24 01:18:36] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2024-05-24 01:18:36] [INFO ] Invariant cache hit.
[2024-05-24 01:18:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-05-24 01:18:40] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 3 ms to minimize.
[2024-05-24 01:18:41] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-24 01:18:41] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 01:18:41] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-05-24 01:18:41] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 2 ms to minimize.
[2024-05-24 01:18:41] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 2 ms to minimize.
[2024-05-24 01:18:41] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2024-05-24 01:18:41] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:18:42] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-24 01:18:42] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-05-24 01:18:43] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 3 ms to minimize.
[2024-05-24 01:18:43] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 01:18:43] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 2 ms to minimize.
[2024-05-24 01:18:43] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:18:43] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-05-24 01:18:43] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:18:44] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-24 01:18:44] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 2 ms to minimize.
[2024-05-24 01:18:44] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 2 ms to minimize.
[2024-05-24 01:18:44] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-05-24 01:18:44] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
[2024-05-24 01:18:46] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:18:46] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-05-24 01:18:47] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 2 ms to minimize.
[2024-05-24 01:18:47] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-05-24 01:18:47] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-05-24 01:18:47] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 3 ms to minimize.
[2024-05-24 01:18:47] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:18:47] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2024-05-24 01:18:48] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:18:48] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-24 01:18:48] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 3 ms to minimize.
[2024-05-24 01:18:48] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 3 ms to minimize.
[2024-05-24 01:18:48] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 3 ms to minimize.
[2024-05-24 01:18:49] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:18:49] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:18:49] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:18:49] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 3 ms to minimize.
[2024-05-24 01:18:49] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 2 ms to minimize.
[2024-05-24 01:18:50] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-05-24 01:18:56] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-24 01:18:57] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 2 ms to minimize.
[2024-05-24 01:18:57] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 3 ms to minimize.
[2024-05-24 01:18:57] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:18:58] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:18:58] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-24 01:18:58] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 2 ms to minimize.
[2024-05-24 01:18:58] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 3 ms to minimize.
[2024-05-24 01:18:58] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-24 01:18:59] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:18:59] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2024-05-24 01:18:59] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 3 ms to minimize.
[2024-05-24 01:18:59] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
[2024-05-24 01:18:59] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 2 ms to minimize.
[2024-05-24 01:19:00] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 2 ms to minimize.
[2024-05-24 01:19:00] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 3 ms to minimize.
[2024-05-24 01:19:00] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2024-05-24 01:19:00] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 3 ms to minimize.
[2024-05-24 01:19:02] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:19:02] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-05-24 01:19:05] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2024-05-24 01:19:05] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 172/438 variables, and 78 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/172 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 62/78 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-05-24 01:19:11] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 3 ms to minimize.
[2024-05-24 01:19:11] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 2 ms to minimize.
[2024-05-24 01:19:11] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 3 ms to minimize.
[2024-05-24 01:19:11] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 3 ms to minimize.
[2024-05-24 01:19:11] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 3 ms to minimize.
[2024-05-24 01:19:12] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-05-24 01:19:12] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-24 01:19:12] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 2 ms to minimize.
[2024-05-24 01:19:13] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 2 ms to minimize.
[2024-05-24 01:19:13] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
[2024-05-24 01:19:13] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 3 ms to minimize.
[2024-05-24 01:19:14] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 2 ms to minimize.
[2024-05-24 01:19:14] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
[2024-05-24 01:19:15] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:19:15] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 2 ms to minimize.
[2024-05-24 01:19:15] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 3 ms to minimize.
[2024-05-24 01:19:16] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 4 ms to minimize.
[2024-05-24 01:19:16] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 3 ms to minimize.
[2024-05-24 01:19:16] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:19:16] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-05-24 01:19:20] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 2 ms to minimize.
[2024-05-24 01:19:21] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
[2024-05-24 01:19:21] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 2 ms to minimize.
[2024-05-24 01:19:21] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2024-05-24 01:19:23] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 2 ms to minimize.
[2024-05-24 01:19:23] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 3 ms to minimize.
[2024-05-24 01:19:23] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 2 ms to minimize.
[2024-05-24 01:19:23] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 2 ms to minimize.
[2024-05-24 01:19:23] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 3 ms to minimize.
[2024-05-24 01:19:24] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 3 ms to minimize.
[2024-05-24 01:19:24] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-05-24 01:19:24] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-05-24 01:19:30] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 2 ms to minimize.
[2024-05-24 01:19:31] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2024-05-24 01:19:31] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:19:31] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:19:31] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:19:31] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:19:32] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-24 01:19:32] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-24 01:19:32] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-24 01:19:32] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-05-24 01:19:34] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-24 01:19:34] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-24 01:19:34] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-24 01:19:34] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-05-24 01:19:35] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:19:35] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-05-24 01:19:35] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:19:35] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-24 01:19:35] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2024-05-24 01:19:36] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:19:36] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2024-05-24 01:19:36] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 1 ms to minimize.
SMT process timed out in 60248ms, After SMT, problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Starting structural reductions in SI_CTL mode, iteration 1 : 172/285 places, 601/750 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61173 ms. Remains : 172/285 places, 601/750 transitions.
[2024-05-24 01:19:36] [INFO ] Flatten gal took : 16 ms
[2024-05-24 01:19:36] [INFO ] Flatten gal took : 17 ms
[2024-05-24 01:19:36] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-24 01:19:36] [INFO ] Flatten gal took : 21 ms
[2024-05-24 01:19:36] [INFO ] Flatten gal took : 19 ms
[2024-05-24 01:19:36] [INFO ] Time to serialize gal into /tmp/CTLFireability427217963225608910.gal : 4 ms
[2024-05-24 01:19:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12997177952460692537.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/CTLFireability427217963225608910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12997177952460692537.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-24 01:20:06] [INFO ] Flatten gal took : 17 ms
[2024-05-24 01:20:06] [INFO ] Applying decomposition
[2024-05-24 01:20:06] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14037011786300797251.txt' '-o' '/tmp/graph14037011786300797251.bin' '-w' '/tmp/graph14037011786300797251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14037011786300797251.bin' '-l' '-1' '-v' '-w' '/tmp/graph14037011786300797251.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:20:06] [INFO ] Decomposing Gal with order
[2024-05-24 01:20:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:20:06] [INFO ] Removed a total of 1006 redundant transitions.
[2024-05-24 01:20:06] [INFO ] Flatten gal took : 60 ms
[2024-05-24 01:20:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 227 labels/synchronizations in 19 ms.
[2024-05-24 01:20:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7505456225559212020.gal : 6 ms
[2024-05-24 01:20:06] [INFO ] Time to serialize properties into /tmp/CTLFireability2229846719183328086.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/CTLFireability7505456225559212020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2229846719183328086.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 280 transition count 667
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 202 transition count 667
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 174 place count 194 transition count 627
Iterating global reduction 2 with 8 rules applied. Total rules applied 182 place count 194 transition count 627
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 222 place count 174 transition count 607
Applied a total of 222 rules in 46 ms. Remains 174 /285 variables (removed 111) and now considering 607/750 (removed 143) transitions.
[2024-05-24 01:20:36] [INFO ] Flow matrix only has 272 transitions (discarded 335 similar events)
// Phase 1: matrix 272 rows 174 cols
[2024-05-24 01:20:36] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 01:20:37] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-24 01:20:37] [INFO ] Flow matrix only has 272 transitions (discarded 335 similar events)
[2024-05-24 01:20:37] [INFO ] Invariant cache hit.
[2024-05-24 01:20:37] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-24 01:20:38] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2024-05-24 01:20:38] [INFO ] Redundant transitions in 8 ms returned []
Running 602 sub problems to find dead transitions.
[2024-05-24 01:20:38] [INFO ] Flow matrix only has 272 transitions (discarded 335 similar events)
[2024-05-24 01:20:38] [INFO ] Invariant cache hit.
[2024-05-24 01:20:38] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-24 01:20:43] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 3 ms to minimize.
[2024-05-24 01:20:43] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-24 01:20:43] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-24 01:20:43] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 01:20:43] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 01:20:43] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-05-24 01:20:43] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2024-05-24 01:20:43] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 3 ms to minimize.
[2024-05-24 01:20:44] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 2 ms to minimize.
[2024-05-24 01:20:44] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 01:20:44] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:20:45] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 3 ms to minimize.
[2024-05-24 01:20:45] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 2 ms to minimize.
[2024-05-24 01:20:45] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 3 ms to minimize.
[2024-05-24 01:20:45] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 3 ms to minimize.
[2024-05-24 01:20:46] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:20:46] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-05-24 01:20:46] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:20:46] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 01:20:46] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-24 01:20:47] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:20:48] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 2 ms to minimize.
[2024-05-24 01:20:48] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:20:48] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-05-24 01:20:48] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:20:48] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 01:20:49] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-24 01:20:49] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-24 01:20:49] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:20:50] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:20:51] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:20:51] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:20:51] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:20:51] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 3 ms to minimize.
[2024-05-24 01:20:52] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:20:52] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 2 ms to minimize.
[2024-05-24 01:20:52] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:20:53] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:20:53] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:20:54] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-24 01:20:59] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:20:59] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 3 ms to minimize.
[2024-05-24 01:20:59] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-05-24 01:20:59] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:20:59] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 3 ms to minimize.
[2024-05-24 01:21:00] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
[2024-05-24 01:21:00] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 3 ms to minimize.
[2024-05-24 01:21:00] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2024-05-24 01:21:00] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-05-24 01:21:01] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2024-05-24 01:21:01] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-05-24 01:21:01] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:21:01] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 3 ms to minimize.
[2024-05-24 01:21:02] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:21:02] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 3 ms to minimize.
[2024-05-24 01:21:02] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 3 ms to minimize.
[2024-05-24 01:21:02] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 3 ms to minimize.
[2024-05-24 01:21:03] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 3 ms to minimize.
[2024-05-24 01:21:03] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 2 ms to minimize.
[2024-05-24 01:21:03] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-24 01:21:04] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 3 ms to minimize.
[2024-05-24 01:21:05] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 2 ms to minimize.
[2024-05-24 01:21:05] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:21:05] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 3 ms to minimize.
[2024-05-24 01:21:06] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 3 ms to minimize.
[2024-05-24 01:21:06] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:21:06] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:21:06] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2024-05-24 01:21:06] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:21:07] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 3 ms to minimize.
[2024-05-24 01:21:07] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 2 ms to minimize.
[2024-05-24 01:21:07] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:21:08] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 3 ms to minimize.
[2024-05-24 01:21:08] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 3 ms to minimize.
SMT process timed out in 30476ms, After SMT, problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 30490ms
Starting structural reductions in SI_CTL mode, iteration 1 : 174/285 places, 607/750 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31649 ms. Remains : 174/285 places, 607/750 transitions.
[2024-05-24 01:21:08] [INFO ] Flatten gal took : 29 ms
[2024-05-24 01:21:08] [INFO ] Flatten gal took : 28 ms
[2024-05-24 01:21:08] [INFO ] Input system was already deterministic with 607 transitions.
[2024-05-24 01:21:08] [INFO ] Flatten gal took : 28 ms
[2024-05-24 01:21:08] [INFO ] Flatten gal took : 29 ms
[2024-05-24 01:21:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15403999162959319737.gal : 6 ms
[2024-05-24 01:21:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6978789945433598951.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/CTLFireability15403999162959319737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6978789945433598951.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-24 01:21:38] [INFO ] Flatten gal took : 15 ms
[2024-05-24 01:21:38] [INFO ] Applying decomposition
[2024-05-24 01:21:38] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10121661319597666984.txt' '-o' '/tmp/graph10121661319597666984.bin' '-w' '/tmp/graph10121661319597666984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10121661319597666984.bin' '-l' '-1' '-v' '-w' '/tmp/graph10121661319597666984.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:21:38] [INFO ] Decomposing Gal with order
[2024-05-24 01:21:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:21:38] [INFO ] Removed a total of 1021 redundant transitions.
[2024-05-24 01:21:38] [INFO ] Flatten gal took : 45 ms
[2024-05-24 01:21:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 14 ms.
[2024-05-24 01:21:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9917122168551617762.gal : 6 ms
[2024-05-24 01:21:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5302208293992757578.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/CTLFireability9917122168551617762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5302208293992757578.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 276 transition count 705
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 276 transition count 705
Applied a total of 18 rules in 7 ms. Remains 276 /285 variables (removed 9) and now considering 705/750 (removed 45) transitions.
[2024-05-24 01:22:09] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2024-05-24 01:22:09] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 01:22:09] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-24 01:22:09] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 01:22:09] [INFO ] Invariant cache hit.
[2024-05-24 01:22:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 01:22:10] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-05-24 01:22:10] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 01:22:10] [INFO ] Invariant cache hit.
[2024-05-24 01:22:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:22:14] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-24 01:22:14] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-24 01:22:14] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 2 ms to minimize.
[2024-05-24 01:22:15] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
[2024-05-24 01:22:15] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2024-05-24 01:22:15] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:22:15] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:22:15] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-24 01:22:15] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:22:15] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-05-24 01:22:15] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-24 01:22:16] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:22:16] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 3 ms to minimize.
[2024-05-24 01:22:16] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:22:17] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 3 ms to minimize.
[2024-05-24 01:22:17] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 3 ms to minimize.
[2024-05-24 01:22:17] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2024-05-24 01:22:17] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 2 ms to minimize.
[2024-05-24 01:22:17] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2024-05-24 01:22:17] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:22:18] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 01:22:18] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-24 01:22:18] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-24 01:22:18] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 2 ms to minimize.
[2024-05-24 01:22:19] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:22:19] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 3 ms to minimize.
[2024-05-24 01:22:19] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:22:19] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:22:19] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 2 ms to minimize.
[2024-05-24 01:22:19] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2024-05-24 01:22:20] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 2 ms to minimize.
[2024-05-24 01:22:20] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:22:20] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 10 ms to minimize.
[2024-05-24 01:22:20] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-05-24 01:22:20] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 3 ms to minimize.
[2024-05-24 01:22:20] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:22:20] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 3 ms to minimize.
[2024-05-24 01:22:21] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:22:21] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:22:21] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:22:25] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 01:22:26] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:22:26] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:22:26] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 3 ms to minimize.
[2024-05-24 01:22:26] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 3 ms to minimize.
[2024-05-24 01:22:26] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-05-24 01:22:27] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 3 ms to minimize.
[2024-05-24 01:22:27] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 2 ms to minimize.
[2024-05-24 01:22:27] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 2 ms to minimize.
[2024-05-24 01:22:27] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:22:27] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-24 01:22:28] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-05-24 01:22:28] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:22:28] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 3 ms to minimize.
[2024-05-24 01:22:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 01:22:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 01:22:28] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-24 01:22:29] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 3 ms to minimize.
[2024-05-24 01:22:29] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 4 ms to minimize.
[2024-05-24 01:22:29] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:22:30] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 3 ms to minimize.
[2024-05-24 01:22:30] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 4 ms to minimize.
[2024-05-24 01:22:31] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 4 ms to minimize.
[2024-05-24 01:22:31] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 4 ms to minimize.
[2024-05-24 01:22:31] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 4 ms to minimize.
[2024-05-24 01:22:32] [INFO ] Deduced a trap composed of 66 places in 211 ms of which 4 ms to minimize.
[2024-05-24 01:22:32] [INFO ] Deduced a trap composed of 63 places in 248 ms of which 4 ms to minimize.
[2024-05-24 01:22:32] [INFO ] Deduced a trap composed of 62 places in 229 ms of which 3 ms to minimize.
[2024-05-24 01:22:33] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 4 ms to minimize.
[2024-05-24 01:22:33] [INFO ] Deduced a trap composed of 75 places in 301 ms of which 5 ms to minimize.
[2024-05-24 01:22:34] [INFO ] Deduced a trap composed of 62 places in 298 ms of which 4 ms to minimize.
[2024-05-24 01:22:34] [INFO ] Deduced a trap composed of 48 places in 266 ms of which 4 ms to minimize.
[2024-05-24 01:22:37] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 4 ms to minimize.
[2024-05-24 01:22:37] [INFO ] Deduced a trap composed of 52 places in 300 ms of which 4 ms to minimize.
[2024-05-24 01:22:38] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:22:38] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 2 ms to minimize.
[2024-05-24 01:22:38] [INFO ] Deduced a trap composed of 72 places in 287 ms of which 5 ms to minimize.
[2024-05-24 01:22:38] [INFO ] Deduced a trap composed of 55 places in 269 ms of which 5 ms to minimize.
[2024-05-24 01:22:39] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 4 ms to minimize.
[2024-05-24 01:22:39] [INFO ] Deduced a trap composed of 65 places in 260 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/646 variables, and 96 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/276 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:22:43] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 3 ms to minimize.
[2024-05-24 01:22:43] [INFO ] Deduced a trap composed of 60 places in 233 ms of which 3 ms to minimize.
[2024-05-24 01:22:43] [INFO ] Deduced a trap composed of 73 places in 238 ms of which 4 ms to minimize.
[2024-05-24 01:22:44] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 4 ms to minimize.
[2024-05-24 01:22:44] [INFO ] Deduced a trap composed of 62 places in 230 ms of which 4 ms to minimize.
[2024-05-24 01:22:45] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:22:47] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 5 ms to minimize.
[2024-05-24 01:22:48] [INFO ] Deduced a trap composed of 73 places in 306 ms of which 5 ms to minimize.
[2024-05-24 01:22:48] [INFO ] Deduced a trap composed of 55 places in 237 ms of which 4 ms to minimize.
[2024-05-24 01:22:48] [INFO ] Deduced a trap composed of 53 places in 265 ms of which 4 ms to minimize.
[2024-05-24 01:22:49] [INFO ] Deduced a trap composed of 49 places in 272 ms of which 4 ms to minimize.
[2024-05-24 01:22:49] [INFO ] Deduced a trap composed of 54 places in 259 ms of which 4 ms to minimize.
[2024-05-24 01:22:49] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 4 ms to minimize.
[2024-05-24 01:22:49] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 4 ms to minimize.
[2024-05-24 01:22:50] [INFO ] Deduced a trap composed of 48 places in 258 ms of which 4 ms to minimize.
[2024-05-24 01:22:50] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 4 ms to minimize.
[2024-05-24 01:22:50] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 5 ms to minimize.
[2024-05-24 01:22:50] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:22:51] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 4 ms to minimize.
[2024-05-24 01:22:51] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:22:53] [INFO ] Deduced a trap composed of 53 places in 290 ms of which 5 ms to minimize.
[2024-05-24 01:22:53] [INFO ] Deduced a trap composed of 62 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:22:54] [INFO ] Deduced a trap composed of 83 places in 250 ms of which 4 ms to minimize.
[2024-05-24 01:22:54] [INFO ] Deduced a trap composed of 89 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:22:54] [INFO ] Deduced a trap composed of 73 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:22:55] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 4 ms to minimize.
[2024-05-24 01:22:55] [INFO ] Deduced a trap composed of 63 places in 238 ms of which 4 ms to minimize.
[2024-05-24 01:22:55] [INFO ] Deduced a trap composed of 38 places in 222 ms of which 4 ms to minimize.
[2024-05-24 01:22:55] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 4 ms to minimize.
[2024-05-24 01:22:56] [INFO ] Deduced a trap composed of 59 places in 242 ms of which 4 ms to minimize.
[2024-05-24 01:22:57] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:22:59] [INFO ] Deduced a trap composed of 80 places in 299 ms of which 5 ms to minimize.
[2024-05-24 01:22:59] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 4 ms to minimize.
[2024-05-24 01:23:00] [INFO ] Deduced a trap composed of 81 places in 224 ms of which 3 ms to minimize.
[2024-05-24 01:23:01] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 3 ms to minimize.
[2024-05-24 01:23:01] [INFO ] Deduced a trap composed of 63 places in 270 ms of which 4 ms to minimize.
[2024-05-24 01:23:03] [INFO ] Deduced a trap composed of 71 places in 231 ms of which 2 ms to minimize.
[2024-05-24 01:23:03] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 2 ms to minimize.
[2024-05-24 01:23:03] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 2 ms to minimize.
[2024-05-24 01:23:04] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:23:05] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 3 ms to minimize.
[2024-05-24 01:23:05] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/646 variables, and 138 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/276 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 122/122 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 276/285 places, 705/750 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61263 ms. Remains : 276/285 places, 705/750 transitions.
[2024-05-24 01:23:10] [INFO ] Flatten gal took : 24 ms
[2024-05-24 01:23:10] [INFO ] Flatten gal took : 27 ms
[2024-05-24 01:23:10] [INFO ] Input system was already deterministic with 705 transitions.
[2024-05-24 01:23:10] [INFO ] Flatten gal took : 31 ms
[2024-05-24 01:23:10] [INFO ] Flatten gal took : 27 ms
[2024-05-24 01:23:10] [INFO ] Time to serialize gal into /tmp/CTLFireability6584823797972107468.gal : 5 ms
[2024-05-24 01:23:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17004974704496630722.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/CTLFireability6584823797972107468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17004974704496630722.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-24 01:23:40] [INFO ] Flatten gal took : 15 ms
[2024-05-24 01:23:40] [INFO ] Applying decomposition
[2024-05-24 01:23:40] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1436445910561068856.txt' '-o' '/tmp/graph1436445910561068856.bin' '-w' '/tmp/graph1436445910561068856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1436445910561068856.bin' '-l' '-1' '-v' '-w' '/tmp/graph1436445910561068856.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:23:40] [INFO ] Decomposing Gal with order
[2024-05-24 01:23:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:23:40] [INFO ] Removed a total of 1040 redundant transitions.
[2024-05-24 01:23:40] [INFO ] Flatten gal took : 45 ms
[2024-05-24 01:23:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 233 labels/synchronizations in 10 ms.
[2024-05-24 01:23:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4298632114505486122.gal : 11 ms
[2024-05-24 01:23:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13393942276052279485.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/CTLFireability4298632114505486122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13393942276052279485.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 275 transition count 700
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 275 transition count 700
Applied a total of 20 rules in 6 ms. Remains 275 /285 variables (removed 10) and now considering 700/750 (removed 50) transitions.
[2024-05-24 01:24:10] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-24 01:24:10] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 01:24:11] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-24 01:24:11] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 01:24:11] [INFO ] Invariant cache hit.
[2024-05-24 01:24:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 01:24:12] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-24 01:24:12] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 01:24:12] [INFO ] Invariant cache hit.
[2024-05-24 01:24:12] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 01:24:20] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-24 01:24:20] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:24:20] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-05-24 01:24:20] [INFO ] Deduced a trap composed of 49 places in 256 ms of which 4 ms to minimize.
[2024-05-24 01:24:21] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 4 ms to minimize.
[2024-05-24 01:24:21] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 4 ms to minimize.
[2024-05-24 01:24:21] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 3 ms to minimize.
[2024-05-24 01:24:21] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 4 ms to minimize.
[2024-05-24 01:24:22] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 3 ms to minimize.
[2024-05-24 01:24:22] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:24:22] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 4 ms to minimize.
[2024-05-24 01:24:22] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-24 01:24:23] [INFO ] Deduced a trap composed of 33 places in 330 ms of which 5 ms to minimize.
[2024-05-24 01:24:23] [INFO ] Deduced a trap composed of 51 places in 275 ms of which 4 ms to minimize.
[2024-05-24 01:24:24] [INFO ] Deduced a trap composed of 72 places in 257 ms of which 4 ms to minimize.
[2024-05-24 01:24:24] [INFO ] Deduced a trap composed of 60 places in 254 ms of which 4 ms to minimize.
[2024-05-24 01:24:24] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 4 ms to minimize.
[2024-05-24 01:24:24] [INFO ] Deduced a trap composed of 54 places in 263 ms of which 5 ms to minimize.
[2024-05-24 01:24:25] [INFO ] Deduced a trap composed of 46 places in 280 ms of which 4 ms to minimize.
[2024-05-24 01:24:25] [INFO ] Deduced a trap composed of 66 places in 263 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 01:24:25] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:24:26] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:24:27] [INFO ] Deduced a trap composed of 57 places in 271 ms of which 4 ms to minimize.
[2024-05-24 01:24:27] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 4 ms to minimize.
[2024-05-24 01:24:27] [INFO ] Deduced a trap composed of 51 places in 273 ms of which 4 ms to minimize.
[2024-05-24 01:24:27] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 4 ms to minimize.
[2024-05-24 01:24:28] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-24 01:24:28] [INFO ] Deduced a trap composed of 80 places in 245 ms of which 5 ms to minimize.
[2024-05-24 01:24:28] [INFO ] Deduced a trap composed of 72 places in 238 ms of which 3 ms to minimize.
[2024-05-24 01:24:29] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 4 ms to minimize.
[2024-05-24 01:24:29] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 4 ms to minimize.
[2024-05-24 01:24:29] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 4 ms to minimize.
[2024-05-24 01:24:29] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 3 ms to minimize.
[2024-05-24 01:24:30] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 4 ms to minimize.
[2024-05-24 01:24:30] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-05-24 01:24:30] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-24 01:24:30] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-05-24 01:24:30] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-05-24 01:24:31] [INFO ] Deduced a trap composed of 64 places in 330 ms of which 5 ms to minimize.
[2024-05-24 01:24:31] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 01:24:39] [INFO ] Deduced a trap composed of 77 places in 289 ms of which 5 ms to minimize.
[2024-05-24 01:24:40] [INFO ] Deduced a trap composed of 86 places in 242 ms of which 4 ms to minimize.
[2024-05-24 01:24:40] [INFO ] Deduced a trap composed of 71 places in 222 ms of which 3 ms to minimize.
[2024-05-24 01:24:40] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 4 ms to minimize.
[2024-05-24 01:24:40] [INFO ] Deduced a trap composed of 56 places in 254 ms of which 4 ms to minimize.
[2024-05-24 01:24:41] [INFO ] Deduced a trap composed of 54 places in 223 ms of which 4 ms to minimize.
[2024-05-24 01:24:41] [INFO ] Deduced a trap composed of 61 places in 244 ms of which 4 ms to minimize.
[2024-05-24 01:24:41] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 4 ms to minimize.
[2024-05-24 01:24:42] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 4 ms to minimize.
[2024-05-24 01:24:42] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 4 ms to minimize.
SMT process timed out in 30534ms, After SMT, problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 30549ms
Starting structural reductions in LTL mode, iteration 1 : 275/285 places, 700/750 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31873 ms. Remains : 275/285 places, 700/750 transitions.
[2024-05-24 01:24:42] [INFO ] Flatten gal took : 24 ms
[2024-05-24 01:24:42] [INFO ] Flatten gal took : 27 ms
[2024-05-24 01:24:42] [INFO ] Input system was already deterministic with 700 transitions.
[2024-05-24 01:24:42] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:24:42] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:24:42] [INFO ] Time to serialize gal into /tmp/CTLFireability11385055278267969185.gal : 5 ms
[2024-05-24 01:24:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4690886967088082961.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/CTLFireability11385055278267969185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4690886967088082961.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-24 01:25:12] [INFO ] Flatten gal took : 15 ms
[2024-05-24 01:25:12] [INFO ] Applying decomposition
[2024-05-24 01:25:12] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9464567143204732914.txt' '-o' '/tmp/graph9464567143204732914.bin' '-w' '/tmp/graph9464567143204732914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9464567143204732914.bin' '-l' '-1' '-v' '-w' '/tmp/graph9464567143204732914.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:25:12] [INFO ] Decomposing Gal with order
[2024-05-24 01:25:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:25:12] [INFO ] Removed a total of 1080 redundant transitions.
[2024-05-24 01:25:13] [INFO ] Flatten gal took : 43 ms
[2024-05-24 01:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 286 labels/synchronizations in 12 ms.
[2024-05-24 01:25:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1454346254937663115.gal : 7 ms
[2024-05-24 01:25:13] [INFO ] Time to serialize properties into /tmp/CTLFireability851042025223699158.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/CTLFireability1454346254937663115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability851042025223699158.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 276 transition count 705
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 276 transition count 705
Applied a total of 18 rules in 7 ms. Remains 276 /285 variables (removed 9) and now considering 705/750 (removed 45) transitions.
[2024-05-24 01:25:43] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2024-05-24 01:25:43] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 01:25:43] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-24 01:25:43] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 01:25:43] [INFO ] Invariant cache hit.
[2024-05-24 01:25:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 01:25:44] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-05-24 01:25:44] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 01:25:44] [INFO ] Invariant cache hit.
[2024-05-24 01:25:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:25:51] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-05-24 01:25:52] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:25:52] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2024-05-24 01:25:52] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-24 01:25:52] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 4 ms to minimize.
[2024-05-24 01:25:52] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:25:53] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:25:53] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 4 ms to minimize.
[2024-05-24 01:25:54] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:25:54] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 4 ms to minimize.
[2024-05-24 01:25:54] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 4 ms to minimize.
[2024-05-24 01:25:54] [INFO ] Deduced a trap composed of 75 places in 260 ms of which 4 ms to minimize.
[2024-05-24 01:25:55] [INFO ] Deduced a trap composed of 54 places in 203 ms of which 4 ms to minimize.
[2024-05-24 01:25:55] [INFO ] Deduced a trap composed of 58 places in 267 ms of which 4 ms to minimize.
[2024-05-24 01:25:55] [INFO ] Deduced a trap composed of 71 places in 212 ms of which 4 ms to minimize.
[2024-05-24 01:25:55] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 4 ms to minimize.
[2024-05-24 01:25:56] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 4 ms to minimize.
[2024-05-24 01:25:56] [INFO ] Deduced a trap composed of 62 places in 273 ms of which 4 ms to minimize.
[2024-05-24 01:25:56] [INFO ] Deduced a trap composed of 62 places in 261 ms of which 4 ms to minimize.
[2024-05-24 01:25:56] [INFO ] Deduced a trap composed of 59 places in 244 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:25:57] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:25:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 01:25:57] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 2 ms to minimize.
[2024-05-24 01:25:57] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 3 ms to minimize.
[2024-05-24 01:25:58] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:25:59] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2024-05-24 01:26:00] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 4 ms to minimize.
[2024-05-24 01:26:00] [INFO ] Deduced a trap composed of 50 places in 273 ms of which 4 ms to minimize.
[2024-05-24 01:26:00] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 3 ms to minimize.
[2024-05-24 01:26:00] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 4 ms to minimize.
[2024-05-24 01:26:01] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 4 ms to minimize.
[2024-05-24 01:26:01] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:26:01] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 4 ms to minimize.
[2024-05-24 01:26:01] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:26:01] [INFO ] Deduced a trap composed of 78 places in 244 ms of which 3 ms to minimize.
[2024-05-24 01:26:02] [INFO ] Deduced a trap composed of 60 places in 164 ms of which 2 ms to minimize.
[2024-05-24 01:26:02] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 01:26:02] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 4 ms to minimize.
[2024-05-24 01:26:03] [INFO ] Deduced a trap composed of 37 places in 299 ms of which 4 ms to minimize.
[2024-05-24 01:26:03] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:26:09] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 3 ms to minimize.
[2024-05-24 01:26:09] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 4 ms to minimize.
[2024-05-24 01:26:10] [INFO ] Deduced a trap composed of 74 places in 235 ms of which 4 ms to minimize.
[2024-05-24 01:26:10] [INFO ] Deduced a trap composed of 93 places in 233 ms of which 4 ms to minimize.
[2024-05-24 01:26:10] [INFO ] Deduced a trap composed of 55 places in 235 ms of which 4 ms to minimize.
[2024-05-24 01:26:10] [INFO ] Deduced a trap composed of 71 places in 218 ms of which 4 ms to minimize.
[2024-05-24 01:26:11] [INFO ] Deduced a trap composed of 66 places in 216 ms of which 4 ms to minimize.
[2024-05-24 01:26:11] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:26:11] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:26:11] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:26:11] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 4 ms to minimize.
[2024-05-24 01:26:12] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 4 ms to minimize.
[2024-05-24 01:26:12] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 2 ms to minimize.
[2024-05-24 01:26:12] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 3 ms to minimize.
[2024-05-24 01:26:13] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-05-24 01:26:13] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 4 ms to minimize.
[2024-05-24 01:26:13] [INFO ] Deduced a trap composed of 78 places in 220 ms of which 4 ms to minimize.
[2024-05-24 01:26:13] [INFO ] Deduced a trap composed of 63 places in 241 ms of which 4 ms to minimize.
[2024-05-24 01:26:14] [INFO ] Deduced a trap composed of 59 places in 226 ms of which 3 ms to minimize.
SMT process timed out in 30446ms, After SMT, problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 30454ms
Starting structural reductions in LTL mode, iteration 1 : 276/285 places, 705/750 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31403 ms. Remains : 276/285 places, 705/750 transitions.
[2024-05-24 01:26:14] [INFO ] Flatten gal took : 24 ms
[2024-05-24 01:26:14] [INFO ] Flatten gal took : 30 ms
[2024-05-24 01:26:14] [INFO ] Input system was already deterministic with 705 transitions.
[2024-05-24 01:26:14] [INFO ] Flatten gal took : 27 ms
[2024-05-24 01:26:14] [INFO ] Flatten gal took : 27 ms
[2024-05-24 01:26:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14695108638200307618.gal : 5 ms
[2024-05-24 01:26:14] [INFO ] Time to serialize properties into /tmp/CTLFireability836683255017154686.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/CTLFireability14695108638200307618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability836683255017154686.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-24 01:26:44] [INFO ] Flatten gal took : 16 ms
[2024-05-24 01:26:44] [INFO ] Applying decomposition
[2024-05-24 01:26:44] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13589646675912445666.txt' '-o' '/tmp/graph13589646675912445666.bin' '-w' '/tmp/graph13589646675912445666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13589646675912445666.bin' '-l' '-1' '-v' '-w' '/tmp/graph13589646675912445666.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:26:44] [INFO ] Decomposing Gal with order
[2024-05-24 01:26:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:26:44] [INFO ] Removed a total of 1075 redundant transitions.
[2024-05-24 01:26:44] [INFO ] Flatten gal took : 40 ms
[2024-05-24 01:26:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 257 labels/synchronizations in 13 ms.
[2024-05-24 01:26:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16696092288042351299.gal : 6 ms
[2024-05-24 01:26:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15745615984119241497.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/CTLFireability16696092288042351299.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15745615984119241497.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 276 transition count 705
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 276 transition count 705
Applied a total of 18 rules in 6 ms. Remains 276 /285 variables (removed 9) and now considering 705/750 (removed 45) transitions.
[2024-05-24 01:27:14] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2024-05-24 01:27:14] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 01:27:15] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-24 01:27:15] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 01:27:15] [INFO ] Invariant cache hit.
[2024-05-24 01:27:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 01:27:16] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-05-24 01:27:16] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 01:27:16] [INFO ] Invariant cache hit.
[2024-05-24 01:27:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:27:22] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:27:22] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-24 01:27:22] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-24 01:27:23] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 4 ms to minimize.
[2024-05-24 01:27:23] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 4 ms to minimize.
[2024-05-24 01:27:23] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 4 ms to minimize.
[2024-05-24 01:27:23] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:27:24] [INFO ] Deduced a trap composed of 58 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:27:24] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:27:25] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 4 ms to minimize.
[2024-05-24 01:27:25] [INFO ] Deduced a trap composed of 52 places in 272 ms of which 5 ms to minimize.
[2024-05-24 01:27:25] [INFO ] Deduced a trap composed of 78 places in 279 ms of which 4 ms to minimize.
[2024-05-24 01:27:25] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 3 ms to minimize.
[2024-05-24 01:27:26] [INFO ] Deduced a trap composed of 97 places in 286 ms of which 5 ms to minimize.
[2024-05-24 01:27:26] [INFO ] Deduced a trap composed of 76 places in 291 ms of which 4 ms to minimize.
[2024-05-24 01:27:26] [INFO ] Deduced a trap composed of 73 places in 195 ms of which 2 ms to minimize.
[2024-05-24 01:27:26] [INFO ] Deduced a trap composed of 90 places in 282 ms of which 4 ms to minimize.
[2024-05-24 01:27:27] [INFO ] Deduced a trap composed of 53 places in 261 ms of which 4 ms to minimize.
[2024-05-24 01:27:27] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 3 ms to minimize.
[2024-05-24 01:27:27] [INFO ] Deduced a trap composed of 74 places in 237 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:27:28] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-24 01:27:28] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-05-24 01:27:28] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 3 ms to minimize.
[2024-05-24 01:27:29] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 4 ms to minimize.
[2024-05-24 01:27:29] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 2 ms to minimize.
[2024-05-24 01:27:29] [INFO ] Deduced a trap composed of 79 places in 218 ms of which 4 ms to minimize.
[2024-05-24 01:27:30] [INFO ] Deduced a trap composed of 77 places in 271 ms of which 4 ms to minimize.
[2024-05-24 01:27:30] [INFO ] Deduced a trap composed of 56 places in 254 ms of which 4 ms to minimize.
[2024-05-24 01:27:30] [INFO ] Deduced a trap composed of 69 places in 253 ms of which 4 ms to minimize.
[2024-05-24 01:27:31] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 4 ms to minimize.
[2024-05-24 01:27:31] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 3 ms to minimize.
[2024-05-24 01:27:31] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 4 ms to minimize.
[2024-05-24 01:27:31] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2024-05-24 01:27:31] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 3 ms to minimize.
[2024-05-24 01:27:32] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 4 ms to minimize.
[2024-05-24 01:27:32] [INFO ] Deduced a trap composed of 86 places in 283 ms of which 4 ms to minimize.
[2024-05-24 01:27:32] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 4 ms to minimize.
[2024-05-24 01:27:33] [INFO ] Deduced a trap composed of 70 places in 281 ms of which 4 ms to minimize.
[2024-05-24 01:27:33] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-05-24 01:27:33] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:27:40] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-24 01:27:41] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-24 01:27:42] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 01:27:42] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 2 ms to minimize.
[2024-05-24 01:27:42] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-05-24 01:27:42] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2024-05-24 01:27:42] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 01:27:44] [INFO ] Deduced a trap composed of 37 places in 294 ms of which 5 ms to minimize.
[2024-05-24 01:27:44] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 4 ms to minimize.
[2024-05-24 01:27:45] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 4 ms to minimize.
[2024-05-24 01:27:45] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/646 variables, and 67 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/276 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:27:48] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 2 ms to minimize.
[2024-05-24 01:27:49] [INFO ] Deduced a trap composed of 77 places in 239 ms of which 4 ms to minimize.
[2024-05-24 01:27:49] [INFO ] Deduced a trap composed of 70 places in 151 ms of which 3 ms to minimize.
[2024-05-24 01:27:49] [INFO ] Deduced a trap composed of 69 places in 194 ms of which 3 ms to minimize.
[2024-05-24 01:27:50] [INFO ] Deduced a trap composed of 48 places in 246 ms of which 4 ms to minimize.
[2024-05-24 01:27:50] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 4 ms to minimize.
[2024-05-24 01:27:50] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-24 01:27:58] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:27:58] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 2 ms to minimize.
[2024-05-24 01:27:58] [INFO ] Deduced a trap composed of 59 places in 183 ms of which 3 ms to minimize.
[2024-05-24 01:27:58] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 3 ms to minimize.
[2024-05-24 01:27:59] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 3 ms to minimize.
[2024-05-24 01:28:00] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 4 ms to minimize.
[2024-05-24 01:28:00] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:28:01] [INFO ] Deduced a trap composed of 49 places in 289 ms of which 4 ms to minimize.
[2024-05-24 01:28:01] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 3 ms to minimize.
[2024-05-24 01:28:01] [INFO ] Deduced a trap composed of 53 places in 284 ms of which 4 ms to minimize.
[2024-05-24 01:28:02] [INFO ] Deduced a trap composed of 62 places in 308 ms of which 4 ms to minimize.
[2024-05-24 01:28:02] [INFO ] Deduced a trap composed of 50 places in 302 ms of which 5 ms to minimize.
[2024-05-24 01:28:02] [INFO ] Deduced a trap composed of 91 places in 281 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:28:03] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 4 ms to minimize.
[2024-05-24 01:28:04] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:28:04] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-05-24 01:28:04] [INFO ] Deduced a trap composed of 62 places in 242 ms of which 4 ms to minimize.
[2024-05-24 01:28:05] [INFO ] Deduced a trap composed of 78 places in 241 ms of which 4 ms to minimize.
[2024-05-24 01:28:05] [INFO ] Deduced a trap composed of 61 places in 246 ms of which 4 ms to minimize.
[2024-05-24 01:28:05] [INFO ] Deduced a trap composed of 69 places in 226 ms of which 4 ms to minimize.
[2024-05-24 01:28:05] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:28:06] [INFO ] Deduced a trap composed of 73 places in 206 ms of which 3 ms to minimize.
[2024-05-24 01:28:06] [INFO ] Deduced a trap composed of 59 places in 264 ms of which 4 ms to minimize.
[2024-05-24 01:28:06] [INFO ] Deduced a trap composed of 71 places in 219 ms of which 4 ms to minimize.
[2024-05-24 01:28:07] [INFO ] Deduced a trap composed of 83 places in 264 ms of which 4 ms to minimize.
[2024-05-24 01:28:09] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 4 ms to minimize.
[2024-05-24 01:28:09] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 4 ms to minimize.
[2024-05-24 01:28:10] [INFO ] Deduced a trap composed of 57 places in 240 ms of which 4 ms to minimize.
[2024-05-24 01:28:10] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:28:10] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 4 ms to minimize.
[2024-05-24 01:28:10] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:28:11] [INFO ] Deduced a trap composed of 56 places in 273 ms of which 4 ms to minimize.
[2024-05-24 01:28:11] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:28:12] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 2 ms to minimize.
[2024-05-24 01:28:13] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 2 ms to minimize.
[2024-05-24 01:28:13] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:28:13] [INFO ] Deduced a trap composed of 56 places in 233 ms of which 4 ms to minimize.
[2024-05-24 01:28:13] [INFO ] Deduced a trap composed of 59 places in 245 ms of which 4 ms to minimize.
[2024-05-24 01:28:14] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 2 ms to minimize.
[2024-05-24 01:28:14] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2024-05-24 01:28:14] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/646 variables, and 115 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/276 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 99/99 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Starting structural reductions in LTL mode, iteration 1 : 276/285 places, 705/750 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61681 ms. Remains : 276/285 places, 705/750 transitions.
[2024-05-24 01:28:16] [INFO ] Flatten gal took : 15 ms
[2024-05-24 01:28:16] [INFO ] Flatten gal took : 17 ms
[2024-05-24 01:28:16] [INFO ] Input system was already deterministic with 705 transitions.
[2024-05-24 01:28:16] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:28:16] [INFO ] Flatten gal took : 27 ms
[2024-05-24 01:28:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7851087846920385741.gal : 4 ms
[2024-05-24 01:28:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14433842861514696672.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/CTLFireability7851087846920385741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14433842861514696672.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-24 01:28:46] [INFO ] Flatten gal took : 16 ms
[2024-05-24 01:28:46] [INFO ] Applying decomposition
[2024-05-24 01:28:46] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10093863088341974408.txt' '-o' '/tmp/graph10093863088341974408.bin' '-w' '/tmp/graph10093863088341974408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10093863088341974408.bin' '-l' '-1' '-v' '-w' '/tmp/graph10093863088341974408.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:28:46] [INFO ] Decomposing Gal with order
[2024-05-24 01:28:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:28:46] [INFO ] Removed a total of 1038 redundant transitions.
[2024-05-24 01:28:46] [INFO ] Flatten gal took : 38 ms
[2024-05-24 01:28:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 247 labels/synchronizations in 12 ms.
[2024-05-24 01:28:47] [INFO ] Time to serialize gal into /tmp/CTLFireability8578480945246167390.gal : 6 ms
[2024-05-24 01:28:47] [INFO ] Time to serialize properties into /tmp/CTLFireability17306831862302979218.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/CTLFireability8578480945246167390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17306831862302979218.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 276 transition count 705
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 276 transition count 705
Applied a total of 18 rules in 6 ms. Remains 276 /285 variables (removed 9) and now considering 705/750 (removed 45) transitions.
[2024-05-24 01:29:17] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2024-05-24 01:29:17] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 01:29:17] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-24 01:29:17] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 01:29:17] [INFO ] Invariant cache hit.
[2024-05-24 01:29:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 01:29:18] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1657 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-05-24 01:29:18] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 01:29:18] [INFO ] Invariant cache hit.
[2024-05-24 01:29:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:29:26] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-24 01:29:26] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:29:26] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:29:26] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 01:29:26] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 4 ms to minimize.
[2024-05-24 01:29:27] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 4 ms to minimize.
[2024-05-24 01:29:28] [INFO ] Deduced a trap composed of 34 places in 299 ms of which 4 ms to minimize.
[2024-05-24 01:29:28] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 4 ms to minimize.
[2024-05-24 01:29:28] [INFO ] Deduced a trap composed of 78 places in 285 ms of which 5 ms to minimize.
[2024-05-24 01:29:28] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 4 ms to minimize.
[2024-05-24 01:29:29] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 3 ms to minimize.
[2024-05-24 01:29:29] [INFO ] Deduced a trap composed of 75 places in 249 ms of which 4 ms to minimize.
[2024-05-24 01:29:29] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 4 ms to minimize.
[2024-05-24 01:29:30] [INFO ] Deduced a trap composed of 58 places in 251 ms of which 4 ms to minimize.
[2024-05-24 01:29:30] [INFO ] Deduced a trap composed of 71 places in 213 ms of which 4 ms to minimize.
[2024-05-24 01:29:30] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:29:30] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 4 ms to minimize.
[2024-05-24 01:29:31] [INFO ] Deduced a trap composed of 62 places in 247 ms of which 3 ms to minimize.
[2024-05-24 01:29:31] [INFO ] Deduced a trap composed of 62 places in 253 ms of which 4 ms to minimize.
[2024-05-24 01:29:31] [INFO ] Deduced a trap composed of 59 places in 228 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:29:32] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 3 ms to minimize.
[2024-05-24 01:29:32] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 01:29:32] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 4 ms to minimize.
[2024-05-24 01:29:32] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 3 ms to minimize.
[2024-05-24 01:29:33] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 4 ms to minimize.
[2024-05-24 01:29:34] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 01:29:34] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 4 ms to minimize.
[2024-05-24 01:29:34] [INFO ] Deduced a trap composed of 50 places in 261 ms of which 4 ms to minimize.
[2024-05-24 01:29:35] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 4 ms to minimize.
[2024-05-24 01:29:35] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 4 ms to minimize.
[2024-05-24 01:29:35] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 4 ms to minimize.
[2024-05-24 01:29:36] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 4 ms to minimize.
[2024-05-24 01:29:36] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 4 ms to minimize.
[2024-05-24 01:29:36] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 4 ms to minimize.
[2024-05-24 01:29:36] [INFO ] Deduced a trap composed of 78 places in 241 ms of which 4 ms to minimize.
[2024-05-24 01:29:37] [INFO ] Deduced a trap composed of 60 places in 233 ms of which 4 ms to minimize.
[2024-05-24 01:29:37] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-24 01:29:37] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 4 ms to minimize.
[2024-05-24 01:29:38] [INFO ] Deduced a trap composed of 37 places in 291 ms of which 4 ms to minimize.
[2024-05-24 01:29:38] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:29:46] [INFO ] Deduced a trap composed of 66 places in 301 ms of which 5 ms to minimize.
[2024-05-24 01:29:47] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:29:47] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 4 ms to minimize.
[2024-05-24 01:29:47] [INFO ] Deduced a trap composed of 93 places in 267 ms of which 4 ms to minimize.
[2024-05-24 01:29:48] [INFO ] Deduced a trap composed of 55 places in 270 ms of which 4 ms to minimize.
[2024-05-24 01:29:48] [INFO ] Deduced a trap composed of 71 places in 257 ms of which 4 ms to minimize.
[2024-05-24 01:29:48] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 4 ms to minimize.
[2024-05-24 01:29:49] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 4 ms to minimize.
[2024-05-24 01:29:49] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 3 ms to minimize.
SMT process timed out in 30518ms, After SMT, problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 30531ms
Starting structural reductions in LTL mode, iteration 1 : 276/285 places, 705/750 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32198 ms. Remains : 276/285 places, 705/750 transitions.
[2024-05-24 01:29:49] [INFO ] Flatten gal took : 24 ms
[2024-05-24 01:29:49] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:29:49] [INFO ] Input system was already deterministic with 705 transitions.
[2024-05-24 01:29:49] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:29:49] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:29:49] [INFO ] Time to serialize gal into /tmp/CTLFireability5554029897893671628.gal : 4 ms
[2024-05-24 01:29:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16164768042421398549.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/CTLFireability5554029897893671628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16164768042421398549.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-24 01:30:19] [INFO ] Flatten gal took : 15 ms
[2024-05-24 01:30:19] [INFO ] Applying decomposition
[2024-05-24 01:30:19] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6310278737874520277.txt' '-o' '/tmp/graph6310278737874520277.bin' '-w' '/tmp/graph6310278737874520277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6310278737874520277.bin' '-l' '-1' '-v' '-w' '/tmp/graph6310278737874520277.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:30:19] [INFO ] Decomposing Gal with order
[2024-05-24 01:30:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:30:19] [INFO ] Removed a total of 1097 redundant transitions.
[2024-05-24 01:30:19] [INFO ] Flatten gal took : 36 ms
[2024-05-24 01:30:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 247 labels/synchronizations in 12 ms.
[2024-05-24 01:30:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13627672959429986732.gal : 6 ms
[2024-05-24 01:30:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15849072895582192895.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/CTLFireability13627672959429986732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15849072895582192895.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 280 transition count 666
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 201 transition count 666
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 178 place count 191 transition count 616
Iterating global reduction 2 with 10 rules applied. Total rules applied 188 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 228 place count 171 transition count 596
Applied a total of 228 rules in 33 ms. Remains 171 /285 variables (removed 114) and now considering 596/750 (removed 154) transitions.
[2024-05-24 01:30:49] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 01:30:49] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 01:30:49] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-24 01:30:49] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 01:30:49] [INFO ] Invariant cache hit.
[2024-05-24 01:30:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 01:30:50] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
[2024-05-24 01:30:50] [INFO ] Redundant transitions in 8 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-24 01:30:50] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 01:30:50] [INFO ] Invariant cache hit.
[2024-05-24 01:30:50] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:30:55] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:30:55] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 2 ms to minimize.
[2024-05-24 01:30:55] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-24 01:30:55] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-24 01:30:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 01:30:56] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-05-24 01:30:56] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 3 ms to minimize.
[2024-05-24 01:30:56] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:30:57] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 3 ms to minimize.
[2024-05-24 01:30:57] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-05-24 01:30:57] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 01:30:57] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:30:57] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 3 ms to minimize.
[2024-05-24 01:30:58] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 3 ms to minimize.
[2024-05-24 01:30:58] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-05-24 01:30:58] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 01:30:58] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 2 ms to minimize.
[2024-05-24 01:30:58] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-24 01:30:58] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:30:59] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:31:00] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 3 ms to minimize.
[2024-05-24 01:31:00] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:31:01] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 2 ms to minimize.
[2024-05-24 01:31:01] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2024-05-24 01:31:01] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 3 ms to minimize.
[2024-05-24 01:31:01] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-24 01:31:02] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:31:02] [INFO ] Deduced a trap composed of 61 places in 187 ms of which 4 ms to minimize.
[2024-05-24 01:31:02] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 2 ms to minimize.
[2024-05-24 01:31:02] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:31:02] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:31:03] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 3 ms to minimize.
[2024-05-24 01:31:03] [INFO ] Deduced a trap composed of 57 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:31:03] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 2 ms to minimize.
[2024-05-24 01:31:03] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 3 ms to minimize.
[2024-05-24 01:31:04] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 3 ms to minimize.
[2024-05-24 01:31:04] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 2 ms to minimize.
[2024-05-24 01:31:04] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 2 ms to minimize.
[2024-05-24 01:31:04] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-24 01:31:04] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:31:09] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 2 ms to minimize.
[2024-05-24 01:31:10] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 3 ms to minimize.
[2024-05-24 01:31:11] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 2 ms to minimize.
[2024-05-24 01:31:11] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 3 ms to minimize.
[2024-05-24 01:31:11] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-24 01:31:11] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 2 ms to minimize.
[2024-05-24 01:31:12] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:31:12] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
[2024-05-24 01:31:13] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:31:13] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:31:13] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:31:14] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 2 ms to minimize.
[2024-05-24 01:31:14] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 3 ms to minimize.
[2024-05-24 01:31:15] [INFO ] Deduced a trap composed of 40 places in 205 ms of which 3 ms to minimize.
[2024-05-24 01:31:15] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:31:20] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-24 01:31:20] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 2 ms to minimize.
[2024-05-24 01:31:21] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 74 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:31:24] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 3 ms to minimize.
[2024-05-24 01:31:25] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:31:25] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:31:26] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:31:26] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:31:26] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 2 ms to minimize.
[2024-05-24 01:31:27] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-05-24 01:31:27] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:31:29] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 4 ms to minimize.
[2024-05-24 01:31:29] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:31:33] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 2 ms to minimize.
[2024-05-24 01:31:33] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 2 ms to minimize.
[2024-05-24 01:31:33] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:31:34] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:31:38] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
[2024-05-24 01:31:38] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 2 ms to minimize.
[2024-05-24 01:31:39] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:31:39] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 3 ms to minimize.
[2024-05-24 01:31:39] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:31:39] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:31:40] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:31:40] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:31:40] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
[2024-05-24 01:31:40] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:31:40] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 2 ms to minimize.
[2024-05-24 01:31:41] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-24 01:31:41] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:31:41] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 3 ms to minimize.
[2024-05-24 01:31:41] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
[2024-05-24 01:31:42] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 3 ms to minimize.
[2024-05-24 01:31:42] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-05-24 01:31:43] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 2 ms to minimize.
[2024-05-24 01:31:44] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 3 ms to minimize.
[2024-05-24 01:31:45] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:31:46] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 3 ms to minimize.
[2024-05-24 01:31:48] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 3 ms to minimize.
[2024-05-24 01:31:48] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:31:48] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2024-05-24 01:31:48] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 3 ms to minimize.
[2024-05-24 01:31:48] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 2 ms to minimize.
[2024-05-24 01:31:49] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 3 ms to minimize.
[2024-05-24 01:31:49] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 3 ms to minimize.
[2024-05-24 01:31:49] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-05-24 01:31:49] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:31:50] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 3 ms to minimize.
[2024-05-24 01:31:50] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:31:50] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-05-24 01:31:50] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-05-24 01:31:51] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 3 ms to minimize.
[2024-05-24 01:31:51] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 3 ms to minimize.
SMT process timed out in 60460ms, After SMT, problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Starting structural reductions in SI_CTL mode, iteration 1 : 171/285 places, 596/750 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61572 ms. Remains : 171/285 places, 596/750 transitions.
[2024-05-24 01:31:51] [INFO ] Flatten gal took : 21 ms
[2024-05-24 01:31:51] [INFO ] Flatten gal took : 23 ms
[2024-05-24 01:31:51] [INFO ] Input system was already deterministic with 596 transitions.
[2024-05-24 01:31:51] [INFO ] Flatten gal took : 40 ms
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
[2024-05-24 01:31:51] [INFO ] Flatten gal took : 24 ms
[2024-05-24 01:31:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7965490959144450022.gal : 4 ms
[2024-05-24 01:31:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11835904985727292167.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7965490959144450022.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11835904985727292167.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 331 steps, run visited all 1 properties in 6 ms. (steps per millisecond=55 )
Probabilistic random walk after 331 steps, saw 269 distinct states, run finished after 16 ms. (steps per millisecond=20 ) properties seen :1
FORMULA EisenbergMcGuire-PT-05-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 285 transition count 745
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 280 transition count 667
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 202 transition count 667
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 176 place count 192 transition count 617
Iterating global reduction 2 with 10 rules applied. Total rules applied 186 place count 192 transition count 617
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 226 place count 172 transition count 597
Applied a total of 226 rules in 55 ms. Remains 172 /285 variables (removed 113) and now considering 597/750 (removed 153) transitions.
[2024-05-24 01:31:51] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2024-05-24 01:31:51] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 01:31:52] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-24 01:31:52] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2024-05-24 01:31:52] [INFO ] Invariant cache hit.
[2024-05-24 01:31:52] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 01:31:52] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
[2024-05-24 01:31:52] [INFO ] Redundant transitions in 4 ms returned []
Running 592 sub problems to find dead transitions.
[2024-05-24 01:31:52] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2024-05-24 01:31:52] [INFO ] Invariant cache hit.
[2024-05-24 01:31:52] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 01:31:57] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-05-24 01:31:57] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-24 01:31:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 01:31:57] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
[2024-05-24 01:31:57] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:31:58] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 2 ms to minimize.
[2024-05-24 01:31:58] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 3 ms to minimize.
[2024-05-24 01:31:58] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-05-24 01:31:58] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:31:58] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-05-24 01:31:59] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:31:59] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:31:59] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2024-05-24 01:31:59] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-24 01:31:59] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 01:31:59] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 2 ms to minimize.
[2024-05-24 01:31:59] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 2 ms to minimize.
[2024-05-24 01:32:00] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:32:00] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 3 ms to minimize.
[2024-05-24 01:32:00] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 01:32:01] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-24 01:32:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-24 01:32:01] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-05-24 01:32:02] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-05-24 01:32:03] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-24 01:32:03] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:32:04] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-05-24 01:32:04] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 3 ms to minimize.
[2024-05-24 01:32:04] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 3 ms to minimize.
[2024-05-24 01:32:05] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:32:05] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:32:05] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:32:05] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:32:05] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 2 ms to minimize.
[2024-05-24 01:32:06] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 3 ms to minimize.
[2024-05-24 01:32:06] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 3 ms to minimize.
[2024-05-24 01:32:06] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 3 ms to minimize.
[2024-05-24 01:32:06] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:32:07] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-05-24 01:32:07] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 01:32:14] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:32:15] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 2 ms to minimize.
[2024-05-24 01:32:15] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 2 ms to minimize.
[2024-05-24 01:32:15] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 3 ms to minimize.
[2024-05-24 01:32:16] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 01:32:21] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2024-05-24 01:32:21] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 2 ms to minimize.
[2024-05-24 01:32:22] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 172/434 variables, and 64 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/172 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 01:32:27] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:32:27] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 2 ms to minimize.
[2024-05-24 01:32:27] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-05-24 01:32:28] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:32:28] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
[2024-05-24 01:32:28] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:32:28] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 2 ms to minimize.
[2024-05-24 01:32:29] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 3 ms to minimize.
[2024-05-24 01:32:29] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 3 ms to minimize.
[2024-05-24 01:32:31] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 3 ms to minimize.
[2024-05-24 01:32:31] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 01:32:32] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-05-24 01:32:35] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:32:36] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 2 ms to minimize.
[2024-05-24 01:32:36] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 3 ms to minimize.
[2024-05-24 01:32:36] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 6 (OVERLAPS) 262/434 variables, 172/252 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 116/368 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 592/960 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-24 01:32:53] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 961 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 172/172 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 65/65 constraints]
After SMT, in 60340ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Starting structural reductions in SI_CTL mode, iteration 1 : 172/285 places, 597/750 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61605 ms. Remains : 172/285 places, 597/750 transitions.
[2024-05-24 01:32:53] [INFO ] Flatten gal took : 21 ms
[2024-05-24 01:32:53] [INFO ] Flatten gal took : 24 ms
[2024-05-24 01:32:53] [INFO ] Input system was already deterministic with 597 transitions.
[2024-05-24 01:32:53] [INFO ] Flatten gal took : 23 ms
[2024-05-24 01:32:53] [INFO ] Flatten gal took : 23 ms
[2024-05-24 01:32:53] [INFO ] Time to serialize gal into /tmp/CTLFireability381904089941776259.gal : 6 ms
[2024-05-24 01:32:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17412214939713532734.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/CTLFireability381904089941776259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17412214939713532734.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-24 01:33:23] [INFO ] Flatten gal took : 14 ms
[2024-05-24 01:33:23] [INFO ] Applying decomposition
[2024-05-24 01:33:23] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2573082230696794370.txt' '-o' '/tmp/graph2573082230696794370.bin' '-w' '/tmp/graph2573082230696794370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2573082230696794370.bin' '-l' '-1' '-v' '-w' '/tmp/graph2573082230696794370.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:33:23] [INFO ] Decomposing Gal with order
[2024-05-24 01:33:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:33:23] [INFO ] Removed a total of 956 redundant transitions.
[2024-05-24 01:33:23] [INFO ] Flatten gal took : 31 ms
[2024-05-24 01:33:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 171 labels/synchronizations in 10 ms.
[2024-05-24 01:33:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13317665898409259589.gal : 5 ms
[2024-05-24 01:33:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2558462376123865756.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/CTLFireability13317665898409259589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2558462376123865756.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 276 transition count 705
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 276 transition count 705
Applied a total of 18 rules in 7 ms. Remains 276 /285 variables (removed 9) and now considering 705/750 (removed 45) transitions.
[2024-05-24 01:33:53] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2024-05-24 01:33:53] [INFO ] Computed 16 invariants in 2 ms
[2024-05-24 01:33:53] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-24 01:33:53] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 01:33:53] [INFO ] Invariant cache hit.
[2024-05-24 01:33:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-24 01:33:55] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
Running 700 sub problems to find dead transitions.
[2024-05-24 01:33:55] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2024-05-24 01:33:55] [INFO ] Invariant cache hit.
[2024-05-24 01:33:55] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:34:03] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 3 ms to minimize.
[2024-05-24 01:34:03] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-24 01:34:03] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 4 ms to minimize.
[2024-05-24 01:34:03] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 4 ms to minimize.
[2024-05-24 01:34:03] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 4 ms to minimize.
[2024-05-24 01:34:04] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 4 ms to minimize.
[2024-05-24 01:34:04] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 3 ms to minimize.
[2024-05-24 01:34:04] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 3 ms to minimize.
[2024-05-24 01:34:04] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 3 ms to minimize.
[2024-05-24 01:34:05] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:34:05] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:34:06] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 4 ms to minimize.
[2024-05-24 01:34:06] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 4 ms to minimize.
[2024-05-24 01:34:06] [INFO ] Deduced a trap composed of 75 places in 285 ms of which 4 ms to minimize.
[2024-05-24 01:34:06] [INFO ] Deduced a trap composed of 50 places in 236 ms of which 4 ms to minimize.
[2024-05-24 01:34:07] [INFO ] Deduced a trap composed of 55 places in 275 ms of which 4 ms to minimize.
[2024-05-24 01:34:07] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 4 ms to minimize.
[2024-05-24 01:34:07] [INFO ] Deduced a trap composed of 55 places in 278 ms of which 4 ms to minimize.
[2024-05-24 01:34:07] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:34:08] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:34:08] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 01:34:08] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 4 ms to minimize.
[2024-05-24 01:34:09] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 3 ms to minimize.
[2024-05-24 01:34:10] [INFO ] Deduced a trap composed of 55 places in 266 ms of which 4 ms to minimize.
[2024-05-24 01:34:10] [INFO ] Deduced a trap composed of 70 places in 281 ms of which 5 ms to minimize.
[2024-05-24 01:34:10] [INFO ] Deduced a trap composed of 71 places in 303 ms of which 4 ms to minimize.
[2024-05-24 01:34:10] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 4 ms to minimize.
[2024-05-24 01:34:11] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 4 ms to minimize.
[2024-05-24 01:34:11] [INFO ] Deduced a trap composed of 55 places in 251 ms of which 4 ms to minimize.
[2024-05-24 01:34:11] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 4 ms to minimize.
[2024-05-24 01:34:11] [INFO ] Deduced a trap composed of 51 places in 214 ms of which 4 ms to minimize.
[2024-05-24 01:34:12] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:34:12] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 3 ms to minimize.
[2024-05-24 01:34:12] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 4 ms to minimize.
[2024-05-24 01:34:13] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 4 ms to minimize.
[2024-05-24 01:34:13] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 4 ms to minimize.
[2024-05-24 01:34:13] [INFO ] Deduced a trap composed of 63 places in 228 ms of which 3 ms to minimize.
[2024-05-24 01:34:13] [INFO ] Deduced a trap composed of 77 places in 242 ms of which 4 ms to minimize.
[2024-05-24 01:34:14] [INFO ] Deduced a trap composed of 70 places in 257 ms of which 4 ms to minimize.
[2024-05-24 01:34:14] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-24 01:34:21] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 01:34:21] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:34:22] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 3 ms to minimize.
[2024-05-24 01:34:22] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 3 ms to minimize.
[2024-05-24 01:34:22] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:34:22] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 4 ms to minimize.
[2024-05-24 01:34:23] [INFO ] Deduced a trap composed of 74 places in 263 ms of which 4 ms to minimize.
[2024-05-24 01:34:24] [INFO ] Deduced a trap composed of 59 places in 264 ms of which 4 ms to minimize.
[2024-05-24 01:34:24] [INFO ] Deduced a trap composed of 79 places in 239 ms of which 3 ms to minimize.
[2024-05-24 01:34:24] [INFO ] Deduced a trap composed of 58 places in 235 ms of which 4 ms to minimize.
[2024-05-24 01:34:24] [INFO ] Deduced a trap composed of 81 places in 238 ms of which 3 ms to minimize.
[2024-05-24 01:34:25] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 3 ms to minimize.
[2024-05-24 01:34:25] [INFO ] Deduced a trap composed of 61 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:34:25] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 4 ms to minimize.
SMT process timed out in 30622ms, After SMT, problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 30636ms
Starting structural reductions in LTL mode, iteration 1 : 276/285 places, 705/750 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32345 ms. Remains : 276/285 places, 705/750 transitions.
[2024-05-24 01:34:25] [INFO ] Flatten gal took : 23 ms
[2024-05-24 01:34:25] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:34:25] [INFO ] Input system was already deterministic with 705 transitions.
[2024-05-24 01:34:26] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:34:26] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:34:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2451839314294833920.gal : 5 ms
[2024-05-24 01:34:26] [INFO ] Time to serialize properties into /tmp/CTLFireability16579636554550464805.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/CTLFireability2451839314294833920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16579636554550464805.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-24 01:34:56] [INFO ] Flatten gal took : 16 ms
[2024-05-24 01:34:56] [INFO ] Applying decomposition
[2024-05-24 01:34:56] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5229253428570345589.txt' '-o' '/tmp/graph5229253428570345589.bin' '-w' '/tmp/graph5229253428570345589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5229253428570345589.bin' '-l' '-1' '-v' '-w' '/tmp/graph5229253428570345589.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:34:56] [INFO ] Decomposing Gal with order
[2024-05-24 01:34:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:34:56] [INFO ] Removed a total of 1077 redundant transitions.
[2024-05-24 01:34:56] [INFO ] Flatten gal took : 34 ms
[2024-05-24 01:34:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 12 ms.
[2024-05-24 01:34:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16581701976480186611.gal : 5 ms
[2024-05-24 01:34:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14194024269221010248.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/CTLFireability16581701976480186611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14194024269221010248.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 285 transition count 746
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 281 transition count 745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 280 transition count 745
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 10 place count 280 transition count 666
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 168 place count 201 transition count 666
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 178 place count 191 transition count 616
Iterating global reduction 3 with 10 rules applied. Total rules applied 188 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 228 place count 171 transition count 596
Applied a total of 228 rules in 34 ms. Remains 171 /285 variables (removed 114) and now considering 596/750 (removed 154) transitions.
[2024-05-24 01:35:26] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 01:35:26] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 01:35:26] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-24 01:35:26] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 01:35:26] [INFO ] Invariant cache hit.
[2024-05-24 01:35:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 01:35:27] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2024-05-24 01:35:27] [INFO ] Redundant transitions in 4 ms returned []
Running 591 sub problems to find dead transitions.
[2024-05-24 01:35:27] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 01:35:27] [INFO ] Invariant cache hit.
[2024-05-24 01:35:27] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:35:31] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 3 ms to minimize.
[2024-05-24 01:35:31] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-24 01:35:31] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 01:35:31] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 3 ms to minimize.
[2024-05-24 01:35:32] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:35:32] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:35:32] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:35:33] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 3 ms to minimize.
[2024-05-24 01:35:33] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 43 ms to minimize.
[2024-05-24 01:35:33] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 2 ms to minimize.
[2024-05-24 01:35:33] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 2 ms to minimize.
[2024-05-24 01:35:33] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
[2024-05-24 01:35:34] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
[2024-05-24 01:35:34] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-24 01:35:34] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 2 ms to minimize.
[2024-05-24 01:35:34] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:35:34] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-05-24 01:35:34] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 2 ms to minimize.
[2024-05-24 01:35:35] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 3 ms to minimize.
[2024-05-24 01:35:35] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:35:35] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-24 01:35:35] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 01:35:36] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 2 ms to minimize.
[2024-05-24 01:35:36] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-05-24 01:35:36] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 01:35:37] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 3 ms to minimize.
[2024-05-24 01:35:37] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 2 ms to minimize.
[2024-05-24 01:35:38] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-24 01:35:39] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:35:39] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-24 01:35:39] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:35:39] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 3 ms to minimize.
[2024-05-24 01:35:40] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:35:40] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-24 01:35:40] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:35:41] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 3 ms to minimize.
[2024-05-24 01:35:41] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 3 ms to minimize.
[2024-05-24 01:35:41] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 3 ms to minimize.
[2024-05-24 01:35:41] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 2 ms to minimize.
[2024-05-24 01:35:41] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:35:47] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:35:47] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 2 ms to minimize.
[2024-05-24 01:35:49] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:35:49] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 3 ms to minimize.
[2024-05-24 01:35:50] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 3 ms to minimize.
[2024-05-24 01:35:50] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 2 ms to minimize.
[2024-05-24 01:35:50] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 2 ms to minimize.
[2024-05-24 01:35:51] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 3 ms to minimize.
[2024-05-24 01:35:51] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 2 ms to minimize.
[2024-05-24 01:35:51] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 2 ms to minimize.
[2024-05-24 01:35:51] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 2 ms to minimize.
[2024-05-24 01:35:52] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 3 ms to minimize.
[2024-05-24 01:35:52] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 3 ms to minimize.
[2024-05-24 01:35:53] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 2 ms to minimize.
[2024-05-24 01:35:53] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 3 ms to minimize.
[2024-05-24 01:35:54] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 72 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:36:01] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:36:01] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:36:07] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:36:08] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-05-24 01:36:08] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-05-24 01:36:08] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:36:08] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 2 ms to minimize.
[2024-05-24 01:36:08] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 2 ms to minimize.
[2024-05-24 01:36:09] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-05-24 01:36:09] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:36:09] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-24 01:36:10] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 3 ms to minimize.
[2024-05-24 01:36:10] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 3 ms to minimize.
[2024-05-24 01:36:10] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:36:10] [INFO ] Deduced a trap composed of 56 places in 181 ms of which 3 ms to minimize.
[2024-05-24 01:36:11] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 3 ms to minimize.
[2024-05-24 01:36:11] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:36:12] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 2 ms to minimize.
[2024-05-24 01:36:12] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:36:13] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
[2024-05-24 01:36:13] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 19/93 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:36:17] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-05-24 01:36:17] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2024-05-24 01:36:18] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-05-24 01:36:24] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:36:24] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 2 ms to minimize.
[2024-05-24 01:36:25] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:36:25] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 2 ms to minimize.
[2024-05-24 01:36:25] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 3 ms to minimize.
[2024-05-24 01:36:25] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 2 ms to minimize.
[2024-05-24 01:36:26] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 3 ms to minimize.
[2024-05-24 01:36:26] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 3 ms to minimize.
[2024-05-24 01:36:27] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 105 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 89/89 constraints]
After SMT, in 60261ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in SI_CTL mode, iteration 1 : 171/285 places, 596/750 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61048 ms. Remains : 171/285 places, 596/750 transitions.
[2024-05-24 01:36:27] [INFO ] Flatten gal took : 20 ms
[2024-05-24 01:36:27] [INFO ] Flatten gal took : 23 ms
[2024-05-24 01:36:27] [INFO ] Input system was already deterministic with 596 transitions.
RANDOM walk for 744 steps (0 resets) in 16 ms. (43 steps per ms) remains 0/1 properties
FORMULA EisenbergMcGuire-PT-05-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 01:36:27] [INFO ] Flatten gal took : 23 ms
[2024-05-24 01:36:27] [INFO ] Flatten gal took : 23 ms
[2024-05-24 01:36:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1391460312542065501.gal : 4 ms
[2024-05-24 01:36:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4294872785714487418.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1391460312542065501.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4294872785714487418.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 275 transition count 700
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 275 transition count 700
Applied a total of 20 rules in 10 ms. Remains 275 /285 variables (removed 10) and now considering 700/750 (removed 50) transitions.
[2024-05-24 01:36:27] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2024-05-24 01:36:27] [INFO ] Computed 16 invariants in 3 ms
[2024-05-24 01:36:27] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-24 01:36:27] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 01:36:27] [INFO ] Invariant cache hit.
[2024-05-24 01:36:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 01:36:28] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Running 695 sub problems to find dead transitions.
[2024-05-24 01:36:28] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2024-05-24 01:36:28] [INFO ] Invariant cache hit.
[2024-05-24 01:36:29] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 01:36:36] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-05-24 01:36:36] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2024-05-24 01:36:36] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 3 ms to minimize.
[2024-05-24 01:36:37] [INFO ] Deduced a trap composed of 49 places in 249 ms of which 4 ms to minimize.
[2024-05-24 01:36:37] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 4 ms to minimize.
[2024-05-24 01:36:37] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 4 ms to minimize.
[2024-05-24 01:36:37] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:36:38] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 4 ms to minimize.
[2024-05-24 01:36:38] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:36:38] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 4 ms to minimize.
[2024-05-24 01:36:38] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 4 ms to minimize.
[2024-05-24 01:36:38] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-05-24 01:36:39] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 5 ms to minimize.
[2024-05-24 01:36:39] [INFO ] Deduced a trap composed of 51 places in 270 ms of which 4 ms to minimize.
[2024-05-24 01:36:40] [INFO ] Deduced a trap composed of 72 places in 245 ms of which 4 ms to minimize.
[2024-05-24 01:36:40] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 4 ms to minimize.
[2024-05-24 01:36:40] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 4 ms to minimize.
[2024-05-24 01:36:41] [INFO ] Deduced a trap composed of 54 places in 256 ms of which 4 ms to minimize.
[2024-05-24 01:36:41] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 4 ms to minimize.
[2024-05-24 01:36:41] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 01:36:42] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:36:42] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-24 01:36:43] [INFO ] Deduced a trap composed of 57 places in 272 ms of which 4 ms to minimize.
[2024-05-24 01:36:43] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 4 ms to minimize.
[2024-05-24 01:36:43] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 3 ms to minimize.
[2024-05-24 01:36:43] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 4 ms to minimize.
[2024-05-24 01:36:44] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-24 01:36:44] [INFO ] Deduced a trap composed of 80 places in 245 ms of which 4 ms to minimize.
[2024-05-24 01:36:44] [INFO ] Deduced a trap composed of 72 places in 221 ms of which 4 ms to minimize.
[2024-05-24 01:36:44] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 4 ms to minimize.
[2024-05-24 01:36:45] [INFO ] Deduced a trap composed of 66 places in 182 ms of which 3 ms to minimize.
[2024-05-24 01:36:45] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 3 ms to minimize.
[2024-05-24 01:36:45] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 3 ms to minimize.
[2024-05-24 01:36:46] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 4 ms to minimize.
[2024-05-24 01:36:46] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-05-24 01:36:46] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-05-24 01:36:46] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-05-24 01:36:46] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 01:36:47] [INFO ] Deduced a trap composed of 64 places in 303 ms of which 5 ms to minimize.
[2024-05-24 01:36:47] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 01:36:55] [INFO ] Deduced a trap composed of 77 places in 280 ms of which 5 ms to minimize.
[2024-05-24 01:36:55] [INFO ] Deduced a trap composed of 86 places in 227 ms of which 4 ms to minimize.
[2024-05-24 01:36:55] [INFO ] Deduced a trap composed of 71 places in 202 ms of which 3 ms to minimize.
[2024-05-24 01:36:55] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 3 ms to minimize.
[2024-05-24 01:36:56] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 4 ms to minimize.
[2024-05-24 01:36:56] [INFO ] Deduced a trap composed of 54 places in 224 ms of which 4 ms to minimize.
[2024-05-24 01:36:56] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 2 ms to minimize.
[2024-05-24 01:36:57] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2024-05-24 01:36:57] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 4 ms to minimize.
[2024-05-24 01:36:57] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 2 ms to minimize.
[2024-05-24 01:36:57] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 2 ms to minimize.
[2024-05-24 01:36:58] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 4 ms to minimize.
[2024-05-24 01:36:58] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/640 variables, and 69 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 01:37:01] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 6 ms to minimize.
[2024-05-24 01:37:01] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 4 ms to minimize.
[2024-05-24 01:37:01] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 3 ms to minimize.
[2024-05-24 01:37:02] [INFO ] Deduced a trap composed of 79 places in 237 ms of which 4 ms to minimize.
[2024-05-24 01:37:02] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 3 ms to minimize.
[2024-05-24 01:37:02] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 2 ms to minimize.
[2024-05-24 01:37:03] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 4 ms to minimize.
[2024-05-24 01:37:03] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 3 ms to minimize.
[2024-05-24 01:37:03] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 3 ms to minimize.
[2024-05-24 01:37:04] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 5 ms to minimize.
[2024-05-24 01:37:04] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 4 ms to minimize.
[2024-05-24 01:37:04] [INFO ] Deduced a trap composed of 72 places in 248 ms of which 5 ms to minimize.
[2024-05-24 01:37:04] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-05-24 01:37:05] [INFO ] Deduced a trap composed of 47 places in 289 ms of which 4 ms to minimize.
[2024-05-24 01:37:05] [INFO ] Deduced a trap composed of 48 places in 298 ms of which 5 ms to minimize.
[2024-05-24 01:37:06] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:37:06] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 4 ms to minimize.
[2024-05-24 01:37:13] [INFO ] Deduced a trap composed of 84 places in 310 ms of which 4 ms to minimize.
[2024-05-24 01:37:14] [INFO ] Deduced a trap composed of 63 places in 273 ms of which 4 ms to minimize.
[2024-05-24 01:37:14] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 695 unsolved
[2024-05-24 01:37:16] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 4 ms to minimize.
[2024-05-24 01:37:16] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 3 ms to minimize.
[2024-05-24 01:37:16] [INFO ] Deduced a trap composed of 58 places in 230 ms of which 3 ms to minimize.
[2024-05-24 01:37:17] [INFO ] Deduced a trap composed of 60 places in 197 ms of which 4 ms to minimize.
[2024-05-24 01:37:17] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 3 ms to minimize.
[2024-05-24 01:37:17] [INFO ] Deduced a trap composed of 62 places in 252 ms of which 4 ms to minimize.
[2024-05-24 01:37:17] [INFO ] Deduced a trap composed of 74 places in 233 ms of which 3 ms to minimize.
[2024-05-24 01:37:18] [INFO ] Deduced a trap composed of 83 places in 220 ms of which 4 ms to minimize.
[2024-05-24 01:37:18] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:37:18] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 3 ms to minimize.
[2024-05-24 01:37:18] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 3 ms to minimize.
[2024-05-24 01:37:19] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 4 ms to minimize.
[2024-05-24 01:37:22] [INFO ] Deduced a trap composed of 75 places in 234 ms of which 4 ms to minimize.
[2024-05-24 01:37:22] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 4 ms to minimize.
[2024-05-24 01:37:22] [INFO ] Deduced a trap composed of 52 places in 248 ms of which 4 ms to minimize.
[2024-05-24 01:37:26] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 4 ms to minimize.
[2024-05-24 01:37:27] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
[2024-05-24 01:37:28] [INFO ] Deduced a trap composed of 68 places in 240 ms of which 4 ms to minimize.
[2024-05-24 01:37:29] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 5 ms to minimize.
[2024-05-24 01:37:29] [INFO ] Deduced a trap composed of 59 places in 237 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/640 variables, and 109 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/275 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/695 constraints, Known Traps: 93/93 constraints]
After SMT, in 60399ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Starting structural reductions in LTL mode, iteration 1 : 275/285 places, 700/750 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61887 ms. Remains : 275/285 places, 700/750 transitions.
[2024-05-24 01:37:29] [INFO ] Flatten gal took : 24 ms
[2024-05-24 01:37:29] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:37:29] [INFO ] Input system was already deterministic with 700 transitions.
[2024-05-24 01:37:29] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:37:29] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:37:29] [INFO ] Time to serialize gal into /tmp/CTLFireability1179086105430402862.gal : 4 ms
[2024-05-24 01:37:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17779274996989953532.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/CTLFireability1179086105430402862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17779274996989953532.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-24 01:37:59] [INFO ] Flatten gal took : 16 ms
[2024-05-24 01:37:59] [INFO ] Applying decomposition
[2024-05-24 01:37:59] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15678301614253796502.txt' '-o' '/tmp/graph15678301614253796502.bin' '-w' '/tmp/graph15678301614253796502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15678301614253796502.bin' '-l' '-1' '-v' '-w' '/tmp/graph15678301614253796502.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:37:59] [INFO ] Decomposing Gal with order
[2024-05-24 01:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:37:59] [INFO ] Removed a total of 1028 redundant transitions.
[2024-05-24 01:37:59] [INFO ] Flatten gal took : 34 ms
[2024-05-24 01:37:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 9 ms.
[2024-05-24 01:37:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10484874562804755082.gal : 5 ms
[2024-05-24 01:37:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2391514785528725241.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/CTLFireability10484874562804755082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2391514785528725241.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 750/750 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 277 transition count 710
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 277 transition count 710
Applied a total of 16 rules in 6 ms. Remains 277 /285 variables (removed 8) and now considering 710/750 (removed 40) transitions.
[2024-05-24 01:38:29] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
// Phase 1: matrix 375 rows 277 cols
[2024-05-24 01:38:29] [INFO ] Computed 16 invariants in 1 ms
[2024-05-24 01:38:30] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-24 01:38:30] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 01:38:30] [INFO ] Invariant cache hit.
[2024-05-24 01:38:30] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-24 01:38:31] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-05-24 01:38:31] [INFO ] Flow matrix only has 375 transitions (discarded 335 similar events)
[2024-05-24 01:38:31] [INFO ] Invariant cache hit.
[2024-05-24 01:38:31] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 01:38:38] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-05-24 01:38:38] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:38:38] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-24 01:38:38] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 4 ms to minimize.
[2024-05-24 01:38:39] [INFO ] Deduced a trap composed of 50 places in 212 ms of which 4 ms to minimize.
[2024-05-24 01:38:39] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 3 ms to minimize.
[2024-05-24 01:38:39] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 4 ms to minimize.
[2024-05-24 01:38:39] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 3 ms to minimize.
[2024-05-24 01:38:39] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 4 ms to minimize.
[2024-05-24 01:38:40] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 4 ms to minimize.
[2024-05-24 01:38:40] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 4 ms to minimize.
[2024-05-24 01:38:41] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 4 ms to minimize.
[2024-05-24 01:38:41] [INFO ] Deduced a trap composed of 52 places in 274 ms of which 4 ms to minimize.
[2024-05-24 01:38:41] [INFO ] Deduced a trap composed of 53 places in 265 ms of which 4 ms to minimize.
[2024-05-24 01:38:42] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 4 ms to minimize.
[2024-05-24 01:38:42] [INFO ] Deduced a trap composed of 65 places in 262 ms of which 4 ms to minimize.
[2024-05-24 01:38:42] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 4 ms to minimize.
[2024-05-24 01:38:42] [INFO ] Deduced a trap composed of 71 places in 216 ms of which 4 ms to minimize.
[2024-05-24 01:38:43] [INFO ] Deduced a trap composed of 56 places in 234 ms of which 4 ms to minimize.
[2024-05-24 01:38:43] [INFO ] Deduced a trap composed of 60 places in 264 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 01:38:43] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:38:44] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-05-24 01:38:44] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 3 ms to minimize.
[2024-05-24 01:38:45] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 3 ms to minimize.
[2024-05-24 01:38:45] [INFO ] Deduced a trap composed of 74 places in 261 ms of which 5 ms to minimize.
[2024-05-24 01:38:45] [INFO ] Deduced a trap composed of 61 places in 262 ms of which 4 ms to minimize.
[2024-05-24 01:38:46] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 4 ms to minimize.
[2024-05-24 01:38:46] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:38:46] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-24 01:38:46] [INFO ] Deduced a trap composed of 83 places in 242 ms of which 4 ms to minimize.
[2024-05-24 01:38:46] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 3 ms to minimize.
[2024-05-24 01:38:47] [INFO ] Deduced a trap composed of 86 places in 249 ms of which 4 ms to minimize.
[2024-05-24 01:38:47] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 4 ms to minimize.
[2024-05-24 01:38:47] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 3 ms to minimize.
[2024-05-24 01:38:48] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 5 ms to minimize.
[2024-05-24 01:38:48] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 4 ms to minimize.
[2024-05-24 01:38:48] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 4 ms to minimize.
[2024-05-24 01:38:49] [INFO ] Deduced a trap composed of 55 places in 260 ms of which 4 ms to minimize.
[2024-05-24 01:38:49] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 4 ms to minimize.
[2024-05-24 01:38:49] [INFO ] Deduced a trap composed of 61 places in 230 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-24 01:38:56] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-05-24 01:38:57] [INFO ] Deduced a trap composed of 78 places in 266 ms of which 5 ms to minimize.
[2024-05-24 01:38:57] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 4 ms to minimize.
[2024-05-24 01:38:58] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 4 ms to minimize.
[2024-05-24 01:38:58] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 3 ms to minimize.
[2024-05-24 01:38:59] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-05-24 01:38:59] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-05-24 01:38:59] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 3 ms to minimize.
[2024-05-24 01:39:00] [INFO ] Deduced a trap composed of 60 places in 246 ms of which 4 ms to minimize.
[2024-05-24 01:39:00] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 4 ms to minimize.
[2024-05-24 01:39:00] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 3 ms to minimize.
[2024-05-24 01:39:00] [INFO ] Deduced a trap composed of 57 places in 301 ms of which 4 ms to minimize.
[2024-05-24 01:39:01] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 5 ms to minimize.
[2024-05-24 01:39:01] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 4 ms to minimize.
SMT process timed out in 30399ms, After SMT, problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 30409ms
Starting structural reductions in LTL mode, iteration 1 : 277/285 places, 710/750 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31758 ms. Remains : 277/285 places, 710/750 transitions.
[2024-05-24 01:39:01] [INFO ] Flatten gal took : 24 ms
[2024-05-24 01:39:01] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:39:01] [INFO ] Input system was already deterministic with 710 transitions.
[2024-05-24 01:39:01] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:39:01] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:39:01] [INFO ] Time to serialize gal into /tmp/CTLFireability10490514204272221857.gal : 5 ms
[2024-05-24 01:39:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10912138125705099338.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/CTLFireability10490514204272221857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10912138125705099338.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-24 01:39:31] [INFO ] Flatten gal took : 16 ms
[2024-05-24 01:39:31] [INFO ] Applying decomposition
[2024-05-24 01:39:31] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6215143362274192367.txt' '-o' '/tmp/graph6215143362274192367.bin' '-w' '/tmp/graph6215143362274192367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6215143362274192367.bin' '-l' '-1' '-v' '-w' '/tmp/graph6215143362274192367.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:39:31] [INFO ] Decomposing Gal with order
[2024-05-24 01:39:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:39:31] [INFO ] Removed a total of 1089 redundant transitions.
[2024-05-24 01:39:31] [INFO ] Flatten gal took : 36 ms
[2024-05-24 01:39:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 7 ms.
[2024-05-24 01:39:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6269228150831716127.gal : 5 ms
[2024-05-24 01:39:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2711317471295933922.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/CTLFireability6269228150831716127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2711317471295933922.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 01:40:01] [INFO ] Flatten gal took : 16 ms
[2024-05-24 01:40:01] [INFO ] Flatten gal took : 17 ms
[2024-05-24 01:40:01] [INFO ] Applying decomposition
[2024-05-24 01:40:02] [INFO ] Flatten gal took : 18 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/graph1056718593538995350.txt' '-o' '/tmp/graph1056718593538995350.bin' '-w' '/tmp/graph1056718593538995350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1056718593538995350.bin' '-l' '-1' '-v' '-w' '/tmp/graph1056718593538995350.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:40:02] [INFO ] Decomposing Gal with order
[2024-05-24 01:40:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:40:02] [INFO ] Removed a total of 1174 redundant transitions.
[2024-05-24 01:40:02] [INFO ] Flatten gal took : 40 ms
[2024-05-24 01:40:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 263 labels/synchronizations in 13 ms.
[2024-05-24 01:40:02] [INFO ] Time to serialize gal into /tmp/CTLFireability15335803769989009800.gal : 6 ms
[2024-05-24 01:40:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10179187622865984603.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/CTLFireability15335803769989009800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10179187622865984603.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 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,8.72038e+07,1371,5907800,34345,9136,4.73363e+06,336788,1685,1.83643e+07,313,1.24031e+07,0
Converting to forward existential form...Done !
original formula: (EF((AX(((i9.i2.u6.flag_0_active==0)||(i12.i1.u38.p18_3_0==0))) + !(E((((i1.i0.u1.turn_2==1)&&(i12.i0.u5.flag_2_active==1))&&(i9.i2.u6.p2...587
=> equivalent forward existential formula: ([((FwdU((Init * E(TRUE U (!(EX(!(((i9.i2.u6.flag_0_active==0)||(i12.i1.u38.p18_3_0==0))))) + !(E((((i1.i0.u1.tu...1225
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t8, t62, t63, t64, t65, t66, t67, t72, t73, t74, t75, t78, t79, t80, ...2343
Detected timeout of ITS tools.
[2024-05-24 02:09:59] [INFO ] Applying decomposition
[2024-05-24 02:09:59] [INFO ] Flatten gal took : 17 ms
[2024-05-24 02:09:59] [INFO ] Decomposing Gal with order
[2024-05-24 02:09:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:09:59] [INFO ] Removed a total of 1286 redundant transitions.
[2024-05-24 02:09:59] [INFO ] Flatten gal took : 46 ms
[2024-05-24 02:09:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 5 ms.
[2024-05-24 02:09:59] [INFO ] Time to serialize gal into /tmp/CTLFireability18182981165940376637.gal : 5 ms
[2024-05-24 02:09:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3902510733019682860.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/CTLFireability18182981165940376637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3902510733019682860.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.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="EisenbergMcGuire-PT-05"
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 EisenbergMcGuire-PT-05, 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 r158-smll-171636266300162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-05.tgz
mv EisenbergMcGuire-PT-05 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 ;