Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000114.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MedleyA-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 26K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748842407877

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 05:33:30] [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]
[2025-06-02 05:33:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:33:30] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2025-06-02 05:33:30] [INFO ] Transformed 108 places.
[2025-06-02 05:33:30] [INFO ] Transformed 100 transitions.
[2025-06-02 05:33:30] [INFO ] Found NUPN structural information;
[2025-06-02 05:33:30] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 352 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Support contains 77 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 106 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 106 transition count 99
Applied a total of 3 rules in 50 ms. Remains 106 /108 variables (removed 2) and now considering 99/100 (removed 1) transitions.
// Phase 1: matrix 99 rows 106 cols
[2025-06-02 05:33:31] [INFO ] Computed 8 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:33:31] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-06-02 05:33:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:33:31] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-02 05:33:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:33] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:33] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:34] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:34] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:34] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:34] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:34] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:34] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:34] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:34] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:34] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:35] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:35] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:35] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:35] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:35] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:35] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:35] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:35] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:36] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:36] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:36] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:36] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:36] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:36] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:36] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:36] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/205 variables, 106/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:38] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:39] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 143 constraints, problems are : Problem set: 0 solved, 98 unsolved in 10352 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:42] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:43] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:44] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:45] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 99/205 variables, 106/172 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 98/270 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:46] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:50] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:54] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:54] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:54] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:33:55] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:00] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 205/205 variables, and 277 constraints, problems are : Problem set: 0 solved, 98 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40516ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 40537ms
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 99/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41291 ms. Remains : 106/108 places, 99/100 transitions.
Support contains 77 out of 106 places after structural reductions.
[2025-06-02 05:34:12] [INFO ] Flatten gal took : 46 ms
[2025-06-02 05:34:12] [INFO ] Flatten gal took : 17 ms
[2025-06-02 05:34:12] [INFO ] Input system was already deterministic with 99 transitions.
RANDOM walk for 40000 steps (672 resets) in 1917 ms. (20 steps per ms) remains 12/73 properties
BEST_FIRST walk for 40002 steps (208 resets) in 344 ms. (115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (175 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (194 resets) in 192 ms. (207 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (200 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (197 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (198 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (182 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (189 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (165 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (195 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (205 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (186 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
[2025-06-02 05:34:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp50 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 74/93 variables, 8/8 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 99/192 variables, 93/101 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/101 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 13/205 variables, 13/114 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/114 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/114 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 114 constraints, problems are : Problem set: 5 solved, 7 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 58/93 variables, 6/8 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:14] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:14] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/10 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 99/192 variables, 93/103 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/103 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 13/205 variables, 13/116 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 7/123 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:15] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/124 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:15] [INFO ] Deduced a trap along path composed of 8 places in 40 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:15] [INFO ] Deduced a trap along path composed of 12 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:15] [INFO ] Deduced a trap along path composed of 12 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:15] [INFO ] Deduced a trap along path composed of 12 places in 82 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:15] [INFO ] Deduced a trap along path composed of 18 places in 85 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:15] [INFO ] Deduced a trap along path composed of 15 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:15] [INFO ] Deduced a trap along path composed of 21 places in 67 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 7/131 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/131 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/205 variables, 0/131 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 131 constraints, problems are : Problem set: 5 solved, 7 unsolved in 1828 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 7/12 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 2268ms problems are : Problem set: 5 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 337 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=168 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 1056 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-06-02 05:34:17] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:34:17] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:34:17] [INFO ] Input system was already deterministic with 99 transitions.
Support contains 73 out of 106 places (down from 74) after GAL structural reductions.
Computed a total of 106 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 transition count 99
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 5 formulas.
FORMULA MedleyA-PT-03-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 87
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 93 transition count 86
Applied a total of 26 rules in 17 ms. Remains 93 /106 variables (removed 13) and now considering 86/99 (removed 13) transitions.
// Phase 1: matrix 86 rows 93 cols
[2025-06-02 05:34:17] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:34:17] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 05:34:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:34:17] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-02 05:34:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:18] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:18] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:19] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/104 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:20] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 105 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4334 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 85/190 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:23] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:23] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:23] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:23] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:23] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:24] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:24] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 7/197 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:27] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:27] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:27] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:34:28] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 201 constraints, problems are : Problem set: 0 solved, 85 unsolved in 26771 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31135ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 31136ms
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 86/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31415 ms. Remains : 93/106 places, 86/99 transitions.
[2025-06-02 05:34:48] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:34:48] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:34:48] [INFO ] Input system was already deterministic with 86 transitions.
[2025-06-02 05:34:48] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:34:48] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:34:49] [INFO ] Time to serialize gal into /tmp/CTLFireability5681356749623209025.gal : 4 ms
[2025-06-02 05:34:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2520133584837486908.ctl : 7 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5681356749623209025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2520133584837486908.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.19424e+08,0.401374,15844,2,2412,5,36575,6,0,460,77198,0


Converting to forward existential form...Done !
original formula: AG(E(AG((A((p29==1) U (p13==1)) * (!(((p10==1)&&(p60==1))) + AX((p45==1))))) U AF(((p56==1)&&(p62==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(E(TRUE U !((!((E(!((p13==1)) U (!((p29==1)) * !((p13==1)))) + EG(!((p13==1))))) * (!((...246
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t18, t20, t25, t27, t32, t34, t39, t42, t45, t48, t51, t52, t72, Intersect...243
Detected timeout of ITS tools.
[2025-06-02 05:35:19] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:35:19] [INFO ] Applying decomposition
[2025-06-02 05:35: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.202505121319/bin/convert-linux64' '-i' '/tmp/graph16346634219282404365.txt' '-o' '/tmp/graph16346634219282404365.bin' '-w' '/tmp/graph16346634219282404365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16346634219282404365.bin' '-l' '-1' '-v' '-w' '/tmp/graph16346634219282404365.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:35:19] [INFO ] Decomposing Gal with order
[2025-06-02 05:35:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:35:19] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-02 05:35:19] [INFO ] Flatten gal took : 66 ms
[2025-06-02 05:35:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 05:35:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14661175540854212509.gal : 5 ms
[2025-06-02 05:35:19] [INFO ] Time to serialize properties into /tmp/CTLFireability11320219630877389482.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14661175540854212509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11320219630877389482.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19424e+08,0.086882,6560,600,178,4181,2891,207,4413,117,9729,0


Converting to forward existential form...Done !
original formula: AG(E(AG((A((i4.u10.p29==1) U (i1.u4.p13==1)) * (!(((i7.u3.p10==1)&&(i7.u22.p60==1))) + AX((i5.u15.p45==1))))) U AF(((i2.u18.p56==1)&&(i7....170
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(E(TRUE U !((!((E(!((i1.u4.p13==1)) U (!((i4.u10.p29==1)) * !((i1.u4.p13==1)))) + EG(!(...305
Reverse transition relation is NOT exact ! Due to transitions u27.t6, u28.t72, i0.u1.t52, i1.u23.t11, i1.u26.t4, i2.u14.t32, i2.u18.t25, i2.u20.t18, i3.t51...346
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,4.7144,172064,1,0,401602,6328,1389,366263,792,61437,578595
FORMULA MedleyA-PT-03-CTLFireability-2025-00 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 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 76
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 83 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 82 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 46 place count 82 transition count 69
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 76 transition count 69
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 64 place count 70 transition count 63
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 70 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 70 transition count 62
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 69 transition count 62
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 102 place count 54 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 53 transition count 46
Applied a total of 103 rules in 41 ms. Remains 53 /106 variables (removed 53) and now considering 46/99 (removed 53) transitions.
// Phase 1: matrix 46 rows 53 cols
[2025-06-02 05:35:24] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:24] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-02 05:35:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:24] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:35:24] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2025-06-02 05:35:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 46/98 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/99 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 61 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 46/98 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 45/105 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 1/99 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 106 constraints, problems are : Problem set: 0 solved, 45 unsolved in 3153 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4818ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 4818ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/106 places, 46/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5048 ms. Remains : 53/106 places, 46/99 transitions.
[2025-06-02 05:35:29] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:35:29] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:35:29] [INFO ] Input system was already deterministic with 46 transitions.
RANDOM walk for 82 steps (1 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-03-CTLFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 05:35:29] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:35:29] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:35:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17430711439872278722.gal : 2 ms
[2025-06-02 05:35:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11430376614381383429.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17430711439872278722.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11430376614381383429.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 82 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 46 place count 82 transition count 69
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 76 transition count 69
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 70 transition count 63
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 70 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 70 place count 70 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 69 transition count 62
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 98 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 55 transition count 48
Applied a total of 99 rules in 42 ms. Remains 55 /106 variables (removed 51) and now considering 48/99 (removed 51) transitions.
// Phase 1: matrix 48 rows 55 cols
[2025-06-02 05:35:29] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:29] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 05:35:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:29] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:35:29] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-02 05:35:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:29] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:29] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 48/102 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 65 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2292 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 48/102 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 47/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:32] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:32] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 114 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2745 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5057ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 5058ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/106 places, 48/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5372 ms. Remains : 55/106 places, 48/99 transitions.
[2025-06-02 05:35:34] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:35:34] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:35:34] [INFO ] Input system was already deterministic with 48 transitions.
[2025-06-02 05:35:34] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:35:34] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:35:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15627529388840107746.gal : 2 ms
[2025-06-02 05:35:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5285074603454706214.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15627529388840107746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5285074603454706214.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.56242e+06,0.038881,4460,2,871,5,3419,6,0,270,2800,0


Converting to forward existential form...Done !
original formula: (EF((p59==1)) * EG(AF((p49==1))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U (p59==1))),!(EG(!((p49==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t7, t9, t10, t12, t14, t41, t43, Intersection with reachable at each step en...209
dead was empty
(forward)formula 0,0,3.11958,96836,1,0,721,597265,124,139,1713,693198,723
FORMULA MedleyA-PT-03-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 18 rules applied. Total rules applied 33 place count 91 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 88 transition count 81
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 36 place count 88 transition count 77
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 44 place count 84 transition count 77
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 48 place count 80 transition count 73
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 80 transition count 73
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 78 place count 67 transition count 60
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 67 transition count 60
Applied a total of 80 rules in 20 ms. Remains 67 /106 variables (removed 39) and now considering 60/99 (removed 39) transitions.
// Phase 1: matrix 60 rows 67 cols
[2025-06-02 05:35:37] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:37] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 05:35:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:35:38] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:35:38] [INFO ] Redundant transitions in 2 ms returned []
Running 59 sub problems to find dead transitions.
[2025-06-02 05:35:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:38] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:38] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/127 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:39] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:39] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:39] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 81 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2752 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/127 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 59/140 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:42] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:42] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:42] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:43] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:43] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:44] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:48] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:50] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:54] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:55] [INFO ] Deduced a trap along path composed of 8 places in 42 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:35:58] [INFO ] Deduced a trap along path composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/127 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 127/127 variables, and 151 constraints, problems are : Problem set: 0 solved, 59 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 32777ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 32778ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/106 places, 60/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32983 ms. Remains : 67/106 places, 60/99 transitions.
[2025-06-02 05:36:10] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:36:10] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:36:10] [INFO ] Input system was already deterministic with 60 transitions.
[2025-06-02 05:36:10] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:36:10] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:36:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16707288973694915410.gal : 1 ms
[2025-06-02 05:36:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8905848979569379642.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16707288973694915410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8905848979569379642.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.68881e+06,0.040279,4804,2,1190,5,4825,6,0,330,3709,0


Converting to forward existential form...Done !
original formula: A(AF(((EG(((p86==1)&&(p97==1))) + (p74==1)) + ((((p78==1)&&(p54==1))&&((p86==1)&&(p94==1)))&&(p67==1)))) U ((EF((!(((p57==1)&&(p79==1))) ...229
=> equivalent forward existential formula: [((Init * !(EG(!(((E(TRUE U (!(((p57==1)&&(p79==1))) + E((p1==1) U (p14==1)))) * EG(!(!(E(TRUE U !((p13!=1))))))...572
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t6, t10, t11, t14, t16, t18, t20, t40, t44, t45, t49, Intersection with reachable at...222
(forward)formula 0,0,3.46973,103972,1,0,703,637900,161,171,2124,790343,686
FORMULA MedleyA-PT-03-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 87
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 93 transition count 86
Applied a total of 26 rules in 8 ms. Remains 93 /106 variables (removed 13) and now considering 86/99 (removed 13) transitions.
// Phase 1: matrix 86 rows 93 cols
[2025-06-02 05:36:14] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:36:14] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-02 05:36:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:36:14] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-02 05:36:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:15] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:15] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:15] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:16] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:17] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 106 constraints, problems are : Problem set: 0 solved, 85 unsolved in 6217 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:22] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:23] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:24] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:24] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:25] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:25] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:25] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:26] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:30] [INFO ] Deduced a trap along path composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:32] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:32] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:32] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:36:46] [INFO ] Deduced a trap along path composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/179 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/179 variables, and 204 constraints, problems are : Problem set: 0 solved, 85 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36243ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 36244ms
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 86/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36554 ms. Remains : 93/106 places, 86/99 transitions.
[2025-06-02 05:36:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:36:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:36:50] [INFO ] Input system was already deterministic with 86 transitions.
[2025-06-02 05:36:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:36:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:36:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4912362456854696206.gal : 1 ms
[2025-06-02 05:36:50] [INFO ] Time to serialize properties into /tmp/CTLFireability2981090098746040069.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4912362456854696206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2981090098746040069.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.10961e+08,0.309203,14092,2,1684,5,33142,6,0,460,63481,0


Converting to forward existential form...Done !
original formula: EG((AG((AX(((p36==0)||(p42==0))) * ((p86==0)||(p93==0)))) + (EX(((A(((p86==1)&&(p104==1)) U (p5==1)) + (p54==1)) + (p45==1))) * EG((p67==...161
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !((!(EX(!(((p36==0)||(p42==0))))) * ((p86==0)||(p93==0)))))) + (EX(((!((E(!((p5==1)) U (!...265
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t19, t21, t22, t26, t28, t33, t35, t40, t42, t48, t51, t52, t72, Intersect...243
(forward)formula 0,0,24.9208,608156,1,0,993,2.78194e+06,210,118,2772,4.07833e+06,998
FORMULA MedleyA-PT-03-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 94 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 94 transition count 87
Applied a total of 24 rules in 7 ms. Remains 94 /106 variables (removed 12) and now considering 87/99 (removed 12) transitions.
// Phase 1: matrix 87 rows 94 cols
[2025-06-02 05:37:16] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:37:16] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-02 05:37:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:37:16] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-06-02 05:37:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:17] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:17] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:17] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/181 variables, 94/105 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:19] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 106 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4909 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/181 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 86/192 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:22] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:22] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:22] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:22] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:22] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:23] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 7/199 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:24] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:24] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:24] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:28] [INFO ] Deduced a trap along path composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:38] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 6 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/181 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:44] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:50] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:50] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/181 variables, and 207 constraints, problems are : Problem set: 0 solved, 86 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34932ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 34933ms
Starting structural reductions in LTL mode, iteration 1 : 94/106 places, 87/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35130 ms. Remains : 94/106 places, 87/99 transitions.
[2025-06-02 05:37:51] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:37:51] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:37:51] [INFO ] Input system was already deterministic with 87 transitions.
[2025-06-02 05:37:51] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:37:51] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:37:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13615839327861588380.gal : 2 ms
[2025-06-02 05:37:51] [INFO ] Time to serialize properties into /tmp/CTLFireability9580136850568931556.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13615839327861588380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9580136850568931556.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.10961e+08,0.451649,14228,2,1712,5,33637,6,0,465,64512,0


