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.r576-smll-171734919900066.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 MedleyA-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 99K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-09-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717358232435

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 19:57:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 19:57:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:57:15] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-06-02 19:57:15] [INFO ] Transformed 147 places.
[2024-06-02 19:57:15] [INFO ] Transformed 315 transitions.
[2024-06-02 19:57:15] [INFO ] Found NUPN structural information;
[2024-06-02 19:57:15] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
Support contains 84 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 313
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 127 transition count 297
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 127 transition count 297
Applied a total of 34 rules in 47 ms. Remains 127 /145 variables (removed 18) and now considering 297/313 (removed 16) transitions.
// Phase 1: matrix 297 rows 127 cols
[2024-06-02 19:57:15] [INFO ] Computed 10 invariants in 27 ms
[2024-06-02 19:57:15] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-06-02 19:57:15] [INFO ] Invariant cache hit.
[2024-06-02 19:57:16] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-06-02 19:57:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/127 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 19:57:21] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 36 ms to minimize.
[2024-06-02 19:57:21] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2024-06-02 19:57:21] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-06-02 19:57:21] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 2 ms to minimize.
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 13/23 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 19:57:24] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:57:25] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 2 ms to minimize.
[2024-06-02 19:57:25] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
[2024-06-02 19:57:25] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:57:25] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:57:25] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-06-02 19:57:25] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:57:25] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 8/31 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 19:57:27] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:57:27] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:57:27] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 3/34 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/34 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 297/424 variables, 127/161 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 19:57:31] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 2 ms to minimize.
[2024-06-02 19:57:31] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
[2024-06-02 19:57:32] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-06-02 19:57:32] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2024-06-02 19:57:32] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:57:32] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:57:32] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:57:33] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-06-02 19:57:33] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 9/170 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 19:57:35] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-06-02 19:57:36] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 2/172 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 19:57:40] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:57:40] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 2/174 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/174 constraints. Problems are: Problem set: 64 solved, 232 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 174 constraints, problems are : Problem set: 64 solved, 232 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 64 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 37/47 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/47 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 297/424 variables, 127/174 constraints. Problems are: Problem set: 64 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 232/406 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 19:57:57] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 3 ms to minimize.
[2024-06-02 19:57:57] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 2 ms to minimize.
[2024-06-02 19:57:58] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 3 ms to minimize.
[2024-06-02 19:57:58] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 2 ms to minimize.
[2024-06-02 19:57:59] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
[2024-06-02 19:57:59] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 2 ms to minimize.
[2024-06-02 19:57:59] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 3 ms to minimize.
[2024-06-02 19:58:01] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 8/414 constraints. Problems are: Problem set: 64 solved, 232 unsolved
[2024-06-02 19:58:08] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:58:09] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 3 ms to minimize.
[2024-06-02 19:58:09] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 3/417 constraints. Problems are: Problem set: 64 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 417 constraints, problems are : Problem set: 64 solved, 232 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 232/296 constraints, Known Traps: 48/48 constraints]
After SMT, in 60933ms problems are : Problem set: 64 solved, 232 unsolved
Search for dead transitions found 64 dead transitions in 60981ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 127/145 places, 233/313 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61703 ms. Remains : 127/145 places, 233/313 transitions.
Support contains 84 out of 127 places after structural reductions.
[2024-06-02 19:58:17] [INFO ] Flatten gal took : 108 ms
[2024-06-02 19:58:17] [INFO ] Flatten gal took : 38 ms
[2024-06-02 19:58:17] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 82 out of 127 places (down from 84) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 87 to 85
RANDOM walk for 40000 steps (1313 resets) in 3147 ms. (12 steps per ms) remains 51/85 properties
BEST_FIRST walk for 4004 steps (29 resets) in 49 ms. (80 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (28 resets) in 38 ms. (102 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (27 resets) in 28 ms. (138 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (25 resets) in 52 ms. (75 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (27 resets) in 64 ms. (61 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (29 resets) in 74 ms. (53 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (26 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (28 resets) in 47 ms. (83 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (25 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (26 resets) in 29 ms. (133 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4001 steps (33 resets) in 57 ms. (68 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (28 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (25 resets) in 45 ms. (87 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (24 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (25 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (26 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (30 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (27 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (25 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (26 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (27 resets) in 31 ms. (125 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (26 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (23 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (31 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (30 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (26 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (27 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (25 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (26 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (25 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (26 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (28 resets) in 38 ms. (102 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (25 resets) in 29 ms. (133 steps per ms) remains 50/50 properties
// Phase 1: matrix 233 rows 127 cols
[2024-06-02 19:58:19] [INFO ] Computed 10 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 2 (OVERLAPS) 29/89 variables, 4/6 constraints. Problems are: Problem set: 12 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 38 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 4 (OVERLAPS) 26/115 variables, 4/10 constraints. Problems are: Problem set: 19 solved, 31 unsolved
[2024-06-02 19:58:20] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 1/11 constraints. Problems are: Problem set: 19 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 19 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 225/340 variables, 115/126 constraints. Problems are: Problem set: 19 solved, 31 unsolved
[2024-06-02 19:58:21] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 1/127 constraints. Problems are: Problem set: 19 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/127 constraints. Problems are: Problem set: 19 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 16/356 variables, 10/137 constraints. Problems are: Problem set: 19 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/137 constraints. Problems are: Problem set: 19 solved, 31 unsolved
Problem AtomicPropp75 is UNSAT
At refinement iteration 12 (OVERLAPS) 4/360 variables, 2/139 constraints. Problems are: Problem set: 20 solved, 30 unsolved
[2024-06-02 19:58:21] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 1/140 constraints. Problems are: Problem set: 20 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/140 constraints. Problems are: Problem set: 20 solved, 30 unsolved
At refinement iteration 15 (OVERLAPS) 0/360 variables, 0/140 constraints. Problems are: Problem set: 20 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 140 constraints, problems are : Problem set: 20 solved, 30 unsolved in 2938 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 20 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 30 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/78 variables, 4/4 constraints. Problems are: Problem set: 23 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 23 solved, 27 unsolved
Problem AtomicPropp80 is UNSAT
At refinement iteration 3 (OVERLAPS) 35/113 variables, 6/10 constraints. Problems are: Problem set: 24 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 3/13 constraints. Problems are: Problem set: 24 solved, 26 unsolved
[2024-06-02 19:58:23] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:58:23] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:58:23] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:58:23] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 4/17 constraints. Problems are: Problem set: 24 solved, 26 unsolved
[2024-06-02 19:58:23] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:58:23] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 2/19 constraints. Problems are: Problem set: 24 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 24 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 224/337 variables, 113/132 constraints. Problems are: Problem set: 24 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 14/146 constraints. Problems are: Problem set: 24 solved, 26 unsolved
[2024-06-02 19:58:24] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:58:24] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 2/148 constraints. Problems are: Problem set: 24 solved, 26 unsolved
[2024-06-02 19:58:24] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 1/149 constraints. Problems are: Problem set: 24 solved, 26 unsolved
[2024-06-02 19:58:25] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:58:25] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 2/151 constraints. Problems are: Problem set: 24 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 0/151 constraints. Problems are: Problem set: 24 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 18/355 variables, 11/162 constraints. Problems are: Problem set: 24 solved, 26 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 12/174 constraints. Problems are: Problem set: 25 solved, 25 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/174 constraints. Problems are: Problem set: 25 solved, 25 unsolved
At refinement iteration 17 (OVERLAPS) 5/360 variables, 3/177 constraints. Problems are: Problem set: 25 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 177 constraints, problems are : Problem set: 25 solved, 25 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 26/50 constraints, Known Traps: 14/14 constraints]
After SMT, in 8090ms problems are : Problem set: 25 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 124 transition count 223
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 118 transition count 221
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 116 transition count 220
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 19 place count 116 transition count 215
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 29 place count 111 transition count 215
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 44 place count 96 transition count 195
Iterating global reduction 3 with 15 rules applied. Total rules applied 59 place count 96 transition count 195
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 77 place count 87 transition count 186
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 87 place count 82 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 104 place count 82 transition count 197
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 82 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 81 transition count 196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 106 place count 81 transition count 195
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 108 place count 80 transition count 195
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 110 place count 80 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 112 place count 78 transition count 193
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 113 place count 78 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 114 place count 77 transition count 192
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 117 place count 77 transition count 192
Applied a total of 117 rules in 177 ms. Remains 77 /127 variables (removed 50) and now considering 192/233 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 77/127 places, 192/233 transitions.
RANDOM walk for 40000 steps (3094 resets) in 640 ms. (62 steps per ms) remains 11/25 properties
BEST_FIRST walk for 40002 steps (826 resets) in 213 ms. (186 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (773 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (826 resets) in 148 ms. (268 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40001 steps (840 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (842 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (832 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (794 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (836 resets) in 73 ms. (540 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (729 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
// Phase 1: matrix 192 rows 77 cols
[2024-06-02 19:58:28] [INFO ] Computed 11 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 34/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 24/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:58:28] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 192/268 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/269 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 89 constraints, problems are : Problem set: 0 solved, 7 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 34/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 24/76 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 192/268 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/269 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/269 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 97 constraints, problems are : Problem set: 0 solved, 7 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 1575ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 6 properties in 551 ms.
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 185
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 185
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 14 place count 70 transition count 180
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 65 transition count 180
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 62 transition count 177
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 62 transition count 177
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 57 place count 48 transition count 164
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 69 place count 42 transition count 208
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 85 place count 42 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 95 place count 42 transition count 182
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 42 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 40 transition count 180
Applied a total of 99 rules in 51 ms. Remains 40 /77 variables (removed 37) and now considering 180/192 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 40/77 places, 180/192 transitions.
RANDOM walk for 40000 steps (7447 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1353 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20068 steps, run visited all 1 properties in 92 ms. (steps per millisecond=218 )
Probabilistic random walk after 20068 steps, saw 5889 distinct states, run finished after 97 ms. (steps per millisecond=206 ) properties seen :1
Successfully simplified 26 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-09-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:58:31] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:58:31] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:58:31] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 55 out of 127 places (down from 57) after GAL structural reductions.
Computed a total of 14 stabilizing places and 16 stable transitions
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 106 transition count 207
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 106 transition count 207
Applied a total of 42 rules in 7 ms. Remains 106 /127 variables (removed 21) and now considering 207/233 (removed 26) transitions.
// Phase 1: matrix 207 rows 106 cols
[2024-06-02 19:58:31] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:58:31] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 19:58:31] [INFO ] Invariant cache hit.
[2024-06-02 19:58:31] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-06-02 19:58:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:58:33] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:58:33] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:58:33] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:58:33] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-02 19:58:34] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:58:34] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:58:36] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 207/313 variables, 106/123 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:58:40] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-06-02 19:58:40] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 2 ms to minimize.
[2024-06-02 19:58:40] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-06-02 19:58:40] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:58:40] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:58:40] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:58:41] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 7/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 0/313 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 130 constraints, problems are : Problem set: 0 solved, 206 unsolved in 15811 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/313 variables, 106/130 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 206/336 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:58:52] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 19:58:57] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 0/313 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 338 constraints, problems are : Problem set: 0 solved, 206 unsolved in 25320 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 16/16 constraints]
After SMT, in 41331ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 41335ms
Starting structural reductions in LTL mode, iteration 1 : 106/127 places, 207/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41591 ms. Remains : 106/127 places, 207/233 transitions.
[2024-06-02 19:59:12] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:59:12] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:59:12] [INFO ] Input system was already deterministic with 207 transitions.
[2024-06-02 19:59:12] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:59:12] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:59:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6611862182532046936.gal : 8 ms
[2024-06-02 19:59:12] [INFO ] Time to serialize properties into /tmp/CTLFireability6802045821776539840.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6611862182532046936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6802045821776539840.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.31641e+07,3.04949,71712,2,4987,5,201538,6,0,631,322476,0


Converting to forward existential form...Done !
original formula: EX((((p19==1)&&(p55==1)) + (AF(((p5==1)&&(p87==1))) * !(A(EF((p1==1)) U (p57==1))))))
=> equivalent forward existential formula: ([(EY(Init) * ((p19==1)&&(p55==1)))] != FALSE + ([((FwdU((EY(Init) * !(EG(!(((p5==1)&&(p87==1)))))),!((p57==1)))...280
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...452
Detected timeout of ITS tools.
[2024-06-02 19:59:42] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:59:42] [INFO ] Applying decomposition
[2024-06-02 19:59:42] [INFO ] Flatten gal took : 21 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/graph7016573360593663841.txt' '-o' '/tmp/graph7016573360593663841.bin' '-w' '/tmp/graph7016573360593663841.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7016573360593663841.bin' '-l' '-1' '-v' '-w' '/tmp/graph7016573360593663841.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:59:43] [INFO ] Decomposing Gal with order
[2024-06-02 19:59:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:59:43] [INFO ] Removed a total of 342 redundant transitions.
[2024-06-02 19:59:43] [INFO ] Flatten gal took : 81 ms
[2024-06-02 19:59:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 24 ms.
[2024-06-02 19:59:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9972519369691166191.gal : 10 ms
[2024-06-02 19:59:43] [INFO ] Time to serialize properties into /tmp/CTLFireability16818028837820046520.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9972519369691166191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16818028837820046520.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.31641e+07,0.555578,14740,799,185,18880,1224,413,48154,108,7653,0


Converting to forward existential form...Done !
original formula: EX((((i0.u4.p19==1)&&(i3.u14.p55==1)) + (AF(((i0.u2.p5==1)&&(i5.u20.p87==1))) * !(A(EF((i7.i0.u1.p1==1)) U (i3.u14.p57==1))))))
=> equivalent forward existential formula: ([(EY(Init) * ((i0.u4.p19==1)&&(i3.u14.p55==1)))] != FALSE + ([((FwdU((EY(Init) * !(EG(!(((i0.u2.p5==1)&&(i5.u20...349
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t62, t77, i0.t97, i0.u2.t96, i0.u4.t93, i0.u28.t16, i0.u28.t144, i1.u3.t95, i1.u5.t9...720
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 104 transition count 204
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 104 transition count 204
Applied a total of 46 rules in 9 ms. Remains 104 /127 variables (removed 23) and now considering 204/233 (removed 29) transitions.
// Phase 1: matrix 204 rows 104 cols
[2024-06-02 20:00:13] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:00:13] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 20:00:13] [INFO ] Invariant cache hit.
[2024-06-02 20:00:13] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-06-02 20:00:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:00:16] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 3 ms to minimize.
[2024-06-02 20:00:16] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:00:16] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:00:16] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:00:16] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-06-02 20:00:16] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:00:19] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:00:19] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2024-06-02 20:00:20] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:00:20] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2024-06-02 20:00:20] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:00:20] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-06-02 20:00:20] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 7/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 127 constraints, problems are : Problem set: 0 solved, 203 unsolved in 12916 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:00:32] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:00:32] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 332 constraints, problems are : Problem set: 0 solved, 203 unsolved in 15544 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 15/15 constraints]
After SMT, in 28735ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 28739ms
Starting structural reductions in LTL mode, iteration 1 : 104/127 places, 204/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29092 ms. Remains : 104/127 places, 204/233 transitions.
[2024-06-02 20:00:42] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:00:42] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:00:42] [INFO ] Input system was already deterministic with 204 transitions.
[2024-06-02 20:00:42] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:00:42] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:00:42] [INFO ] Time to serialize gal into /tmp/CTLFireability18163759231458209006.gal : 4 ms
[2024-06-02 20:00:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15978181653909011786.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/CTLFireability18163759231458209006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15978181653909011786.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.81538e+07,2.04446,46572,2,3216,5,135037,6,0,620,189146,0


Converting to forward existential form...Done !
original formula: EG((EX(AF((p34==1))) + AF(((p56==1)&&(p94==1)))))
=> equivalent forward existential formula: [FwdG(Init,(EX(!(EG(!((p34==1))))) + !(EG(!(((p56==1)&&(p94==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...417
Detected timeout of ITS tools.
[2024-06-02 20:01:12] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:01:12] [INFO ] Applying decomposition
[2024-06-02 20:01:12] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12005938191384663934.txt' '-o' '/tmp/graph12005938191384663934.bin' '-w' '/tmp/graph12005938191384663934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12005938191384663934.bin' '-l' '-1' '-v' '-w' '/tmp/graph12005938191384663934.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:01:12] [INFO ] Decomposing Gal with order
[2024-06-02 20:01:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:01:12] [INFO ] Removed a total of 317 redundant transitions.
[2024-06-02 20:01:12] [INFO ] Flatten gal took : 26 ms
[2024-06-02 20:01:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 7 ms.
[2024-06-02 20:01:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2772540932273614624.gal : 4 ms
[2024-06-02 20:01:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3138159592317863727.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/CTLFireability2772540932273614624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3138159592317863727.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.81538e+07,0.134465,8076,516,149,8304,1165,380,16677,109,4435,0


Converting to forward existential form...Done !
original formula: EG((EX(AF((i2.u7.p34==1))) + AF(((i3.u12.p56==1)&&(i5.u18.p94==1)))))
=> equivalent forward existential formula: [FwdG(Init,(EX(!(EG(!((i2.u7.p34==1))))) + !(EG(!(((i3.u12.p56==1)&&(i5.u18.p94==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t62, i0.i1.u25.t14, i0.i1.u25.t15, i1.i0.u1.t93, i1.i0.u4.t90, i1.i1.u24.t16, i1.i1....701
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 105 transition count 205
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 105 transition count 205
Applied a total of 44 rules in 8 ms. Remains 105 /127 variables (removed 22) and now considering 205/233 (removed 28) transitions.
// Phase 1: matrix 205 rows 105 cols
[2024-06-02 20:01:42] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 20:01:42] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 20:01:42] [INFO ] Invariant cache hit.
[2024-06-02 20:01:43] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-06-02 20:01:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:01:45] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:01:45] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-02 20:01:45] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-02 20:01:45] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:01:46] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:01:46] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:01:49] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:01:49] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-06-02 20:01:49] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:01:49] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-06-02 20:01:49] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 126 constraints, problems are : Problem set: 0 solved, 204 unsolved in 12919 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/330 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:02:01] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-06-02 20:02:01] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 332 constraints, problems are : Problem set: 0 solved, 204 unsolved in 17732 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 13/13 constraints]
After SMT, in 30828ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 30831ms
Starting structural reductions in LTL mode, iteration 1 : 105/127 places, 205/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31109 ms. Remains : 105/127 places, 205/233 transitions.
[2024-06-02 20:02:13] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:02:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:02:13] [INFO ] Input system was already deterministic with 205 transitions.
[2024-06-02 20:02:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:02:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:02:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9958952925242867236.gal : 5 ms
[2024-06-02 20:02:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17678225438504629667.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/CTLFireability9958952925242867236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17678225438504629667.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.81633e+07,2.16475,49416,2,3428,5,144657,6,0,625,201593,0


Converting to forward existential form...Done !
original formula: AX(EF((AX((p79==0)) * AG((((p19==1)&&(p32==1))&&((p70==1)&&(p83==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (!(EX(!((p79==0)))) * !(E(TRUE U !((((p19==1)&&(p32==1))&&((p70==1)&&(p83==1))))))))))] ...162
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...422
(forward)formula 0,0,4.56479,73196,1,0,357,321069,434,131,5657,249946,421
FORMULA MedleyA-PT-09-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 105 transition count 206
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 105 transition count 206
Applied a total of 44 rules in 9 ms. Remains 105 /127 variables (removed 22) and now considering 206/233 (removed 27) transitions.
// Phase 1: matrix 206 rows 105 cols
[2024-06-02 20:02:18] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:02:18] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 20:02:18] [INFO ] Invariant cache hit.
[2024-06-02 20:02:18] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-02 20:02:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:02:21] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-06-02 20:02:21] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:02:21] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-06-02 20:02:21] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-06-02 20:02:22] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:02:22] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:02:24] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:02:24] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:02:25] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:02:25] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:02:25] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:02:25] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 127 constraints, problems are : Problem set: 0 solved, 205 unsolved in 12790 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/311 variables, 105/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 205/332 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:02:39] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-06-02 20:02:39] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 334 constraints, problems are : Problem set: 0 solved, 205 unsolved in 23709 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 14/14 constraints]
After SMT, in 36798ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 36802ms
Starting structural reductions in LTL mode, iteration 1 : 105/127 places, 206/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37117 ms. Remains : 105/127 places, 206/233 transitions.
[2024-06-02 20:02:55] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:02:55] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:02:55] [INFO ] Input system was already deterministic with 206 transitions.
[2024-06-02 20:02:55] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:02:55] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:02:55] [INFO ] Time to serialize gal into /tmp/CTLFireability5467145927053441821.gal : 3 ms
[2024-06-02 20:02:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3059568561928297271.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/CTLFireability5467145927053441821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3059568561928297271.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.8158e+07,1.90216,47520,2,3315,5,137139,6,0,626,192610,0


Converting to forward existential form...Done !
original formula: EF((((AG((EG((((p19==1)&&(p32==1))&&((p78==1)&&(p117==1)))) * (AX((p100==1)) + AG((((p70==1)&&(p83==1))&&((p121==1)&&(p145==1))))))) * (p...202
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (p145==1)) * ((p117==1)&&(p121==1))) * (p78==1)) * !(E(TRUE U !((EG((((p19==1)&&(p32==1))...284
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t25, t27, t28, t30, t31, t32, t35, t36, t37, t39, t41, t45, t46,...422
(forward)formula 0,0,5.60842,110916,1,0,471,516410,443,167,5817,475787,570
FORMULA MedleyA-PT-09-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 106 transition count 206
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 106 transition count 206
Applied a total of 42 rules in 3 ms. Remains 106 /127 variables (removed 21) and now considering 206/233 (removed 27) transitions.
// Phase 1: matrix 206 rows 106 cols
[2024-06-02 20:03:01] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 20:03:01] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 20:03:01] [INFO ] Invariant cache hit.
[2024-06-02 20:03:01] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-02 20:03:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:03:04] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-06-02 20:03:04] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:03:04] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:03:04] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-02 20:03:04] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:03:04] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-06-02 20:03:05] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:03:05] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:03:08] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:03:08] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:03:08] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
[2024-06-02 20:03:08] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:03:08] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 129 constraints, problems are : Problem set: 0 solved, 205 unsolved in 13159 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 205/334 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:03:20] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:03:29] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/312 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:03:33] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-06-02 20:03:33] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:03:35] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 339 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 18/18 constraints]
After SMT, in 43455ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 43458ms
Starting structural reductions in LTL mode, iteration 1 : 106/127 places, 206/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43695 ms. Remains : 106/127 places, 206/233 transitions.
[2024-06-02 20:03:45] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:03:45] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:03:45] [INFO ] Input system was already deterministic with 206 transitions.
[2024-06-02 20:03:45] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:03:45] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:03:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17717932987733201556.gal : 4 ms
[2024-06-02 20:03:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5327550220637895211.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/CTLFireability17717932987733201556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5327550220637895211.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.11561e+07,4.29576,93676,2,5825,5,254239,6,0,630,379874,0


Converting to forward existential form...Done !
original formula: AX(((AG(!(A((p75==1) U (p76==1)))) * ((p99==0)||(p119==0))) + (AG((((p19==0)||(p58==0))||((p121==0)||(p139==0)))) * (((p78==0)||(p86==0))...170
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !((!(E(TRUE U !(!(!((E(!((p76==1)) U (!((p75==1)) * !((p76==1)))) + EG(!((p76==1))))))))) * ...430
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...442
Detected timeout of ITS tools.
[2024-06-02 20:04:15] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:04:15] [INFO ] Applying decomposition
[2024-06-02 20:04:15] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8168383796569702332.txt' '-o' '/tmp/graph8168383796569702332.bin' '-w' '/tmp/graph8168383796569702332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8168383796569702332.bin' '-l' '-1' '-v' '-w' '/tmp/graph8168383796569702332.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:04:15] [INFO ] Decomposing Gal with order
[2024-06-02 20:04:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:04:15] [INFO ] Removed a total of 340 redundant transitions.
[2024-06-02 20:04:15] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:04:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 7 ms.
[2024-06-02 20:04:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1791022425645100336.gal : 3 ms
[2024-06-02 20:04:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9790163847121309640.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/CTLFireability1791022425645100336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9790163847121309640.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.11561e+07,0.343978,13660,746,228,16924,3272,392,46774,114,16219,0


Converting to forward existential form...Done !
original formula: AX(((AG(!(A((i6.u15.p75==1) U (i6.u15.p76==1)))) * ((i5.u18.p99==0)||(i6.u25.p119==0))) + (AG((((i3.u2.p19==0)||(i3.u2.p58==0))||((i1.i1....251
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !((!(E(TRUE U !(!(!((E(!((i6.u15.p76==1)) U (!((i6.u15.p75==1)) * !((i6.u15.p76==1)))) + EG(...567
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t64, i0.i1.t15, i0.i1.u29.t14, i1.i0.u1.t95, i1.i0.u4.t92, i1.i1.u27.t16, i1.i1.u27....737
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 104 transition count 204
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 104 transition count 204
Applied a total of 46 rules in 6 ms. Remains 104 /127 variables (removed 23) and now considering 204/233 (removed 29) transitions.
// Phase 1: matrix 204 rows 104 cols
[2024-06-02 20:04:45] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:04:45] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 20:04:45] [INFO ] Invariant cache hit.
[2024-06-02 20:04:45] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-06-02 20:04:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:04:51] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:04:52] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:04:52] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:04:52] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:04:52] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:04:52] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:04:52] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 7/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 127 constraints, problems are : Problem set: 0 solved, 203 unsolved in 12286 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:05:03] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:05:03] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 332 constraints, problems are : Problem set: 0 solved, 203 unsolved in 17625 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 15/15 constraints]
After SMT, in 30105ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 30107ms
Starting structural reductions in LTL mode, iteration 1 : 104/127 places, 204/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30417 ms. Remains : 104/127 places, 204/233 transitions.
[2024-06-02 20:05:15] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:05:15] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:05:15] [INFO ] Input system was already deterministic with 204 transitions.
[2024-06-02 20:05:15] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:05:15] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:05:15] [INFO ] Time to serialize gal into /tmp/CTLFireability18217729818560230172.gal : 2 ms
[2024-06-02 20:05:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13076926303302885426.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/CTLFireability18217729818560230172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13076926303302885426.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.81538e+07,1.90813,46200,2,3216,5,135037,6,0,620,189146,0


Converting to forward existential form...Done !
original formula: AF(((p87==0) * AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(((p87==0) * !(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...417
Detected timeout of ITS tools.
[2024-06-02 20:05:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:05:46] [INFO ] Applying decomposition
[2024-06-02 20:05:46] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18102375113655441516.txt' '-o' '/tmp/graph18102375113655441516.bin' '-w' '/tmp/graph18102375113655441516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18102375113655441516.bin' '-l' '-1' '-v' '-w' '/tmp/graph18102375113655441516.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:05:46] [INFO ] Decomposing Gal with order
[2024-06-02 20:05:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:05:46] [INFO ] Removed a total of 317 redundant transitions.
[2024-06-02 20:05:46] [INFO ] Flatten gal took : 28 ms
[2024-06-02 20:05:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 5 ms.
[2024-06-02 20:05:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1596560683538696366.gal : 3 ms
[2024-06-02 20:05:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16945281788925479589.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/CTLFireability1596560683538696366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16945281788925479589.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.81538e+07,0.246282,11024,535,172,13255,1143,365,29863,113,6692,0


Converting to forward existential form...Done !
original formula: AF(((i4.u20.p87==0) * AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(((i4.u20.p87==0) * !(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t32, t37, t62, i0.u1.t93, i0.u4.t90, i1.t81, i1.t77, i1.u5.t60, i1.u5.t88, i1.u5.t89...635
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,13.8216,308044,1,0,513625,5174,1730,1.57833e+06,594,54636,662717
FORMULA MedleyA-PT-09-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 108 transition count 210
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 108 transition count 210
Applied a total of 38 rules in 3 ms. Remains 108 /127 variables (removed 19) and now considering 210/233 (removed 23) transitions.
// Phase 1: matrix 210 rows 108 cols
[2024-06-02 20:06:00] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:06:00] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:06:00] [INFO ] Invariant cache hit.
[2024-06-02 20:06:00] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-06-02 20:06:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 20:06:02] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:06:02] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-06-02 20:06:02] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:06:03] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-02 20:06:03] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:06:03] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:06:03] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:06:03] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:06:03] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-06-02 20:06:03] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:06:03] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/318 variables, 108/129 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 20:06:06] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:06:07] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-02 20:06:07] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:06:07] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:06:07] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
[2024-06-02 20:06:07] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 6/135 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 20:06:10] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 136 constraints, problems are : Problem set: 0 solved, 209 unsolved in 15704 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/318 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 209/345 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-02 20:06:24] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:06:24] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/318 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 0/318 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 347 constraints, problems are : Problem set: 0 solved, 209 unsolved in 21476 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 20/20 constraints]
After SMT, in 37358ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 37361ms
Starting structural reductions in LTL mode, iteration 1 : 108/127 places, 210/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37588 ms. Remains : 108/127 places, 210/233 transitions.
[2024-06-02 20:06:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:06:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:06:37] [INFO ] Input system was already deterministic with 210 transitions.
[2024-06-02 20:06:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:06:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:06:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17773277006621649473.gal : 3 ms
[2024-06-02 20:06:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2219835129226264146.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/CTLFireability17773277006621649473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2219835129226264146.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.28275e+07,5.86568,133752,2,7835,5,336450,6,0,642,517637,0


Converting to forward existential form...Done !
original formula: E(!(AX(FALSE)) U ((AX(EF(((p75==1)&&(p137==1)))) + (((p19==1)&&(p36==1))&&((p78==1)&&(p117==1)))) + ((EF(((((p78==1)&&(p83==1))&&((p121==...366
=> equivalent forward existential formula: (([(FwdU(Init,!(!(EX(!(FALSE))))) * !(EX(!(E(TRUE U ((p75==1)&&(p137==1)))))))] != FALSE + [(FwdU(Init,!(!(EX(!(...994
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t34, t35, t37, t39, t40, t41,...472
Detected timeout of ITS tools.
[2024-06-02 20:07:07] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:07:07] [INFO ] Applying decomposition
[2024-06-02 20:07:07] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17278900826648636095.txt' '-o' '/tmp/graph17278900826648636095.bin' '-w' '/tmp/graph17278900826648636095.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17278900826648636095.bin' '-l' '-1' '-v' '-w' '/tmp/graph17278900826648636095.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:07:07] [INFO ] Decomposing Gal with order
[2024-06-02 20:07:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:07:07] [INFO ] Removed a total of 341 redundant transitions.
[2024-06-02 20:07:07] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:07:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 6 ms.
[2024-06-02 20:07:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2080565976424919969.gal : 3 ms
[2024-06-02 20:07:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2528180655739377355.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/CTLFireability2080565976424919969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2528180655739377355.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.28275e+07,1.23461,32192,937,171,42158,2656,421,184268,103,16744,0


Converting to forward existential form...Done !
original formula: E(!(AX(FALSE)) U ((AX(EF(((i6.i1.u14.p75==1)&&(i0.i1.u27.p137==1)))) + (((i7.u3.p19==1)&&(i2.u8.p36==1))&&((i6.i1.u14.p78==1)&&(i6.i1.u14...561
=> equivalent forward existential formula: (([(FwdU(Init,!(!(EX(!(FALSE))))) * !(EX(!(E(TRUE U ((i6.i1.u14.p75==1)&&(i0.i1.u27.p137==1)))))))] != FALSE + [...1391
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t66, t81, i0.i1.u25.t14, i0.i1.u25.t15, i1.u2.t99, i1.u4.t96, i2.t84, i2.t83, i2.u6....832
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 123 transition count 212
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 106 transition count 208
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 104 transition count 206
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 43 place count 104 transition count 201
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 53 place count 99 transition count 201
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 74 place count 78 transition count 173
Iterating global reduction 3 with 21 rules applied. Total rules applied 95 place count 78 transition count 173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 95 place count 78 transition count 171
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 76 transition count 171
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 129 place count 60 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 59 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 59 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 137 place count 59 transition count 149
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 59 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 57 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 141 place count 57 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 145 place count 55 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 149 place count 53 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 151 place count 51 transition count 141
Applied a total of 151 rules in 53 ms. Remains 51 /127 variables (removed 76) and now considering 141/233 (removed 92) transitions.
// Phase 1: matrix 141 rows 51 cols
[2024-06-02 20:07:37] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:07:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:07:37] [INFO ] Invariant cache hit.
[2024-06-02 20:07:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 20:07:38] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-06-02 20:07:38] [INFO ] Redundant transitions in 5 ms returned []
Running 137 sub problems to find dead transitions.
[2024-06-02 20:07:38] [INFO ] Invariant cache hit.
[2024-06-02 20:07:38] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 141/192 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 75 constraints, problems are : Problem set: 0 solved, 137 unsolved in 3390 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 141/192 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 137/212 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-06-02 20:07:44] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 213 constraints, problems are : Problem set: 0 solved, 137 unsolved in 7289 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 1/1 constraints]
After SMT, in 10843ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 10845ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/127 places, 141/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11186 ms. Remains : 51/127 places, 141/233 transitions.
[2024-06-02 20:07:49] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:07:49] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:07:49] [INFO ] Input system was already deterministic with 141 transitions.
[2024-06-02 20:07:49] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:07:49] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:07:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7658346311108788618.gal : 1 ms
[2024-06-02 20:07:49] [INFO ] Time to serialize properties into /tmp/CTLFireability4810042178590680554.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/CTLFireability7658346311108788618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4810042178590680554.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.
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,357810,0.171975,8340,2,518,5,18591,6,0,340,18645,0


Converting to forward existential form...Done !
original formula: AG(EF((p26==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p26==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t8, t10, t15, t16, t30, t87, t90, t105, t106, t107, t127, t128, t129, t131, t...266
(forward)formula 0,0,0.337294,10188,1,0,211,30737,303,66,3265,23081,292
FORMULA MedleyA-PT-09-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 123 transition count 213
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 107 transition count 209
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 42 place count 105 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 104 transition count 206
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 43 place count 104 transition count 200
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 55 place count 98 transition count 200
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 76 place count 77 transition count 172
Iterating global reduction 4 with 21 rules applied. Total rules applied 97 place count 77 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 97 place count 77 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 76 transition count 171
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 126 place count 62 transition count 158
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 61 transition count 156
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 61 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 134 place count 61 transition count 150
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 136 place count 61 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 138 place count 59 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 138 place count 59 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 142 place count 57 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 146 place count 55 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 148 place count 53 transition count 142
Applied a total of 148 rules in 48 ms. Remains 53 /127 variables (removed 74) and now considering 142/233 (removed 91) transitions.
// Phase 1: matrix 142 rows 53 cols
[2024-06-02 20:07:49] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:07:49] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:07:49] [INFO ] Invariant cache hit.
[2024-06-02 20:07:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 20:07:49] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-02 20:07:49] [INFO ] Redundant transitions in 5 ms returned []
Running 135 sub problems to find dead transitions.
[2024-06-02 20:07:49] [INFO ] Invariant cache hit.
[2024-06-02 20:07:49] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 3/53 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 142/195 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 70 constraints, problems are : Problem set: 0 solved, 135 unsolved in 3787 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 3/53 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 142/195 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 135/205 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 205 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6650 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 10607ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 10608ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/127 places, 142/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10836 ms. Remains : 53/127 places, 142/233 transitions.
[2024-06-02 20:08:00] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:08:00] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:08:00] [INFO ] Input system was already deterministic with 142 transitions.
[2024-06-02 20:08:00] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:08:00] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability2211236037073126997.gal : 2 ms
[2024-06-02 20:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14117432770331629955.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/CTLFireability2211236037073126997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14117432770331629955.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.
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,546480,0.269383,7900,2,466,5,18554,6,0,353,18002,0


Converting to forward existential form...Done !
original formula: E(EF(!(AG(!(EF((((p11==1)&&(p24==1))&&((p78==1)&&(p91==1)))))))) U !(EG(AF(AG((p39==1))))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(!(E(TRUE U !(!(E(TRUE U (((p11==1)&&(p24==1))&&((p78==1)&&(p91==1))))))))))) * !(EG(!(EG(...197
Reverse transition relation is NOT exact ! Due to transitions t2, t14, t49, t88, t106, t130, t132, Intersection with reachable at each step enabled. (dest...198
(forward)formula 0,1,11.611,263548,1,0,508,1.33638e+06,319,258,3614,1.40421e+06,653
FORMULA MedleyA-PT-09-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 106 transition count 206
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 106 transition count 206
Applied a total of 42 rules in 2 ms. Remains 106 /127 variables (removed 21) and now considering 206/233 (removed 27) transitions.
// Phase 1: matrix 206 rows 106 cols
[2024-06-02 20:08:12] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 20:08:12] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:08:12] [INFO ] Invariant cache hit.
[2024-06-02 20:08:12] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-02 20:08:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:08:14] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-06-02 20:08:14] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:08:15] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:08:15] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:08:15] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:08:15] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:08:18] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:08:18] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:08:19] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2024-06-02 20:08:19] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:08:19] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 127 constraints, problems are : Problem set: 0 solved, 205 unsolved in 12782 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 205/332 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:08:30] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:08:30] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:08:30] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 20:08:35] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/312 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 336 constraints, problems are : Problem set: 0 solved, 205 unsolved in 23670 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 15/15 constraints]
After SMT, in 36755ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 36760ms
Starting structural reductions in LTL mode, iteration 1 : 106/127 places, 206/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37014 ms. Remains : 106/127 places, 206/233 transitions.
[2024-06-02 20:08:49] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:08:49] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:08:49] [INFO ] Input system was already deterministic with 206 transitions.
[2024-06-02 20:08:49] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:08:49] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:08:49] [INFO ] Time to serialize gal into /tmp/CTLFireability12574860174312630846.gal : 3 ms
[2024-06-02 20:08:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15142109545057949657.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/CTLFireability12574860174312630846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15142109545057949657.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.55789e+07,3.46883,78800,2,5979,5,213389,6,0,630,320272,0


Converting to forward existential form...Done !
original formula: (EX((p28==1)) + A((p10==1) U AF(AX((p65==1)))))
=> equivalent forward existential formula: ([(EY(Init) * (p28==1))] != FALSE + [((Init * !(EG(!(!(EG(!(!(EX(!((p65==1))))))))))) * !(E(!(!(EG(!(!(EX(!((p65...230
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...442
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-02 20:09:19] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:09:19] [INFO ] Applying decomposition
[2024-06-02 20:09:19] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15885580199812978362.txt' '-o' '/tmp/graph15885580199812978362.bin' '-w' '/tmp/graph15885580199812978362.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15885580199812978362.bin' '-l' '-1' '-v' '-w' '/tmp/graph15885580199812978362.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:09:19] [INFO ] Decomposing Gal with order
[2024-06-02 20:09:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:09:19] [INFO ] Removed a total of 423 redundant transitions.
[2024-06-02 20:09:19] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:09:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2024-06-02 20:09:19] [INFO ] Time to serialize gal into /tmp/CTLFireability7828676898212390107.gal : 2 ms
[2024-06-02 20:09:19] [INFO ] Time to serialize properties into /tmp/CTLFireability6682201762333812832.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/CTLFireability7828676898212390107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6682201762333812832.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.55789e+07,0.215364,10428,577,77,12545,724,388,29270,81,3399,0


Converting to forward existential form...Done !
original formula: (EX((i2.u5.p28==1)) + A((i1.u1.p10==1) U AF(AX((i5.u15.p65==1)))))
=> equivalent forward existential formula: ([(EY(Init) * (i2.u5.p28==1))] != FALSE + [((Init * !(EG(!(!(EG(!(!(EX(!((i5.u15.p65==1))))))))))) * !(E(!(!(EG(...263
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t63, i1.u1.t94, i1.u1.t95, i1.u4.t91, i2.t84, i2.t83, i2.t82, i2.t79, i2.t78, i2.u5....726
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,8.80994,221864,1,0,307096,2574,2180,1.23562e+06,363,20311,281587
FORMULA MedleyA-PT-09-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 123 transition count 212
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 106 transition count 210
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 105 transition count 208
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 104 transition count 207
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 42 place count 104 transition count 202
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 52 place count 99 transition count 202
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 73 place count 78 transition count 174
Iterating global reduction 4 with 21 rules applied. Total rules applied 94 place count 78 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 94 place count 78 transition count 172
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 98 place count 76 transition count 172
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 128 place count 60 transition count 158
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 59 transition count 156
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 59 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 136 place count 59 transition count 150
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 138 place count 59 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 140 place count 57 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 140 place count 57 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 144 place count 55 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 148 place count 53 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 150 place count 51 transition count 142
Applied a total of 150 rules in 34 ms. Remains 51 /127 variables (removed 76) and now considering 142/233 (removed 91) transitions.
// Phase 1: matrix 142 rows 51 cols
[2024-06-02 20:09:28] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:09:28] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:09:28] [INFO ] Invariant cache hit.
[2024-06-02 20:09:28] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 20:09:28] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-02 20:09:28] [INFO ] Redundant transitions in 4 ms returned []
Running 136 sub problems to find dead transitions.
[2024-06-02 20:09:28] [INFO ] Invariant cache hit.
[2024-06-02 20:09:28] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 142/193 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 75 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4086 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/51 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 142/193 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 136/211 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 211 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4680 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 8874ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 8876ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/127 places, 142/233 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9085 ms. Remains : 51/127 places, 142/233 transitions.
[2024-06-02 20:09:37] [INFO ] Flatten gal took : 4 ms
[2024-06-02 20:09:37] [INFO ] Flatten gal took : 4 ms
[2024-06-02 20:09:37] [INFO ] Input system was already deterministic with 142 transitions.
[2024-06-02 20:09:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:09:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:09:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6610728661597448343.gal : 3 ms
[2024-06-02 20:09:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10859084592763451909.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/ReachabilityCardinality6610728661597448343.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10859084592763451909.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (5118 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (971 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality10859084592763451909.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 1608
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1608 after 9230
Reachability property MedleyA-PT-09-CTLFireability-2024-12 is true.
FORMULA MedleyA-PT-09-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,32932,0.120832,5256,2,846,13,6375,6,0,342,4585,0
Total reachable state count : 32932

Verifying 1 reachability properties.
Reachability property MedleyA-PT-09-CTLFireability-2024-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-09-CTLFireability-2024-12,101,0.121596,5256,2,109,13,6375,7,0,345,4585,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 125953 steps, run visited all 1 properties in 291 ms. (steps per millisecond=432 )
Probabilistic random walk after 125953 steps, saw 29351 distinct states, run finished after 291 ms. (steps per millisecond=432 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 104 transition count 204
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 104 transition count 204
Applied a total of 46 rules in 2 ms. Remains 104 /127 variables (removed 23) and now considering 204/233 (removed 29) transitions.
// Phase 1: matrix 204 rows 104 cols
[2024-06-02 20:09:37] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:09:37] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 20:09:37] [INFO ] Invariant cache hit.
[2024-06-02 20:09:37] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-06-02 20:09:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:09:40] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:09:40] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:09:40] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-02 20:09:40] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-06-02 20:09:40] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:09:40] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:09:43] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:09:44] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 3 ms to minimize.
[2024-06-02 20:09:44] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:09:44] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:09:44] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:09:44] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-02 20:09:44] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 7/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 127 constraints, problems are : Problem set: 0 solved, 203 unsolved in 12834 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:09:56] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:09:56] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 332 constraints, problems are : Problem set: 0 solved, 203 unsolved in 17634 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 15/15 constraints]
After SMT, in 30734ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 30737ms
Starting structural reductions in LTL mode, iteration 1 : 104/127 places, 204/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31041 ms. Remains : 104/127 places, 204/233 transitions.
[2024-06-02 20:10:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:10:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:10:08] [INFO ] Input system was already deterministic with 204 transitions.
[2024-06-02 20:10:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:10:08] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:10:08] [INFO ] Time to serialize gal into /tmp/CTLFireability1858889857909520712.gal : 4 ms
[2024-06-02 20:10:08] [INFO ] Time to serialize properties into /tmp/CTLFireability1448514718129389978.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/CTLFireability1858889857909520712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1448514718129389978.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.81538e+07,1.64745,46452,2,3216,5,135037,6,0,620,189146,0


Converting to forward existential form...Done !
original formula: ((AX(FALSE) * AF(((((p19==1)&&(p58==1))&&((p121==1)&&(p139==1)))||(((p19==1)&&(p36==1))&&((p70==1)&&(p83==1)))))) * EG(EF((p94!=1))))
=> equivalent forward existential formula: (([(EY(Init) * !(FALSE))] = FALSE * [FwdG(Init,!(((((p19==1)&&(p58==1))&&((p121==1)&&(p139==1)))||(((p19==1)&&(p...246
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...417
Detected timeout of ITS tools.
[2024-06-02 20:10:38] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:10:38] [INFO ] Applying decomposition
[2024-06-02 20:10:38] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13126585509737616285.txt' '-o' '/tmp/graph13126585509737616285.bin' '-w' '/tmp/graph13126585509737616285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13126585509737616285.bin' '-l' '-1' '-v' '-w' '/tmp/graph13126585509737616285.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:10:38] [INFO ] Decomposing Gal with order
[2024-06-02 20:10:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:10:38] [INFO ] Removed a total of 353 redundant transitions.
[2024-06-02 20:10:38] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:10:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 4 ms.
[2024-06-02 20:10:38] [INFO ] Time to serialize gal into /tmp/CTLFireability1252687792728614389.gal : 3 ms
[2024-06-02 20:10:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12231434708086560469.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/CTLFireability1252687792728614389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12231434708086560469.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.81538e+07,0.14036,7708,470,78,7036,363,353,20716,82,1802,0


Converting to forward existential form...Done !
original formula: ((AX(FALSE) * AF(((((i2.u2.p19==1)&&(i2.u2.p58==1))&&((i3.i0.u25.p121==1)&&(i3.i0.u30.p139==1)))||(((i2.u2.p19==1)&&(i1.u8.p36==1))&&((i3...222
=> equivalent forward existential formula: (([(EY(Init) * !(FALSE))] = FALSE * [FwdG(Init,!(((((i2.u2.p19==1)&&(i2.u2.p58==1))&&((i3.i0.u25.p121==1)&&(i3.i...317
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t62, i0.u1.t93, i0.u4.t90, i1.t81, i1.t77, i1.u5.t60, i1.u5.t88, i1.u5.t89, i1.u6.t8...651
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,9.68276,270332,1,0,411423,2740,2149,1.58396e+06,413,22047,318723
FORMULA MedleyA-PT-09-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Graph (complete) has 427 edges and 127 vertex of which 124 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 123 transition count 211
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 105 transition count 207
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 103 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 45 place count 103 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 98 transition count 200
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 75 place count 78 transition count 173
Iterating global reduction 3 with 20 rules applied. Total rules applied 95 place count 78 transition count 173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 95 place count 78 transition count 171
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 76 transition count 171
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 130 place count 60 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 59 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 59 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 138 place count 59 transition count 148
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 140 place count 59 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 142 place count 57 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 142 place count 57 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 146 place count 55 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 150 place count 53 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 51 transition count 140
Applied a total of 152 rules in 26 ms. Remains 51 /127 variables (removed 76) and now considering 140/233 (removed 93) transitions.
// Phase 1: matrix 140 rows 51 cols
[2024-06-02 20:10:48] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:10:48] [INFO ] Implicit Places using invariants in 72 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/127 places, 140/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 104 ms. Remains : 50/127 places, 140/233 transitions.
[2024-06-02 20:10:48] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:10:48] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:10:48] [INFO ] Input system was already deterministic with 140 transitions.
[2024-06-02 20:10:48] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:10:48] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:10:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17978753627751664214.gal : 1 ms
[2024-06-02 20:10:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10267313943647972798.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/CTLFireability17978753627751664214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10267313943647972798.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.
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,360092,0.226517,7548,2,504,5,16272,6,0,338,16547,0


Converting to forward existential form...Done !
original formula: EG(AF((p23==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p23==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t14, t26, t29, t86, t104, t129, t130, Intersection with reachable at each step enabled. ...203
(forward)formula 0,0,10.0132,233812,1,0,470,1.25305e+06,307,189,3108,1.20448e+06,639
FORMULA MedleyA-PT-09-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 233/233 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 105 transition count 205
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 105 transition count 205
Applied a total of 44 rules in 2 ms. Remains 105 /127 variables (removed 22) and now considering 205/233 (removed 28) transitions.
// Phase 1: matrix 205 rows 105 cols
[2024-06-02 20:10:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:10:58] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:10:58] [INFO ] Invariant cache hit.
[2024-06-02 20:10:58] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-06-02 20:10:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:11:01] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 3 ms to minimize.
[2024-06-02 20:11:01] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-02 20:11:01] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:11:01] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:11:02] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:11:02] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:11:05] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:11:05] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:11:05] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:11:05] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:11:06] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:11:11] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/310 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 127 constraints, problems are : Problem set: 0 solved, 204 unsolved in 18397 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/331 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 20:11:27] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:11:27] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/310 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 333 constraints, problems are : Problem set: 0 solved, 204 unsolved in 25583 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 14/14 constraints]
After SMT, in 44149ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 44151ms
Starting structural reductions in LTL mode, iteration 1 : 105/127 places, 205/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44354 ms. Remains : 105/127 places, 205/233 transitions.
[2024-06-02 20:11:43] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:11:43] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:11:43] [INFO ] Input system was already deterministic with 205 transitions.
[2024-06-02 20:11:43] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:11:43] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:11:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15389680409017548955.gal : 3 ms
[2024-06-02 20:11:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11848209343189027247.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/CTLFireability15389680409017548955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11848209343189027247.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.62191e+07,2.85186,68672,2,4973,5,206289,6,0,625,290925,0


Converting to forward existential form...Done !
original formula: ((EF((A((((p19==1)&&(p58==1))&&((p121==1)&&(p143==1))) U (((p70==1)&&(p83==1))&&((p121==1)&&(p145==1)))) + EX((p77==1)))) + A(EX(EF((((p1...346
=> equivalent forward existential formula: [FwdG((Init * !((E(TRUE U (!((E(!((((p70==1)&&(p83==1))&&((p121==1)&&(p145==1)))) U (!((((p19==1)&&(p58==1))&&((...658
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...437
Detected timeout of ITS tools.
[2024-06-02 20:12:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:12:13] [INFO ] Applying decomposition
[2024-06-02 20:12:13] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9061077689674405880.txt' '-o' '/tmp/graph9061077689674405880.bin' '-w' '/tmp/graph9061077689674405880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9061077689674405880.bin' '-l' '-1' '-v' '-w' '/tmp/graph9061077689674405880.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:12:13] [INFO ] Decomposing Gal with order
[2024-06-02 20:12:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:12:13] [INFO ] Removed a total of 339 redundant transitions.
[2024-06-02 20:12:13] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:12:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 3 ms.
[2024-06-02 20:12:13] [INFO ] Time to serialize gal into /tmp/CTLFireability454987861278521473.gal : 6 ms
[2024-06-02 20:12:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1650614011119720180.ctl : 4 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/CTLFireability454987861278521473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1650614011119720180.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.62191e+07,0.154449,8328,610,155,8273,1160,383,18719,103,4584,0


Converting to forward existential form...Done !
original formula: ((EF((A((((i3.u2.p19==1)&&(i3.u2.p58==1))&&((i4.i1.u25.p121==1)&&(i4.i1.u31.p143==1))) U (((i4.i0.u13.p70==1)&&(i4.i0.u15.p83==1))&&((i4....529
=> equivalent forward existential formula: [FwdG((Init * !((E(TRUE U (!((E(!((((i4.i0.u13.p70==1)&&(i4.i0.u15.p83==1))&&((i4.i1.u25.p121==1)&&(i4.i1.u32.p1...967
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t63, i0.i1.t15, i0.i1.u26.t14, i1.u1.t94, i1.u3.t91, i2.t83, i2.t79, i2.t78, i2.u5.t...691
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
[2024-06-02 20:12:43] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:12:43] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:12:43] [INFO ] Applying decomposition
[2024-06-02 20:12:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9268271445897757385.txt' '-o' '/tmp/graph9268271445897757385.bin' '-w' '/tmp/graph9268271445897757385.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9268271445897757385.bin' '-l' '-1' '-v' '-w' '/tmp/graph9268271445897757385.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:12:43] [INFO ] Decomposing Gal with order
[2024-06-02 20:12:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:12:43] [INFO ] Removed a total of 503 redundant transitions.
[2024-06-02 20:12:43] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:12:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2024-06-02 20:12:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14713583160528266469.gal : 3 ms
[2024-06-02 20:12:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8695542205716430412.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/CTLFireability14713583160528266469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8695542205716430412.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55221e+08,0.818185,19888,719,77,27382,489,497,78775,82,2408,0


Converting to forward existential form...Done !
original formula: EX((((i1.u3.p19==1)&&(i4.u12.p55==1)) + (AF(((i1.u2.p5==1)&&(i7.u20.p87==1))) * !(A(EF((i0.u0.p1==1)) U (i4.u12.p57==1))))))
=> equivalent forward existential formula: ([(EY(Init) * ((i1.u3.p19==1)&&(i4.u12.p55==1)))] != FALSE + ([((FwdU((EY(Init) * !(EG(!(((i1.u2.p5==1)&&(i7.u20...346
Reverse transition relation is NOT exact ! Due to transitions t7, i1.u2.t118, i1.u2.t121, i1.u2.t122, i1.u2.t123, i1.u3.t114, i1.u3.t115, i1.u3.t116, i1.u3...1021
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,35.3953,790728,1,0,1.0018e+06,944,3141,4.69015e+06,392,5094,658631
FORMULA MedleyA-PT-09-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EG((EX(AF((i3.u8.p34==1))) + AF(((i4.u12.p56==1)&&(i7.u22.p94==1)))))
=> equivalent forward existential formula: [FwdG(Init,(EX(!(EG(!((i3.u8.p34==1))))) + !(EG(!(((i4.u12.p56==1)&&(i7.u22.p94==1)))))))] != FALSE
(forward)formula 1,0,74.2767,1485060,1,0,1.9763e+06,992,3208,7.08442e+06,393,5309,1375043
FORMULA MedleyA-PT-09-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX(((AG(!(A((i5.u17.p75==1) U (i5.u17.p76==1)))) * ((i7.u20.p99==0)||(i8.u24.p119==0))) + (AG((((i1.u3.p19==0)||(i4.u10.p58==0))||((i9.i0...252
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !((!(E(TRUE U !(!(!((E(!((i5.u17.p76==1)) U (!((i5.u17.p75==1)) * !((i5.u17.p76==1)))) + EG(...568
(forward)formula 2,0,94.1003,1878420,1,0,2.50805e+06,1206,3586,8.57873e+06,450,6796,1804820
FORMULA MedleyA-PT-09-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(!(AX(FALSE)) U ((AX(EF(((i5.u17.p75==1)&&(i9.i1.u33.p137==1)))) + (((i1.u3.p19==1)&&(i3.u9.p36==1))&&((i5.u17.p78==1)&&(i8.u27.p117==1)...549
=> equivalent forward existential formula: (([(FwdU(Init,!(!(EX(!(FALSE))))) * !(EX(!(E(TRUE U ((i5.u17.p75==1)&&(i9.i1.u33.p137==1)))))))] != FALSE + [(Fw...1379
(forward)formula 3,1,130.807,2208684,1,0,3.019e+06,1219,1072,1.01412e+07,163,7023,221159
FORMULA MedleyA-PT-09-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: ((EF((A((((i1.u3.p19==1)&&(i4.u10.p58==1))&&((i9.i0.u29.p121==1)&&(i9.i0.u36.p143==1))) U (((i6.u15.p70==1)&&(i6.u18.p83==1))&&((i9.i0.u2...528
=> equivalent forward existential formula: [FwdG((Init * !((E(TRUE U (!((E(!((((i6.u15.p70==1)&&(i6.u18.p83==1))&&((i9.i0.u29.p121==1)&&(i9.i0.u37.p145==1)...962
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 4,1,256.45,2429868,1,0,3.09548e+06,1219,1081,1.35717e+07,167,7023,177348
FORMULA MedleyA-PT-09-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1185482 ms.

BK_STOP 1717359420455

--------------------
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="MedleyA-PT-09"
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 MedleyA-PT-09, 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 r576-smll-171734919900066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-09.tgz
mv MedleyA-PT-09 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;