Converting to forward existential form...Done !
original formula: (EG(E(((E((p58==1) U EG((p5==1))) * (((((p86==1)&&(p88==1))&&(p1==1))||((p66==1)&&(p72==1)))||((p8==1)&&(p40==1)))) * ((((p76==1)&&(p82==...241
=> equivalent forward existential formula: ([FwdG(Init,E(((E((p58==1) U EG((p5==1))) * (((((p86==1)&&(p88==1))&&(p1==1))||((p66==1)&&(p72==1)))||((p8==1)&&...308
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t12, t14, t15, t19, t21, t26, t28, t33, t35, t41, t43, t44, t49, t52, t53, t73, Inte...248
(forward)formula 0,1,2.19687,63812,1,0,1200,295608,208,293,2685,410887,1141
FORMULA MedleyA-PT-03-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 105 transition count 77
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 84 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 83 transition count 76
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 44 place count 83 transition count 70
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 56 place count 77 transition count 70
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 61 place count 72 transition count 65
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 72 transition count 65
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 96 place count 57 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 56 transition count 49
Applied a total of 97 rules in 14 ms. Remains 56 /106 variables (removed 50) and now considering 49/99 (removed 50) transitions.
// Phase 1: matrix 49 rows 56 cols
[2025-06-02 05:37:53] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:37:53] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 05:37:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:37:53] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:37:53] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-02 05:37:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:54] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 49/105 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 65 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2204 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 49/105 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 47/112 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:37:56] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/105 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 113 constraints, problems are : Problem set: 0 solved, 47 unsolved in 3732 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5950ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 5950ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/106 places, 49/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6190 ms. Remains : 56/106 places, 49/99 transitions.
[2025-06-02 05:37:59] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:37:59] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:37:59] [INFO ] Input system was already deterministic with 49 transitions.
[2025-06-02 05:37:59] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:37:59] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:37:59] [INFO ] Time to serialize gal into /tmp/CTLFireability5380460929202034090.gal : 1 ms
[2025-06-02 05:37:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6836817515115060569.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5380460929202034090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6836817515115060569.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.61869e+06,0.024025,4344,2,613,5,2820,6,0,274,1874,0


Converting to forward existential form...Done !
original formula: EG(((p28==0)&&((p86==0)||(p107==0))))
=> equivalent forward existential formula: [FwdG(Init,((p28==0)&&((p86==0)||(p107==0))))] != FALSE
Hit Full ! (commute/partial/dont) 27/3/22
(forward)formula 0,0,0.349898,15528,1,0,430,75479,18,4,1382,52718,428
FORMULA MedleyA-PT-03-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 87
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 93 transition count 86
Applied a total of 26 rules in 4 ms. Remains 93 /106 variables (removed 13) and now considering 86/99 (removed 13) transitions.
// Phase 1: matrix 86 rows 93 cols
[2025-06-02 05:38:00] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:38:00] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-02 05:38:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:38:00] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-02 05:38:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:01] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:01] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:01] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:01] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:02] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:02] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:02] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:02] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:02] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:02] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:02] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:03] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:03] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:03] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:03] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 86/179 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:05] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 118 constraints, problems are : Problem set: 0 solved, 85 unsolved in 8473 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:09] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:11] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:11] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:13] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:18] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/179 variables, and 209 constraints, problems are : Problem set: 0 solved, 85 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38503ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 38504ms
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 86/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38688 ms. Remains : 93/106 places, 86/99 transitions.
[2025-06-02 05:38:38] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:38:38] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:38:38] [INFO ] Input system was already deterministic with 86 transitions.
[2025-06-02 05:38:38] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:38:38] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:38:38] [INFO ] Time to serialize gal into /tmp/CTLFireability14567922165441412351.gal : 1 ms
[2025-06-02 05:38:38] [INFO ] Time to serialize properties into /tmp/CTLFireability17616409734962289075.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14567922165441412351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17616409734962289075.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.18819e+08,0.33554,14100,2,3198,5,33044,6,0,460,63217,0


Converting to forward existential form...Done !
original formula: EG((EF(((p75==0) + AF(((p86==0)||(p102==0))))) + EX((p79==1))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((p75==0) + !(EG(!(((p86==0)||(p102==0))))))) + EX((p79==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t10, t12, t14, t19, t21, t26, t28, t33, t35, t40, t42, t48, t51, t52, t72, Intersect...243
(forward)formula 0,1,3.558,93984,1,0,938,367991,202,90,2904,568934,936
FORMULA MedleyA-PT-03-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 88
Applied a total of 22 rules in 2 ms. Remains 95 /106 variables (removed 11) and now considering 88/99 (removed 11) transitions.
// Phase 1: matrix 88 rows 95 cols
[2025-06-02 05:38:42] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:38:42] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 05:38:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:38:42] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-06-02 05:38:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:43] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:43] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:43] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:43] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/183 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:45] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 108 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4897 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/183 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 87/195 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:48] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:48] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:49] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:49] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:50] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:50] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:50] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:50] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:51] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:54] [INFO ] Deduced a trap along path composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:58] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:38:58] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:12] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:12] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/183 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/183 variables, and 209 constraints, problems are : Problem set: 0 solved, 87 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34913ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 34914ms
Starting structural reductions in LTL mode, iteration 1 : 95/106 places, 88/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35090 ms. Remains : 95/106 places, 88/99 transitions.
[2025-06-02 05:39:17] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:39:17] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:39:17] [INFO ] Input system was already deterministic with 88 transitions.
[2025-06-02 05:39:17] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:39:17] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:39:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3606979664018904596.gal : 2 ms
[2025-06-02 05:39:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4954274596082752541.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3606979664018904596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4954274596082752541.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.10961e+08,0.606601,14748,2,1760,5,34585,6,0,470,68128,0


Converting to forward existential form...Done !
original formula: AX((AX(AX(AG(((p86==1)&&(p107==1))))) + EG((AF((p67==0)) + ((AF((p4==1)) * E(((p8==1)&&(p40==1)) U (p27==1))) * (p58==1))))))
=> equivalent forward existential formula: [(FwdU(EY(EY((EY(Init) * !(EG((!(EG(!((p67==0)))) + ((!(EG(!((p4==1)))) * E(((p8==1)&&(p40==1)) U (p27==1))) * (...212
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t19, t21, t22, t26, t28, t33, t35, t40, t42, t47, t49, t50, t53, t73, Inte...248
Detected timeout of ITS tools.
[2025-06-02 05:39:47] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:39:47] [INFO ] Applying decomposition
[2025-06-02 05:39:47] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5649630949089527638.txt' '-o' '/tmp/graph5649630949089527638.bin' '-w' '/tmp/graph5649630949089527638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5649630949089527638.bin' '-l' '-1' '-v' '-w' '/tmp/graph5649630949089527638.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:39:47] [INFO ] Decomposing Gal with order
[2025-06-02 05:39:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:39:47] [INFO ] Flatten gal took : 9 ms
[2025-06-02 05:39:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 05:39:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16445181176086486224.gal : 3 ms
[2025-06-02 05:39:47] [INFO ] Time to serialize properties into /tmp/CTLFireability969732159532314783.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16445181176086486224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability969732159532314783.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10961e+08,0.090496,6556,424,166,4079,2841,234,4496,117,11160,0


Converting to forward existential form...Done !
original formula: AX((AX(AX(AG(((u29.p86==1)&&(u29.p107==1))))) + EG((AF((i7.i1.u20.p67==0)) + ((AF((i10.u1.p4==1)) * E(((i5.u3.p8==1)&&(i4.u16.p40==1)) U ...201
=> equivalent forward existential formula: [(FwdU(EY(EY((EY(Init) * !(EG((!(EG(!((i7.i1.u20.p67==0)))) + ((!(EG(!((i10.u1.p4==1)))) * E(((i5.u3.p8==1)&&(i4...270
Reverse transition relation is NOT exact ! Due to transitions u28.t6, u29.t73, i1.u11.t40, i1.u15.t33, i1.u17.t26, i2.i0.t50, i2.i0.u10.t47, i2.i1.u7.t49, ...380
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,1,2.19152,82332,1,0,203310,7766,1437,172007,789,69675,275471
FORMULA MedleyA-PT-03-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 94 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 94 transition count 87
Applied a total of 24 rules in 3 ms. Remains 94 /106 variables (removed 12) and now considering 87/99 (removed 12) transitions.
// Phase 1: matrix 87 rows 94 cols
[2025-06-02 05:39:49] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:39:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-02 05:39:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:39:50] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-06-02 05:39:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:50] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:51] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:51] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:51] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:51] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:51] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:51] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:51] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:51] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:52] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:52] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/181 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:54] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:55] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:55] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:39:56] [INFO ] Deduced a trap along path composed of 17 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 117 constraints, problems are : Problem set: 0 solved, 86 unsolved in 9949 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:00] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:00] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:00] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:00] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:00] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:00] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/181 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 86/208 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:02] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:02] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:02] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:02] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:04] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:05] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:22] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:24] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:40:25] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/181 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/181 variables, and 218 constraints, problems are : Problem set: 0 solved, 86 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39970ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 39971ms
Starting structural reductions in LTL mode, iteration 1 : 94/106 places, 87/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40156 ms. Remains : 94/106 places, 87/99 transitions.
[2025-06-02 05:40:30] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:40:30] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:40:30] [INFO ] Input system was already deterministic with 87 transitions.
[2025-06-02 05:40:30] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:40:30] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:40:30] [INFO ] Time to serialize gal into /tmp/CTLFireability588962188603749766.gal : 1 ms
[2025-06-02 05:40:30] [INFO ] Time to serialize properties into /tmp/CTLFireability8050652131582650430.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability588962188603749766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8050652131582650430.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25413e+08,0.37485,15764,2,4271,5,36897,6,0,465,74180,0


Converting to forward existential form...Done !
original formula: EG(EF((EX(((p86==0)||(p96==0))) * !(A((p63!=1) U EG((p73==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (EX(((p86==0)||(p96==0))) * !(!((E(!(EG((p73==1))) U (!((p63!=1)) * !(EG((p73==1))))) + EG(!...186
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t14, t17, t19, t22, t25, t27, t29, t34, t36, t41, t43, t49, t52, t53, t73, Inte...248
Detected timeout of ITS tools.
[2025-06-02 05:41:00] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:41:00] [INFO ] Applying decomposition
[2025-06-02 05:41:00] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3356021123609268031.txt' '-o' '/tmp/graph3356021123609268031.bin' '-w' '/tmp/graph3356021123609268031.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3356021123609268031.bin' '-l' '-1' '-v' '-w' '/tmp/graph3356021123609268031.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:41:00] [INFO ] Decomposing Gal with order
[2025-06-02 05:41:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:41:00] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-02 05:41:00] [INFO ] Flatten gal took : 14 ms
[2025-06-02 05:41:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 05:41:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11607434735212885875.gal : 2 ms
[2025-06-02 05:41:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2385738359203680360.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11607434735212885875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2385738359203680360.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25413e+08,0.123771,6444,486,166,3922,2734,197,4467,117,9537,0


Converting to forward existential form...Done !
original formula: EG(EF((EX(((u29.p86==0)||(u29.p96==0))) * !(A((i5.u22.p63!=1) U EG((i6.u25.p73==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (EX(((u29.p86==0)||(u29.p96==0))) * !(!((E(!(EG((i6.u25.p73==1))) U (!((i5.u22.p63!=1)) * !(...222
Reverse transition relation is NOT exact ! Due to transitions u28.t6, u29.t73, i0.u12.t41, i0.u13.t34, i0.u16.t27, i1.t52, i1.u7.t49, i2.u10.t43, i3.u14.t3...355
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
dead was empty
(forward)formula 0,0,3.13024,101548,1,0,242369,7344,1248,215042,796,66021,348875
FORMULA MedleyA-PT-03-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 94 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 94 transition count 87
Applied a total of 24 rules in 4 ms. Remains 94 /106 variables (removed 12) and now considering 87/99 (removed 12) transitions.
// Phase 1: matrix 87 rows 94 cols
[2025-06-02 05:41:03] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:41:03] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 05:41:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:41:03] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-06-02 05:41:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:04] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:04] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:04] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/181 variables, 94/105 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:05] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 106 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4788 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/181 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 86/192 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:10] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:10] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:10] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:10] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:11] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:13] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:13] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:13] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:13] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:17] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:17] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:41:17] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/181 variables, and 204 constraints, problems are : Problem set: 0 solved, 86 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34805ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 34805ms
Starting structural reductions in LTL mode, iteration 1 : 94/106 places, 87/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35082 ms. Remains : 94/106 places, 87/99 transitions.
[2025-06-02 05:41:38] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:41:38] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:41:38] [INFO ] Input system was already deterministic with 87 transitions.
[2025-06-02 05:41:38] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:41:38] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:41:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16178345590806045038.gal : 0 ms
[2025-06-02 05:41:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3565156341186252435.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16178345590806045038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3565156341186252435.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.32992e+08,0.544953,18324,2,2863,5,40618,6,0,465,95627,0


Converting to forward existential form...Done !
original formula: (AX(EX(((p19==1)&&((p85==0)||(p44==0))))) + EG((p33==0)))
=> equivalent forward existential formula: [(EY((Init * !(EG((p33==0))))) * !(EX(((p19==1)&&((p85==0)||(p44==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t18, t20, t25, t27, t32, t34, t39, t42, t45, t49, t52, t53, t73, Intersect...243
Detected timeout of ITS tools.
[2025-06-02 05:42:08] [INFO ] Flatten gal took : 6 ms
[2025-06-02 05:42:08] [INFO ] Applying decomposition
[2025-06-02 05:42:08] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph13792528556560869092.txt' '-o' '/tmp/graph13792528556560869092.bin' '-w' '/tmp/graph13792528556560869092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13792528556560869092.bin' '-l' '-1' '-v' '-w' '/tmp/graph13792528556560869092.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:42:08] [INFO ] Decomposing Gal with order
[2025-06-02 05:42:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:42:08] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-02 05:42:08] [INFO ] Flatten gal took : 12 ms
[2025-06-02 05:42:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 05:42:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17458706354728471774.gal : 3 ms
[2025-06-02 05:42:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2794033248273847873.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17458706354728471774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2794033248273847873.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32992e+08,0.15401,6704,394,172,4250,2867,219,4985,122,11444,0


Converting to forward existential form...Done !
original formula: (AX(EX(((i3.u7.p19==1)&&((u27.p85==0)||(i1.u16.p44==0))))) + EG((i4.u14.p33==0)))
=> equivalent forward existential formula: [(EY((Init * !(EG((i4.u14.p33==0))))) * !(EX(((i3.u7.p19==1)&&((u27.p85==0)||(i1.u16.p44==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions u27.t73, i0.u23.t11, i0.u25.t4, i1.u16.t34, i2.u11.t39, i2.u15.t32, i2.u18.t25, i3.t49, i3.u7...349
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,1,2.64632,94384,1,0,235420,7818,1307,180305,824,68633,284779
FORMULA MedleyA-PT-03-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 97 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 97 transition count 90
Applied a total of 18 rules in 2 ms. Remains 97 /106 variables (removed 9) and now considering 90/99 (removed 9) transitions.
// Phase 1: matrix 90 rows 97 cols
[2025-06-02 05:42:11] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:42:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 05:42:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:42:11] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2025-06-02 05:42:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:12] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:12] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:12] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:12] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:12] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:12] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:12] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:12] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:13] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:13] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:13] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:13] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:13] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:13] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:13] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:13] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:14] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:14] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:14] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:14] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:14] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:15] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/187 variables, 97/127 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:16] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/187 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 128 constraints, problems are : Problem set: 0 solved, 89 unsolved in 8012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:20] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:20] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/187 variables, 97/131 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 89/220 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:22] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:22] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:22] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:22] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:22] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:24] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:25] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:32] [INFO ] Deduced a trap along path composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:35] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:41] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:44] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:48] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:42:49] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 187/187 variables, and 233 constraints, problems are : Problem set: 0 solved, 89 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38036ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 38036ms
Starting structural reductions in LTL mode, iteration 1 : 97/106 places, 90/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38191 ms. Remains : 97/106 places, 90/99 transitions.
[2025-06-02 05:42:49] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:42:49] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:42:49] [INFO ] Input system was already deterministic with 90 transitions.
[2025-06-02 05:42:49] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:42:49] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:42:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6187520688250918432.gal : 1 ms
[2025-06-02 05:42:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16844858287405748764.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6187520688250918432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16844858287405748764.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.26317e+08,0.384398,15548,2,4680,5,36797,6,0,480,72614,0


Converting to forward existential form...Done !
original formula: A((AX(AF((((p74!=1)||(p59==1))||((p86==1)&&(p94==1))))) * (AF(AG((p59!=1))) + ((!(AX(((p86==1)&&(p93==1)))) * !(AX((p57==1)))) * (((E(((p...404
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((E(!(!(EG(!(EX(((p86==1)&&(p106==1))))))) U (!(((!(EG(!((p35==1)))) * !(((p86==1)&&(p91==1)...1188
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t10, t13, t15, t16, t20, t23, t26, t29, t31, t32, t36, t38, t44, t46, t47, t52, t55, ...263
Detected timeout of ITS tools.
[2025-06-02 05:43:19] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:43:19] [INFO ] Applying decomposition
[2025-06-02 05:43:19] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9899444678165021842.txt' '-o' '/tmp/graph9899444678165021842.bin' '-w' '/tmp/graph9899444678165021842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9899444678165021842.bin' '-l' '-1' '-v' '-w' '/tmp/graph9899444678165021842.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:43:19] [INFO ] Decomposing Gal with order
[2025-06-02 05:43:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:43:19] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-02 05:43:19] [INFO ] Flatten gal took : 8 ms
[2025-06-02 05:43:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 05:43:19] [INFO ] Time to serialize gal into /tmp/CTLFireability15559635546575501386.gal : 2 ms
[2025-06-02 05:43:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17913326620339265710.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15559635546575501386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17913326620339265710.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26317e+08,0.092884,6648,476,185,4182,2918,231,4645,117,9930,0


Converting to forward existential form...Done !
original formula: A((AX(AF((((i8.u27.p74!=1)||(i7.u22.p59==1))||((u32.p86==1)&&(u32.p94==1))))) * (AF(AG((i7.u22.p59!=1))) + ((!(AX(((u32.p86==1)&&(u32.p93...574
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((E(!(!(EG(!(EX(((u32.p86==1)&&(u32.p106==1))))))) U (!(((!(EG(!((i3.i0.u11.p35==1)))) * !((...1546
Reverse transition relation is NOT exact ! Due to transitions u32.t76, i0.u1.t56, i1.i0.u30.t4, i1.i1.t13, i1.i1.u26.t16, i2.t55, i2.u9.t52, i3.i0.u10.t46,...413
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,11.4904,352000,1,0,763417,8180,1536,906498,791,79800,847227
FORMULA MedleyA-PT-03-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 : 106/106 places, 99/99 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 17 place count 105 transition count 81
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 88 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 86 transition count 79
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 38 place count 86 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 52 place count 79 transition count 72
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 58 place count 73 transition count 66
Iterating global reduction 3 with 6 rules applied. Total rules applied 64 place count 73 transition count 66
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 94 place count 58 transition count 51
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 57 transition count 50
Applied a total of 96 rules in 15 ms. Remains 57 /106 variables (removed 49) and now considering 50/99 (removed 49) transitions.
// Phase 1: matrix 50 rows 57 cols
[2025-06-02 05:43:31] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:43:31] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 05:43:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:43:31] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:43:31] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2025-06-02 05:43:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/107 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 65 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2116 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/107 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 49/114 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 114 constraints, problems are : Problem set: 0 solved, 49 unsolved in 3267 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5389ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 5390ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/106 places, 50/99 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5567 ms. Remains : 57/106 places, 50/99 transitions.
[2025-06-02 05:43:36] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:43:36] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:43:36] [INFO ] Input system was already deterministic with 50 transitions.
[2025-06-02 05:43:36] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:43:36] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:43:36] [INFO ] Time to serialize gal into /tmp/CTLFireability9220557810109542542.gal : 1 ms
[2025-06-02 05:43:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13573216162344124721.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9220557810109542542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13573216162344124721.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.98416e+06,0.023101,4352,2,636,5,3129,6,0,280,2305,0


Converting to forward existential form...Done !
original formula: ((!(E((p85!=1) U (p33==1))) + EG(AF((p54!=1)))) + (EG((p34!=1)) * !(E(AG(((p9==1)&&(p50==1))) U !(((p86==1)&&(p94==1)))))))
=> equivalent forward existential formula: ([((Init * !((!(E((p85!=1) U (p33==1))) + EG(!(EG(!((p54!=1)))))))) * !(EG((p34!=1))))] = FALSE * [(FwdU((Init *...286
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t7, t11, t12, t32, t33, t34, t42, Intersection with reachable at each step enabled. ...201
(forward)formula 0,1,4.91336,141568,1,0,827,866539,144,213,1800,1.14598e+06,839
FORMULA MedleyA-PT-03-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 88
Applied a total of 22 rules in 1 ms. Remains 95 /106 variables (removed 11) and now considering 88/99 (removed 11) transitions.
// Phase 1: matrix 88 rows 95 cols
[2025-06-02 05:43:41] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:43:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 05:43:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:43:41] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-06-02 05:43:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:42] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:43] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:43] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:43] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:44] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/183 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:45] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 109 constraints, problems are : Problem set: 0 solved, 87 unsolved in 7215 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/183 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 87/196 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:51] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:51] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:52] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:52] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:53] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:53] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:43:57] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 203 constraints, problems are : Problem set: 0 solved, 87 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37237ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 37238ms
Starting structural reductions in LTL mode, iteration 1 : 95/106 places, 88/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37421 ms. Remains : 95/106 places, 88/99 transitions.
[2025-06-02 05:44:19] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:44:19] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:44:19] [INFO ] Input system was already deterministic with 88 transitions.
[2025-06-02 05:44:19] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:44:19] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:44:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17609109257363075692.gal : 1 ms
[2025-06-02 05:44:19] [INFO ] Time to serialize properties into /tmp/CTLFireability18303831359873043447.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17609109257363075692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18303831359873043447.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.19424e+08,0.120002,6040,2,2029,5,10503,6,0,470,8973,0


Converting to forward existential form...Done !
original formula: EG((AF(AG((AX(((p86==1)&&(p104==1))) * (p87==0)))) + ((!(E(AF((p4==1)) U ((p18==1)||(p33==1)))) * A((p0==1) U (p68==1))) * EX(((p46==1)&&...168
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(!(E(TRUE U !((!(EX(!(((p86==1)&&(p104==1))))) * (p87==0)))))))) + ((!(E(!(EG(!((p4==1)))) U (...286
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t8, t12, t14, t19, t21, t26, t28, t33, t35, t40, t43, t46, t47, t49, t53, t73, t84, ...252
Detected timeout of ITS tools.
[2025-06-02 05:44:49] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:44:49] [INFO ] Applying decomposition
[2025-06-02 05:44:49] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6783636156084048549.txt' '-o' '/tmp/graph6783636156084048549.bin' '-w' '/tmp/graph6783636156084048549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6783636156084048549.bin' '-l' '-1' '-v' '-w' '/tmp/graph6783636156084048549.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:44:49] [INFO ] Decomposing Gal with order
[2025-06-02 05:44:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:44:49] [INFO ] Flatten gal took : 11 ms
[2025-06-02 05:44:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:44:49] [INFO ] Time to serialize gal into /tmp/CTLFireability2014065129460601970.gal : 2 ms
[2025-06-02 05:44:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6393798120156215415.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2014065129460601970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6393798120156215415.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19424e+08,0.089216,6428,401,202,3346,4217,225,4267,134,9867,0


Converting to forward existential form...Done !
original formula: EG((AF(AG((AX(((u24.p86==1)&&(u24.p104==1))) * (i1.u25.p87==0)))) + ((!(E(AF((i9.u1.p4==1)) U ((i3.u6.p18==1)||(i4.u11.p33==1)))) * A((i9...227
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(!(E(TRUE U !((!(EX(!(((u24.p86==1)&&(u24.p104==1))))) * (i1.u25.p87==0)))))))) + ((!(E(!(EG(!...359
Reverse transition relation is NOT exact ! Due to transitions t5, u23.t7, u16.t28, u24.t8, u24.t73, i1.u18.t19, i1.u20.t12, i2.u8.t40, i2.u13.t33, i2.u15.t...363
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,1,5.99278,155036,1,0,310847,16082,1627,389047,931,121351,354007
FORMULA MedleyA-PT-03-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:44:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:44:55] [INFO ] Flatten gal took : 3 ms
Total runtime 684883 ms.

BK_STOP 1748843095381

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-03"
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-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-03, 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 r128-smll-174876524000114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-03.tgz
mv MedleyA-PT-03 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.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 ;