Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400378.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 FireWire-PT-18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 168K 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 FireWire-PT-18-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-18-CTLFireability-2024-15
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-00
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-01
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-02
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-03
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-04
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-05
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-06
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-07
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-08
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-09
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-10
FORMULA_NAME FireWire-PT-18-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748893588863

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 19:46:31] [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 19:46:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:46:32] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2025-06-02 19:46:32] [INFO ] Transformed 437 places.
[2025-06-02 19:46:32] [INFO ] Transformed 707 transitions.
[2025-06-02 19:46:32] [INFO ] Found NUPN structural information;
[2025-06-02 19:46:32] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 575 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Support contains 137 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 427 transition count 707
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 91 place count 346 transition count 626
Iterating global reduction 1 with 81 rules applied. Total rules applied 172 place count 346 transition count 626
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 173 place count 346 transition count 625
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 186 place count 333 transition count 611
Iterating global reduction 2 with 13 rules applied. Total rules applied 199 place count 333 transition count 611
Applied a total of 199 rules in 163 ms. Remains 333 /437 variables (removed 104) and now considering 611/707 (removed 96) transitions.
// Phase 1: matrix 611 rows 333 cols
[2025-06-02 19:46:32] [INFO ] Computed 7 invariants in 85 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:46:33] [INFO ] Implicit Places using invariants in 745 ms returned []
[2025-06-02 19:46:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:46:34] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
Running 610 sub problems to find dead transitions.
[2025-06-02 19:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:54] [INFO ] Deduced a trap composed of 164 places in 590 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:55] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:55] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:56] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:57] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:58] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:59] [INFO ] Deduced a trap composed of 45 places in 391 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:46:59] [INFO ] Deduced a trap composed of 48 places in 421 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:01] [INFO ] Deduced a trap composed of 56 places in 448 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:04] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/944 variables, and 17 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/333 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:13] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:13] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:13] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:14] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:15] [INFO ] Deduced a trap composed of 104 places in 365 ms of which 57 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:21] [INFO ] Deduced a trap composed of 166 places in 457 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:21] [INFO ] Deduced a trap composed of 167 places in 420 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:22] [INFO ] Deduced a trap composed of 186 places in 439 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:23] [INFO ] Deduced a trap composed of 186 places in 481 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:25] [INFO ] Deduced a trap composed of 187 places in 251 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:25] [INFO ] Deduced a trap composed of 87 places in 239 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:26] [INFO ] Deduced a trap composed of 187 places in 246 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:26] [INFO ] Deduced a trap composed of 187 places in 234 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:26] [INFO ] Deduced a trap composed of 118 places in 239 ms of which 41 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:31] [INFO ] Deduced a trap composed of 187 places in 338 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:32] [INFO ] Deduced a trap composed of 188 places in 337 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:34] [INFO ] Deduced a trap composed of 188 places in 488 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/944 variables, and 34 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/333 constraints, PredecessorRefiner: 0/610 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60676ms problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60717ms
Starting structural reductions in LTL mode, iteration 1 : 333/437 places, 611/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62655 ms. Remains : 333/437 places, 611/707 transitions.
Support contains 137 out of 333 places after structural reductions.
[2025-06-02 19:47:35] [INFO ] Flatten gal took : 184 ms
[2025-06-02 19:47:35] [INFO ] Flatten gal took : 99 ms
[2025-06-02 19:47:36] [INFO ] Input system was already deterministic with 611 transitions.
RANDOM walk for 40000 steps (18 resets) in 3058 ms. (13 steps per ms) remains 94/112 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (9 resets) in 43 ms. (90 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (10 resets) in 47 ms. (83 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (9 resets) in 43 ms. (90 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (10 resets) in 33 ms. (117 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (9 resets) in 63 ms. (62 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4002 steps (9 resets) in 34 ms. (114 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4001 steps (9 resets) in 70 ms. (56 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4001 steps (9 resets) in 37 ms. (105 steps per ms) remains 93/94 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (10 resets) in 21 ms. (181 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (9 resets) in 29 ms. (133 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (9 resets) in 21 ms. (181 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (10 resets) in 35 ms. (111 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (9 resets) in 38 ms. (102 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (11 resets) in 40 ms. (97 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (10 resets) in 33 ms. (117 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (9 resets) in 62 ms. (63 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (10 resets) in 28 ms. (137 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (10 resets) in 13 ms. (285 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (9 resets) in 10 ms. (363 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4001 steps (9 resets) in 14 ms. (266 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 93/93 properties
[2025-06-02 19:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp98 is UNSAT
At refinement iteration 1 (OVERLAPS) 190/305 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:39] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:39] [INFO ] Deduced a trap composed of 56 places in 369 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:39] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:40] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:40] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:40] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 6/13 constraints. Problems are: Problem set: 5 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:42] [INFO ] Deduced a trap composed of 93 places in 170 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 1/14 constraints. Problems are: Problem set: 5 solved, 88 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/944 variables, and 14 constraints, problems are : Problem set: 5 solved, 88 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/333 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 88 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 88 unsolved
Problem AtomicPropp102 is UNSAT
At refinement iteration 1 (OVERLAPS) 197/305 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 7/14 constraints. Problems are: Problem set: 6 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:45] [INFO ] Deduced a trap composed of 148 places in 449 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:45] [INFO ] Deduced a trap composed of 104 places in 435 ms of which 76 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 2/16 constraints. Problems are: Problem set: 6 solved, 87 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/944 variables, and 16 constraints, problems are : Problem set: 6 solved, 87 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/333 constraints, PredecessorRefiner: 0/93 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10155ms problems are : Problem set: 6 solved, 87 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 611/611 transitions.
Graph (trivial) has 116 edges and 333 vertex of which 11 / 333 are part of one of the 3 SCC in 5 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 325 transition count 579
Reduce places removed 19 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 25 rules applied. Total rules applied 45 place count 306 transition count 573
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 300 transition count 573
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 51 place count 300 transition count 565
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 67 place count 292 transition count 565
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 71 place count 288 transition count 561
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 288 transition count 561
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 288 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 288 transition count 558
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 287 transition count 558
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 286 transition count 556
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 286 transition count 556
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 123 place count 265 transition count 535
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 139 place count 257 transition count 571
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 257 transition count 570
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 154 place count 257 transition count 556
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 168 place count 243 transition count 556
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 169 place count 242 transition count 555
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 242 transition count 555
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 180 place count 242 transition count 555
Applied a total of 180 rules in 306 ms. Remains 242 /333 variables (removed 91) and now considering 555/611 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 242/333 places, 555/611 transitions.
RANDOM walk for 40000 steps (1311 resets) in 1918 ms. (20 steps per ms) remains 75/87 properties
BEST_FIRST walk for 4004 steps (29 resets) in 36 ms. (108 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (29 resets) in 26 ms. (148 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (30 resets) in 38 ms. (102 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (30 resets) in 45 ms. (87 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (29 resets) in 40 ms. (97 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (30 resets) in 33 ms. (117 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (30 resets) in 36 ms. (108 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (27 resets) in 30 ms. (129 steps per ms) remains 74/75 properties
BEST_FIRST walk for 4004 steps (31 resets) in 33 ms. (117 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (29 resets) in 29 ms. (133 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (31 resets) in 36 ms. (108 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (29 resets) in 27 ms. (143 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (31 resets) in 33 ms. (117 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (30 resets) in 28 ms. (138 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (29 resets) in 33 ms. (117 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (33 resets) in 36 ms. (108 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (31 resets) in 29 ms. (133 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (28 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (31 resets) in 32 ms. (121 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (31 resets) in 28 ms. (138 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (29 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (30 resets) in 34 ms. (114 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (31 resets) in 34 ms. (114 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (31 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (30 resets) in 31 ms. (125 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (31 resets) in 35 ms. (111 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (30 resets) in 35 ms. (111 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (31 resets) in 25 ms. (153 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (30 resets) in 29 ms. (133 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (31 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (32 resets) in 25 ms. (153 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (28 resets) in 27 ms. (143 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (28 resets) in 27 ms. (143 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (29 resets) in 21 ms. (181 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (32 resets) in 37 ms. (105 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (31 resets) in 27 ms. (142 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (26 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (31 resets) in 34 ms. (114 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (30 resets) in 24 ms. (160 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (30 resets) in 32 ms. (121 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (29 resets) in 26 ms. (148 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (31 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (29 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (29 resets) in 17 ms. (222 steps per ms) remains 73/74 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (30 resets) in 20 ms. (190 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (27 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (25 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (32 resets) in 20 ms. (190 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (38 resets) in 20 ms. (190 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (31 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (28 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (30 resets) in 20 ms. (190 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (31 resets) in 21 ms. (182 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (30 resets) in 49 ms. (80 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
// Phase 1: matrix 555 rows 242 cols
[2025-06-02 19:47:49] [INFO ] Computed 7 invariants in 7 ms
[2025-06-02 19:47:49] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 137/233 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:50] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:51] [INFO ] Deduced a trap composed of 37 places in 378 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:51] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:52] [INFO ] Deduced a trap composed of 63 places in 358 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:52] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:52] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:52] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:53] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:47:54] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 555/788 variables, 233/249 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Problem AtomicPropp59 is UNSAT
At refinement iteration 8 (OVERLAPS) 9/797 variables, 9/266 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/797 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/797 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 797/797 variables, and 266 constraints, problems are : Problem set: 1 solved, 72 unsolved in 16765 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 242/242 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 72 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 138/232 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 9/16 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 552/784 variables, 232/248 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/784 variables, 8/256 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 67/323 constraints. Problems are: Problem set: 1 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:16] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 41 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 1/324 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 12/796 variables, 9/333 constraints. Problems are: Problem set: 1 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 5/338 constraints. Problems are: Problem set: 1 solved, 72 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/797 variables, and 338 constraints, problems are : Problem set: 1 solved, 72 unsolved in 45020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 241/242 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 72/73 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61861ms problems are : Problem set: 1 solved, 72 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 94 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 555/555 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 554
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 241 transition count 553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 240 transition count 553
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 240 transition count 552
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 239 transition count 552
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 18 place count 233 transition count 546
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 230 transition count 563
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 230 transition count 557
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 36 place count 224 transition count 557
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 38 place count 222 transition count 555
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 222 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 41 place count 222 transition count 554
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 43 place count 222 transition count 554
Applied a total of 43 rules in 160 ms. Remains 222 /242 variables (removed 20) and now considering 554/555 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 222/242 places, 554/555 transitions.
RANDOM walk for 40000 steps (1508 resets) in 2177 ms. (18 steps per ms) remains 64/72 properties
BEST_FIRST walk for 4004 steps (32 resets) in 34 ms. (114 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (33 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (37 resets) in 39 ms. (100 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (35 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (32 resets) in 21 ms. (181 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (38 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (37 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (36 resets) in 28 ms. (138 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (34 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 61/64 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (38 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (37 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (34 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (33 resets) in 35 ms. (111 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (36 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (30 resets) in 21 ms. (182 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (34 resets) in 25 ms. (154 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4002 steps (35 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (34 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (38 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (34 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (36 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (36 resets) in 40 ms. (97 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (36 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (33 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (38 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (34 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (35 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (25 resets) in 15 ms. (250 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4002 steps (34 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (26 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (38 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (30 resets) in 13 ms. (285 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (34 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (24 resets) in 16 ms. (235 steps per ms) remains 55/58 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (38 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (28 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (38 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (27 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
[2025-06-02 19:48:53] [INFO ] Flow matrix only has 542 transitions (discarded 12 similar events)
// Phase 1: matrix 542 rows 222 cols
[2025-06-02 19:48:53] [INFO ] Computed 7 invariants in 5 ms
[2025-06-02 19:48:53] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 137/213 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:53] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:54] [INFO ] Deduced a trap composed of 36 places in 394 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:54] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:54] [INFO ] Deduced a trap composed of 62 places in 346 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:55] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:55] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:55] [INFO ] Deduced a trap composed of 29 places in 346 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:55] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:56] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:48:56] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 539/752 variables, 213/230 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 12/764 variables, 9/248 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/764 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 248 constraints, problems are : Problem set: 0 solved, 55 unsolved in 13016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 222/222 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 137/213 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 539/752 variables, 213/230 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 9/239 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 52/291 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:49:12] [INFO ] Deduced a trap along path composed of 5 places in 41 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 12/764 variables, 9/301 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/764 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/764 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 304 constraints, problems are : Problem set: 0 solved, 55 unsolved in 57246 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 222/222 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 70325ms problems are : Problem set: 0 solved, 55 unsolved
Parikh walk visited 3 properties in 30256 ms.
Support contains 70 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 554/554 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 222 transition count 548
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 217 transition count 547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 216 transition count 547
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 216 transition count 545
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 214 transition count 545
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 19 place count 212 transition count 543
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 212 transition count 543
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 212 transition count 542
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 23 place count 211 transition count 542
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 210 transition count 541
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 210 transition count 541
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 207 transition count 538
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 205 transition count 546
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 41 place count 205 transition count 540
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 47 place count 205 transition count 534
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 53 place count 199 transition count 534
Applied a total of 53 rules in 88 ms. Remains 199 /222 variables (removed 23) and now considering 534/554 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 199/222 places, 534/554 transitions.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-18-CTLFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 19:50:33] [INFO ] Flatten gal took : 43 ms
[2025-06-02 19:50:33] [INFO ] Flatten gal took : 41 ms
[2025-06-02 19:50:33] [INFO ] Input system was already deterministic with 611 transitions.
Computed a total of 96 stabilizing places and 148 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 312 transition count 565
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 312 transition count 565
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 305 transition count 534
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 305 transition count 534
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 301 transition count 528
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 301 transition count 528
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 301 transition count 526
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 300 transition count 524
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 300 transition count 524
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 299 transition count 521
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 299 transition count 521
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 298 transition count 519
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 298 transition count 519
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 297 transition count 516
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 297 transition count 516
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 296 transition count 514
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 296 transition count 514
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 295 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 295 transition count 511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 294 transition count 509
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 294 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 293 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 293 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 292 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 292 transition count 504
Applied a total of 84 rules in 71 ms. Remains 292 /333 variables (removed 41) and now considering 504/611 (removed 107) transitions.
// Phase 1: matrix 504 rows 292 cols
[2025-06-02 19:50:34] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:50:34] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-02 19:50:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:50:34] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2025-06-02 19:50:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:49] [INFO ] Deduced a trap composed of 151 places in 400 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:49] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:49] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:50] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:50] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:51] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:51] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:51] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:52] [INFO ] Deduced a trap composed of 40 places in 313 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:54] [INFO ] Deduced a trap composed of 50 places in 287 ms of which 44 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:56] [INFO ] Deduced a trap composed of 153 places in 190 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:56] [INFO ] Deduced a trap composed of 164 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:50:58] [INFO ] Deduced a trap composed of 90 places in 374 ms of which 61 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:04] [INFO ] Deduced a trap composed of 165 places in 323 ms of which 46 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 292/796 variables, and 21 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/292 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/292 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:10] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:10] [INFO ] Deduced a trap composed of 164 places in 238 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:11] [INFO ] Deduced a trap composed of 164 places in 264 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:11] [INFO ] Deduced a trap composed of 166 places in 318 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:11] [INFO ] Deduced a trap composed of 165 places in 245 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:12] [INFO ] Deduced a trap composed of 167 places in 340 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:51:12] [INFO ] Deduced a trap composed of 165 places in 360 ms of which 61 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (OVERLAPS) 504/796 variables, 292/320 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 503/823 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/796 variables, and 823 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 292/333 places, 504/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61115 ms. Remains : 292/333 places, 504/611 transitions.
[2025-06-02 19:51:35] [INFO ] Flatten gal took : 48 ms
[2025-06-02 19:51:35] [INFO ] Flatten gal took : 47 ms
[2025-06-02 19:51:35] [INFO ] Input system was already deterministic with 504 transitions.
[2025-06-02 19:51:35] [INFO ] Flatten gal took : 38 ms
[2025-06-02 19:51:35] [INFO ] Flatten gal took : 37 ms
[2025-06-02 19:51:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14345500248045576298.gal : 23 ms
[2025-06-02 19:51:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8496503499901342607.ctl : 8 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/CTLFireability14345500248045576298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8496503499901342607.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.
Detected timeout of ITS tools.
[2025-06-02 19:52:05] [INFO ] Flatten gal took : 32 ms
[2025-06-02 19:52:05] [INFO ] Applying decomposition
[2025-06-02 19:52:05] [INFO ] Flatten gal took : 30 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/graph8711895037858129127.txt' '-o' '/tmp/graph8711895037858129127.bin' '-w' '/tmp/graph8711895037858129127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8711895037858129127.bin' '-l' '-1' '-v' '-w' '/tmp/graph8711895037858129127.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:52:05] [INFO ] Decomposing Gal with order
[2025-06-02 19:52:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:52:06] [INFO ] Removed a total of 548 redundant transitions.
[2025-06-02 19:52:06] [INFO ] Flatten gal took : 155 ms
[2025-06-02 19:52:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 42 ms.
[2025-06-02 19:52:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3500749630569744393.gal : 20 ms
[2025-06-02 19:52:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7859521465589402910.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3500749630569744393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7859521465589402910.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,3.31529e+10,21.2265,463616,2334,118,585992,10738,1167,3.13729e+06,98,111822,0


Converting to forward existential form...Done !
original formula: E(!(A(AX(E(((i4.i1.u11.p51==1)&&(i4.i1.u11.p427==1)) U ((i3.u20.p92==1)&&(i2.i2.u26.p110==1)))) U (((i3.u22.p94==1) * EF((i4.i0.u4.p47==1...733
=> equivalent forward existential formula: ([(FwdU(Init,!(!((E(!((((i3.u22.p94==1) * E(TRUE U (i4.i0.u4.p47==1))) * (!(((i5.i0.u57.p226==1)||((i4.i1.u11.p5...2792
Reverse transition relation is NOT exact ! Due to transitions t66, t158, t198, t203, t212, t214, t221, t226, t227, t229, t231, t232, t234, t239, t244, t249...1266
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 306 transition count 558
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 306 transition count 558
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 297 transition count 525
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 297 transition count 525
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 291 transition count 516
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 291 transition count 516
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 86 place count 291 transition count 514
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 289 transition count 509
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 289 transition count 509
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 287 transition count 504
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 287 transition count 504
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 285 transition count 499
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 285 transition count 499
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 283 transition count 494
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 283 transition count 494
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 281 transition count 489
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 281 transition count 489
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 279 transition count 484
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 279 transition count 484
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 277 transition count 479
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 277 transition count 479
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 275 transition count 474
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 275 transition count 474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 273 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 273 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 271 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 271 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 269 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 269 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 268 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 268 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 267 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 267 transition count 458
Applied a total of 134 rules in 96 ms. Remains 267 /333 variables (removed 66) and now considering 458/611 (removed 153) transitions.
// Phase 1: matrix 458 rows 267 cols
[2025-06-02 19:52:36] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:52:36] [INFO ] Implicit Places using invariants in 467 ms returned []
[2025-06-02 19:52:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:52:37] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-02 19:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:49] [INFO ] Deduced a trap composed of 147 places in 369 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:49] [INFO ] Deduced a trap composed of 150 places in 265 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:49] [INFO ] Deduced a trap composed of 151 places in 235 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:50] [INFO ] Deduced a trap composed of 40 places in 312 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:50] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:50] [INFO ] Deduced a trap composed of 89 places in 276 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:51] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:52] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:53] [INFO ] Deduced a trap composed of 50 places in 326 ms of which 50 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:52:57] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/725 variables, and 17 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (OVERLAPS) 458/725 variables, 267/284 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 457/741 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:29] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:34] [INFO ] Deduced a trap composed of 150 places in 321 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:53:35] [INFO ] Deduced a trap composed of 156 places in 235 ms of which 41 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 744 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 267/333 places, 458/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61230 ms. Remains : 267/333 places, 458/611 transitions.
[2025-06-02 19:53:37] [INFO ] Flatten gal took : 18 ms
[2025-06-02 19:53:37] [INFO ] Flatten gal took : 17 ms
[2025-06-02 19:53:37] [INFO ] Input system was already deterministic with 458 transitions.
[2025-06-02 19:53:37] [INFO ] Flatten gal took : 16 ms
[2025-06-02 19:53:37] [INFO ] Flatten gal took : 15 ms
[2025-06-02 19:53:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6163874353001743515.gal : 5 ms
[2025-06-02 19:53:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15857097268443947713.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/CTLFireability6163874353001743515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15857097268443947713.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.
Detected timeout of ITS tools.
[2025-06-02 19:54:07] [INFO ] Flatten gal took : 16 ms
[2025-06-02 19:54:07] [INFO ] Applying decomposition
[2025-06-02 19:54:07] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6549413557222102625.txt' '-o' '/tmp/graph6549413557222102625.bin' '-w' '/tmp/graph6549413557222102625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6549413557222102625.bin' '-l' '-1' '-v' '-w' '/tmp/graph6549413557222102625.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:54:07] [INFO ] Decomposing Gal with order
[2025-06-02 19:54:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:54:07] [INFO ] Removed a total of 518 redundant transitions.
[2025-06-02 19:54:07] [INFO ] Flatten gal took : 35 ms
[2025-06-02 19:54:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 12 ms.
[2025-06-02 19:54:07] [INFO ] Time to serialize gal into /tmp/CTLFireability18274669486340861373.gal : 7 ms
[2025-06-02 19:54:07] [INFO ] Time to serialize properties into /tmp/CTLFireability18331417636240880394.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/CTLFireability18274669486340861373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18331417636240880394.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 310 transition count 564
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 310 transition count 564
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 302 transition count 551
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 302 transition count 551
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 299 transition count 548
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 299 transition count 548
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 299 transition count 547
Applied a total of 69 rules in 22 ms. Remains 299 /333 variables (removed 34) and now considering 547/611 (removed 64) transitions.
// Phase 1: matrix 547 rows 299 cols
[2025-06-02 19:54:38] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:54:38] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-06-02 19:54:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:54:38] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
Running 546 sub problems to find dead transitions.
[2025-06-02 19:54:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:54] [INFO ] Deduced a trap composed of 147 places in 420 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:55] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:55] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:55] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:57] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:57] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:57] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:58] [INFO ] Deduced a trap composed of 42 places in 365 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:54:59] [INFO ] Deduced a trap composed of 98 places in 376 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:00] [INFO ] Deduced a trap composed of 52 places in 383 ms of which 65 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 299/846 variables, and 17 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/299 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 546 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:55:17] [INFO ] Deduced a trap composed of 167 places in 361 ms of which 46 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (OVERLAPS) 547/846 variables, 299/317 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 546/863 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 846/846 variables, and 863 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 546 unsolved
Search for dead transitions found 0 dead transitions in 60209ms
Starting structural reductions in LTL mode, iteration 1 : 299/333 places, 547/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61197 ms. Remains : 299/333 places, 547/611 transitions.
[2025-06-02 19:55:39] [INFO ] Flatten gal took : 27 ms
[2025-06-02 19:55:39] [INFO ] Flatten gal took : 27 ms
[2025-06-02 19:55:39] [INFO ] Input system was already deterministic with 547 transitions.
[2025-06-02 19:55:39] [INFO ] Flatten gal took : 28 ms
[2025-06-02 19:55:39] [INFO ] Flatten gal took : 28 ms
[2025-06-02 19:55:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17642297820075022680.gal : 6 ms
[2025-06-02 19:55:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8649832678220071071.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/CTLFireability17642297820075022680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8649832678220071071.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.
Detected timeout of ITS tools.
[2025-06-02 19:56:09] [INFO ] Flatten gal took : 30 ms
[2025-06-02 19:56:09] [INFO ] Applying decomposition
[2025-06-02 19:56:09] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16266644603180880501.txt' '-o' '/tmp/graph16266644603180880501.bin' '-w' '/tmp/graph16266644603180880501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16266644603180880501.bin' '-l' '-1' '-v' '-w' '/tmp/graph16266644603180880501.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:56:09] [INFO ] Decomposing Gal with order
[2025-06-02 19:56:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:56:09] [INFO ] Removed a total of 624 redundant transitions.
[2025-06-02 19:56:09] [INFO ] Flatten gal took : 48 ms
[2025-06-02 19:56:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 11 ms.
[2025-06-02 19:56:09] [INFO ] Time to serialize gal into /tmp/CTLFireability14127016053194736714.gal : 6 ms
[2025-06-02 19:56:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9980912466567307193.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/CTLFireability14127016053194736714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9980912466567307193.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,2.84659e+10,29.3896,578092,2907,82,548274,2009,1091,4.75529e+06,102,6396,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 306 transition count 558
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 306 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 306 transition count 557
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 295 transition count 520
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 295 transition count 520
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 289 transition count 511
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 289 transition count 511
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 289 transition count 509
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 287 transition count 504
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 287 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 286 transition count 501
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 286 transition count 501
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 285 transition count 499
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 285 transition count 499
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 284 transition count 496
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 284 transition count 496
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 283 transition count 494
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 283 transition count 494
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 282 transition count 491
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 282 transition count 491
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 281 transition count 489
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 281 transition count 489
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 280 transition count 486
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 280 transition count 486
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 279 transition count 484
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 279 transition count 484
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 278 transition count 482
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 278 transition count 482
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 277 transition count 480
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 277 transition count 480
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 276 transition count 479
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 276 transition count 479
Applied a total of 117 rules in 106 ms. Remains 276 /333 variables (removed 57) and now considering 479/611 (removed 132) transitions.
// Phase 1: matrix 479 rows 276 cols
[2025-06-02 19:56:39] [INFO ] Computed 7 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:56:40] [INFO ] Implicit Places using invariants in 282 ms returned []
[2025-06-02 19:56:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:56:40] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Running 478 sub problems to find dead transitions.
[2025-06-02 19:56:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:54] [INFO ] Deduced a trap composed of 146 places in 399 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:54] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:55] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:56] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:56] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:56] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:57] [INFO ] Deduced a trap composed of 40 places in 283 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:58] [INFO ] Deduced a trap composed of 87 places in 337 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:56:58] [INFO ] Deduced a trap composed of 50 places in 344 ms of which 55 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/755 variables, and 16 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/276 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/755 variables, 276/292 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/755 variables, 478/770 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:30] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/755 variables, and 771 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 276/333 places, 479/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61198 ms. Remains : 276/333 places, 479/611 transitions.
[2025-06-02 19:57:41] [INFO ] Flatten gal took : 20 ms
[2025-06-02 19:57:41] [INFO ] Flatten gal took : 20 ms
[2025-06-02 19:57:41] [INFO ] Input system was already deterministic with 479 transitions.
[2025-06-02 19:57:41] [INFO ] Flatten gal took : 19 ms
[2025-06-02 19:57:41] [INFO ] Flatten gal took : 19 ms
[2025-06-02 19:57:41] [INFO ] Time to serialize gal into /tmp/CTLFireability8596158646891658204.gal : 5 ms
[2025-06-02 19:57:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3842722914270261978.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/CTLFireability8596158646891658204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3842722914270261978.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.
Detected timeout of ITS tools.
[2025-06-02 19:58:11] [INFO ] Flatten gal took : 15 ms
[2025-06-02 19:58:11] [INFO ] Applying decomposition
[2025-06-02 19:58:11] [INFO ] Flatten gal took : 55 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/graph1131830316134414102.txt' '-o' '/tmp/graph1131830316134414102.bin' '-w' '/tmp/graph1131830316134414102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1131830316134414102.bin' '-l' '-1' '-v' '-w' '/tmp/graph1131830316134414102.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:58:11] [INFO ] Decomposing Gal with order
[2025-06-02 19:58:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:58:11] [INFO ] Removed a total of 537 redundant transitions.
[2025-06-02 19:58:11] [INFO ] Flatten gal took : 50 ms
[2025-06-02 19:58:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 10 ms.
[2025-06-02 19:58:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15612232053998076815.gal : 15 ms
[2025-06-02 19:58:11] [INFO ] Time to serialize properties into /tmp/CTLFireability1481592972214870592.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/CTLFireability15612232053998076815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1481592972214870592.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,2.54916e+10,14.1406,299092,2828,60,391657,604,1049,1.82269e+06,77,2206,0


Converting to forward existential form...Done !
original formula: AF(E(A((((i11.i0.u10.p5==1)&&(i3.u58.p242==1))&&(((i2.i0.u16.p87==1)||(!((i0.u9.p51==1)&&(i0.u36.p158==1))))||((i11.i0.u5.p25==1)&&(i11.i...329
=> equivalent forward existential formula: [FwdG(Init,!(E(!((E(!(((i10.u6.p36==1)&&(i4.i2.u41.p171==1))) U (!((((i11.i0.u10.p5==1)&&(i3.u58.p242==1))&&(((i...588
Reverse transition relation is NOT exact ! Due to transitions t56, t63, t141, t148, t184, t189, t198, t207, t212, t213, t215, t220, t225, t230, t235, t246,...1185
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 306 transition count 558
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 306 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 306 transition count 557
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 295 transition count 520
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 295 transition count 520
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 289 transition count 511
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 289 transition count 511
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 289 transition count 509
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 287 transition count 504
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 287 transition count 504
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 285 transition count 499
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 285 transition count 499
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 283 transition count 494
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 283 transition count 494
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 281 transition count 489
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 281 transition count 489
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 279 transition count 484
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 279 transition count 484
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 278 transition count 482
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 278 transition count 482
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 277 transition count 479
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 277 transition count 479
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 276 transition count 477
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 276 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 275 transition count 474
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 275 transition count 474
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 274 transition count 472
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 274 transition count 472
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 273 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 273 transition count 470
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 272 transition count 468
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 272 transition count 468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 271 transition count 467
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 271 transition count 467
Applied a total of 127 rules in 68 ms. Remains 271 /333 variables (removed 62) and now considering 467/611 (removed 144) transitions.
// Phase 1: matrix 467 rows 271 cols
[2025-06-02 19:58:41] [INFO ] Computed 7 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:58:41] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-06-02 19:58:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:58:42] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2025-06-02 19:58: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/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:55] [INFO ] Deduced a trap composed of 146 places in 378 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:55] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:56] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:56] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:57] [INFO ] Deduced a trap composed of 151 places in 330 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:57] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:57] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:58] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:59] [INFO ] Deduced a trap composed of 152 places in 310 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:59] [INFO ] Deduced a trap composed of 84 places in 336 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:00] [INFO ] Deduced a trap composed of 50 places in 318 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 466 unsolved
SMT process timed out in 30132ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 30136ms
Starting structural reductions in LTL mode, iteration 1 : 271/333 places, 467/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31180 ms. Remains : 271/333 places, 467/611 transitions.
[2025-06-02 19:59:12] [INFO ] Flatten gal took : 11 ms
[2025-06-02 19:59:12] [INFO ] Flatten gal took : 12 ms
[2025-06-02 19:59:12] [INFO ] Input system was already deterministic with 467 transitions.
[2025-06-02 19:59:12] [INFO ] Flatten gal took : 12 ms
[2025-06-02 19:59:12] [INFO ] Flatten gal took : 13 ms
[2025-06-02 19:59:12] [INFO ] Time to serialize gal into /tmp/CTLFireability12425056400918845410.gal : 3 ms
[2025-06-02 19:59:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3123238182403186976.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/CTLFireability12425056400918845410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3123238182403186976.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.
Detected timeout of ITS tools.
[2025-06-02 19:59:42] [INFO ] Flatten gal took : 13 ms
[2025-06-02 19:59:42] [INFO ] Applying decomposition
[2025-06-02 19:59:42] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5772913336201095227.txt' '-o' '/tmp/graph5772913336201095227.bin' '-w' '/tmp/graph5772913336201095227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5772913336201095227.bin' '-l' '-1' '-v' '-w' '/tmp/graph5772913336201095227.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:59:43] [INFO ] Decomposing Gal with order
[2025-06-02 19:59:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:59:43] [INFO ] Removed a total of 507 redundant transitions.
[2025-06-02 19:59:43] [INFO ] Flatten gal took : 29 ms
[2025-06-02 19:59:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 14 ms.
[2025-06-02 19:59:43] [INFO ] Time to serialize gal into /tmp/CTLFireability12854321787686157191.gal : 5 ms
[2025-06-02 19:59:43] [INFO ] Time to serialize properties into /tmp/CTLFireability16277149614587763628.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/CTLFireability12854321787686157191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16277149614587763628.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,2.53306e+10,16.5127,289340,2311,66,374793,1240,987,1.75153e+06,81,3964,0


Converting to forward existential form...Done !
original formula: EX((AF(AG(((i10.u9.p51==1)&&(i3.i0.u69.p330==1)))) + AX(AG(((i10.u6.p36==0)||(i6.u44.p182==0))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(!(E(TRUE U !(((i10.u9.p51==1)&&(i3.i0.u69.p330==1)))))))))] != FALSE + [(EY(Init) * !(EX(!(...221
Reverse transition relation is NOT exact ! Due to transitions t64, t141, t148, t184, t186, t187, t189, t198, t200, t207, t212, t213, t215, t244, t246, t247...1228
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 306 transition count 539
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 306 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 306 transition count 538
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 295 transition count 501
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 295 transition count 501
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 289 transition count 492
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 289 transition count 492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 289 transition count 490
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 287 transition count 485
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 287 transition count 485
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 285 transition count 480
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 285 transition count 480
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 283 transition count 475
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 283 transition count 475
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 281 transition count 470
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 281 transition count 470
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 279 transition count 465
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 279 transition count 465
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 277 transition count 460
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 277 transition count 460
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 275 transition count 455
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 275 transition count 455
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 273 transition count 450
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 273 transition count 450
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 271 transition count 445
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 271 transition count 445
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 269 transition count 441
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 269 transition count 441
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 267 transition count 437
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 267 transition count 437
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 265 transition count 434
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 265 transition count 434
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 264 transition count 433
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 264 transition count 433
Applied a total of 141 rules in 55 ms. Remains 264 /333 variables (removed 69) and now considering 433/611 (removed 178) transitions.
// Phase 1: matrix 433 rows 264 cols
[2025-06-02 20:00:13] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:00:13] [INFO ] Implicit Places using invariants in 313 ms returned []
[2025-06-02 20:00:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:00:14] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2025-06-02 20:00: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/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:25] [INFO ] Deduced a trap composed of 147 places in 356 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:26] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:26] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:27] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:27] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:28] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:29] [INFO ] Deduced a trap composed of 49 places in 316 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:30] [INFO ] Deduced a trap composed of 148 places in 306 ms of which 44 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:32] [INFO ] Deduced a trap composed of 78 places in 287 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:33] [INFO ] Deduced a trap composed of 79 places in 187 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:35] [INFO ] Deduced a trap composed of 149 places in 309 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:35] [INFO ] Deduced a trap composed of 81 places in 325 ms of which 62 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:42] [INFO ] Deduced a trap composed of 149 places in 298 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:43] [INFO ] Deduced a trap composed of 148 places in 315 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:44] [INFO ] Deduced a trap composed of 86 places in 312 ms of which 47 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/697 variables, and 22 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:49] [INFO ] Deduced a trap composed of 151 places in 312 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:49] [INFO ] Deduced a trap composed of 150 places in 279 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:00:50] [INFO ] Deduced a trap composed of 149 places in 280 ms of which 40 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (OVERLAPS) 433/697 variables, 264/289 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 432/721 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:01:14] [INFO ] Deduced a trap composed of 156 places in 315 ms of which 64 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 722 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 264/333 places, 433/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61208 ms. Remains : 264/333 places, 433/611 transitions.
[2025-06-02 20:01:14] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:01:14] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:01:14] [INFO ] Input system was already deterministic with 433 transitions.
[2025-06-02 20:01:14] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:01:14] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:01:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12143827686141752341.gal : 4 ms
[2025-06-02 20:01:14] [INFO ] Time to serialize properties into /tmp/CTLFireability10101666284651894925.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/CTLFireability12143827686141752341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10101666284651894925.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.
Detected timeout of ITS tools.
[2025-06-02 20:01:44] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:01:44] [INFO ] Applying decomposition
[2025-06-02 20:01:44] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17378085302349926739.txt' '-o' '/tmp/graph17378085302349926739.bin' '-w' '/tmp/graph17378085302349926739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17378085302349926739.bin' '-l' '-1' '-v' '-w' '/tmp/graph17378085302349926739.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:01:44] [INFO ] Decomposing Gal with order
[2025-06-02 20:01:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:01:44] [INFO ] Removed a total of 449 redundant transitions.
[2025-06-02 20:01:44] [INFO ] Flatten gal took : 29 ms
[2025-06-02 20:01:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 12 ms.
[2025-06-02 20:01:44] [INFO ] Time to serialize gal into /tmp/CTLFireability280078807315548891.gal : 4 ms
[2025-06-02 20:01:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15411185231151915111.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/CTLFireability280078807315548891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15411185231151915111.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,2.46697e+10,7.92523,154500,1896,84,225092,1126,948,839842,98,4115,0


Converting to forward existential form...Done !
original formula: AG(EX(AF((i10.u79.p308==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!((i10.u79.p308==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t57, t64, t141, t148, t186, t187, t189, t198, t200, t207, t212, t213, t215, t234, t246, t247,...1155
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,10.4151,153556,1,0,225092,1228,5217,839842,486,4115,423903
FORMULA FireWire-PT-18-CTLFireability-2025-05 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 : 333/333 places, 611/611 transitions.
Graph (trivial) has 237 edges and 333 vertex of which 11 / 333 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 324 transition count 555
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 278 transition count 555
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 93 place count 278 transition count 538
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 127 place count 261 transition count 538
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 146 place count 242 transition count 474
Iterating global reduction 2 with 19 rules applied. Total rules applied 165 place count 242 transition count 474
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 168 place count 242 transition count 471
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 168 place count 242 transition count 463
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 184 place count 234 transition count 463
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 189 place count 229 transition count 454
Iterating global reduction 3 with 5 rules applied. Total rules applied 194 place count 229 transition count 454
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 197 place count 226 transition count 450
Iterating global reduction 3 with 3 rules applied. Total rules applied 200 place count 226 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 204 place count 226 transition count 446
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 206 place count 224 transition count 446
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 207 place count 223 transition count 443
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 223 transition count 443
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 209 place count 222 transition count 441
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 222 transition count 441
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 211 place count 221 transition count 438
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 221 transition count 438
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 213 place count 220 transition count 436
Iterating global reduction 5 with 1 rules applied. Total rules applied 214 place count 220 transition count 436
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 215 place count 219 transition count 433
Iterating global reduction 5 with 1 rules applied. Total rules applied 216 place count 219 transition count 433
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 217 place count 218 transition count 431
Iterating global reduction 5 with 1 rules applied. Total rules applied 218 place count 218 transition count 431
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 219 place count 217 transition count 428
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 217 transition count 428
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 221 place count 216 transition count 426
Iterating global reduction 5 with 1 rules applied. Total rules applied 222 place count 216 transition count 426
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 223 place count 215 transition count 423
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 215 transition count 423
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 225 place count 214 transition count 421
Iterating global reduction 5 with 1 rules applied. Total rules applied 226 place count 214 transition count 421
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 227 place count 213 transition count 419
Iterating global reduction 5 with 1 rules applied. Total rules applied 228 place count 213 transition count 419
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 229 place count 212 transition count 417
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 212 transition count 417
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 262 place count 196 transition count 401
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 265 place count 193 transition count 395
Iterating global reduction 5 with 3 rules applied. Total rules applied 268 place count 193 transition count 395
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 269 place count 192 transition count 392
Iterating global reduction 5 with 1 rules applied. Total rules applied 270 place count 192 transition count 392
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 271 place count 191 transition count 390
Iterating global reduction 5 with 1 rules applied. Total rules applied 272 place count 191 transition count 390
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 273 place count 190 transition count 387
Iterating global reduction 5 with 1 rules applied. Total rules applied 274 place count 190 transition count 387
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 275 place count 189 transition count 385
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 189 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 277 place count 188 transition count 382
Iterating global reduction 5 with 1 rules applied. Total rules applied 278 place count 188 transition count 382
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 279 place count 187 transition count 380
Iterating global reduction 5 with 1 rules applied. Total rules applied 280 place count 187 transition count 380
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 281 place count 186 transition count 377
Iterating global reduction 5 with 1 rules applied. Total rules applied 282 place count 186 transition count 377
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 283 place count 185 transition count 375
Iterating global reduction 5 with 1 rules applied. Total rules applied 284 place count 185 transition count 375
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 285 place count 184 transition count 372
Iterating global reduction 5 with 1 rules applied. Total rules applied 286 place count 184 transition count 372
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 287 place count 183 transition count 370
Iterating global reduction 5 with 1 rules applied. Total rules applied 288 place count 183 transition count 370
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 289 place count 182 transition count 368
Iterating global reduction 5 with 1 rules applied. Total rules applied 290 place count 182 transition count 368
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 291 place count 181 transition count 366
Iterating global reduction 5 with 1 rules applied. Total rules applied 292 place count 181 transition count 366
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 293 place count 180 transition count 365
Applied a total of 293 rules in 146 ms. Remains 180 /333 variables (removed 153) and now considering 365/611 (removed 246) transitions.
[2025-06-02 20:01:55] [INFO ] Flow matrix only has 361 transitions (discarded 4 similar events)
// Phase 1: matrix 361 rows 180 cols
[2025-06-02 20:01:55] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:01:55] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-02 20:01:55] [INFO ] Flow matrix only has 361 transitions (discarded 4 similar events)
[2025-06-02 20:01:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:01:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 20:01:56] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:01:56] [INFO ] Redundant transitions in 29 ms returned []
Running 356 sub problems to find dead transitions.
[2025-06-02 20:01:56] [INFO ] Flow matrix only has 361 transitions (discarded 4 similar events)
[2025-06-02 20:01:56] [INFO ] Invariant cache hit.
[2025-06-02 20:01:56] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:01:58] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:01:59] [INFO ] Deduced a trap composed of 54 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 20:01:59] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:01:59] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:00] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:01] [INFO ] Deduced a trap composed of 125 places in 202 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:01] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:02] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 29 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 360/538 variables, 178/193 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (OVERLAPS) 2/540 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/541 variables, and 197 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 360/538 variables, 178/193 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 356/551 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/541 variables, and 551 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/180 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in SI_CTL mode, iteration 1 : 180/333 places, 365/611 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61038 ms. Remains : 180/333 places, 365/611 transitions.
[2025-06-02 20:02:56] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:02:56] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:02:56] [INFO ] Input system was already deterministic with 365 transitions.
[2025-06-02 20:02:56] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:02:56] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:02:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4242732151512721133.gal : 2 ms
[2025-06-02 20:02:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1725010538314761728.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4242732151512721133.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1725010538314761728.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (1754 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (400 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2295 steps, run visited all 1 properties in 29 ms. (steps per millisecond=79 )
Probabilistic random walk after 2295 steps, saw 949 distinct states, run finished after 34 ms. (steps per millisecond=67 ) properties seen :1
FORMULA FireWire-PT-18-CTLFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality1725010538314761728.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 309 transition count 545
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 309 transition count 545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 309 transition count 544
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 299 transition count 508
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 299 transition count 508
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 294 transition count 500
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 294 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 294 transition count 498
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 292 transition count 493
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 292 transition count 493
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 290 transition count 488
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 290 transition count 488
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 288 transition count 483
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 288 transition count 483
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 286 transition count 478
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 286 transition count 478
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 284 transition count 473
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 284 transition count 473
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 283 transition count 470
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 283 transition count 470
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 282 transition count 468
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 282 transition count 468
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 281 transition count 465
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 281 transition count 465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 280 transition count 463
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 280 transition count 463
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 279 transition count 461
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 279 transition count 461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 278 transition count 459
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 278 transition count 459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 277 transition count 458
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 277 transition count 458
Applied a total of 115 rules in 61 ms. Remains 277 /333 variables (removed 56) and now considering 458/611 (removed 153) transitions.
// Phase 1: matrix 458 rows 277 cols
[2025-06-02 20:02:56] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:02:56] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-06-02 20:02:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:02:57] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-02 20:02:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:09] [INFO ] Deduced a trap composed of 147 places in 377 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:10] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:10] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:11] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:11] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:12] [INFO ] Deduced a trap composed of 49 places in 333 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:13] [INFO ] Deduced a trap composed of 156 places in 280 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:14] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:16] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:16] [INFO ] Deduced a trap composed of 153 places in 270 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:17] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:18] [INFO ] Deduced a trap composed of 153 places in 288 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:18] [INFO ] Deduced a trap composed of 39 places in 325 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:19] [INFO ] Deduced a trap composed of 154 places in 271 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:24] [INFO ] Deduced a trap composed of 159 places in 271 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:25] [INFO ] Deduced a trap composed of 154 places in 225 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:25] [INFO ] Deduced a trap composed of 157 places in 205 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:27] [INFO ] Deduced a trap composed of 84 places in 302 ms of which 34 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/735 variables, and 25 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/277 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:31] [INFO ] Deduced a trap composed of 154 places in 249 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:32] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:38] [INFO ] Deduced a trap composed of 91 places in 204 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:38] [INFO ] Deduced a trap composed of 154 places in 205 ms of which 40 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:41] [INFO ] Deduced a trap composed of 89 places in 241 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:41] [INFO ] Deduced a trap composed of 159 places in 336 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:43] [INFO ] Deduced a trap composed of 101 places in 232 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:43] [INFO ] Deduced a trap composed of 155 places in 318 ms of which 64 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 7 (OVERLAPS) 458/735 variables, 277/310 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 457/767 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 735/735 variables, and 767 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 277/333 places, 458/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61034 ms. Remains : 277/333 places, 458/611 transitions.
[2025-06-02 20:03:57] [INFO ] Flatten gal took : 13 ms
[2025-06-02 20:03:57] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:03:57] [INFO ] Input system was already deterministic with 458 transitions.
[2025-06-02 20:03:57] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:03:57] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:03:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10510640821505379337.gal : 2 ms
[2025-06-02 20:03:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12702949936467452505.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/CTLFireability10510640821505379337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12702949936467452505.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.
Detected timeout of ITS tools.
[2025-06-02 20:04:27] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:04:27] [INFO ] Applying decomposition
[2025-06-02 20:04:27] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16231231333420836382.txt' '-o' '/tmp/graph16231231333420836382.bin' '-w' '/tmp/graph16231231333420836382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16231231333420836382.bin' '-l' '-1' '-v' '-w' '/tmp/graph16231231333420836382.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:04:27] [INFO ] Decomposing Gal with order
[2025-06-02 20:04:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:04:27] [INFO ] Removed a total of 492 redundant transitions.
[2025-06-02 20:04:27] [INFO ] Flatten gal took : 22 ms
[2025-06-02 20:04:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 5 ms.
[2025-06-02 20:04:27] [INFO ] Time to serialize gal into /tmp/CTLFireability14404609495133026412.gal : 5 ms
[2025-06-02 20:04:27] [INFO ] Time to serialize properties into /tmp/CTLFireability1939498804425807126.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/CTLFireability14404609495133026412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1939498804425807126.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,3.11719e+10,10.7657,189528,2089,76,227876,914,1034,1.03098e+06,94,3407,0


Converting to forward existential form...Done !
original formula: E((EX((!(((i9.i2.u62.p269==1)&&(i9.i1.u71.p299==1))) + EF(((i8.i0.u4.p14==1)&&(i6.u34.p155==1))))) + ((A(EF(EG(((i8.i0.u5.p19==1)&&(i8.i0...389
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(EX((!(((i9.i2.u62.p269==1)&&(i9.i1.u71.p299==1))) + E(TRUE U ((i8.i0.u4.p14==1)&&(i6.u34.p155=...533
Reverse transition relation is NOT exact ! Due to transitions t56, t63, t145, t152, t188, t190, t191, t193, t202, t204, t211, t216, t217, t219, t224, t226,...1161
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 305 transition count 538
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 305 transition count 538
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 305 transition count 537
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 68 place count 294 transition count 500
Iterating global reduction 1 with 11 rules applied. Total rules applied 79 place count 294 transition count 500
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 85 place count 288 transition count 491
Iterating global reduction 1 with 6 rules applied. Total rules applied 91 place count 288 transition count 491
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 288 transition count 489
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 286 transition count 484
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 286 transition count 484
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 284 transition count 479
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 284 transition count 479
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 282 transition count 474
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 282 transition count 474
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 280 transition count 469
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 280 transition count 469
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 278 transition count 464
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 278 transition count 464
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 277 transition count 462
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 277 transition count 462
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 276 transition count 459
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 276 transition count 459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 275 transition count 457
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 275 transition count 457
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 274 transition count 454
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 274 transition count 454
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 273 transition count 452
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 273 transition count 452
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 272 transition count 450
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 272 transition count 450
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 271 transition count 448
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 271 transition count 448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 270 transition count 447
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 270 transition count 447
Applied a total of 129 rules in 66 ms. Remains 270 /333 variables (removed 63) and now considering 447/611 (removed 164) transitions.
// Phase 1: matrix 447 rows 270 cols
[2025-06-02 20:04:57] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:04:58] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-06-02 20:04:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:04:58] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2025-06-02 20:04:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:11] [INFO ] Deduced a trap composed of 146 places in 399 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:11] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:11] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:12] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:12] [INFO ] Deduced a trap composed of 151 places in 347 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:13] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:13] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:14] [INFO ] Deduced a trap composed of 39 places in 282 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:16] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 46 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:17] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:18] [INFO ] Deduced a trap composed of 147 places in 328 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:18] [INFO ] Deduced a trap composed of 155 places in 275 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:19] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:19] [INFO ] Deduced a trap composed of 151 places in 328 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:20] [INFO ] Deduced a trap composed of 157 places in 301 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:20] [INFO ] Deduced a trap composed of 154 places in 311 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:21] [INFO ] Deduced a trap composed of 83 places in 295 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/717 variables, and 24 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/270 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:33] [INFO ] Deduced a trap composed of 152 places in 174 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:34] [INFO ] Deduced a trap composed of 152 places in 172 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:38] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (OVERLAPS) 447/717 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/717 variables, 446/743 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 717/717 variables, and 743 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 270/333 places, 447/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61094 ms. Remains : 270/333 places, 447/611 transitions.
[2025-06-02 20:05:58] [INFO ] Flatten gal took : 16 ms
[2025-06-02 20:05:58] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:05:58] [INFO ] Input system was already deterministic with 447 transitions.
[2025-06-02 20:05:58] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:05:58] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:05:59] [INFO ] Time to serialize gal into /tmp/CTLFireability344244760516579330.gal : 4 ms
[2025-06-02 20:05:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5583631575864524705.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/CTLFireability344244760516579330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5583631575864524705.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.
Detected timeout of ITS tools.
[2025-06-02 20:06:29] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:06:29] [INFO ] Applying decomposition
[2025-06-02 20:06:29] [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/graph211852010794961245.txt' '-o' '/tmp/graph211852010794961245.bin' '-w' '/tmp/graph211852010794961245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph211852010794961245.bin' '-l' '-1' '-v' '-w' '/tmp/graph211852010794961245.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:06:29] [INFO ] Decomposing Gal with order
[2025-06-02 20:06:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:06:29] [INFO ] Removed a total of 479 redundant transitions.
[2025-06-02 20:06:29] [INFO ] Flatten gal took : 23 ms
[2025-06-02 20:06:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2025-06-02 20:06:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3225651281513458773.gal : 4 ms
[2025-06-02 20:06:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6676827859836635967.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/CTLFireability3225651281513458773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6676827859836635967.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,2.45458e+10,18.3578,341292,2989,77,548767,791,1017,1.42768e+06,83,3271,0


Converting to forward existential form...Done !
original formula: EG(AF(((AX((i7.i1.u45.p189==0)) * AG(((i1.u4.p14==0)||(i1.u69.p330==0)))) * (AX((i8.i1.u60.p295==0)) + EG((i11.u92.p431==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!(EX(!((i7.i1.u45.p189==0)))) * !(E(TRUE U !(((i1.u4.p14==0)||(i1.u69.p330==0)))))) * (!(EX(...219
Reverse transition relation is NOT exact ! Due to transitions t57, t64, t141, t148, t184, t189, t198, t207, t212, t213, t215, t220, t225, t230, t235, t239,...1100
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 309 transition count 561
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 309 transition count 561
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 300 transition count 528
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 300 transition count 528
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 297 transition count 523
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 297 transition count 523
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 297 transition count 522
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 296 transition count 520
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 296 transition count 520
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 295 transition count 517
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 295 transition count 517
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 294 transition count 515
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 294 transition count 515
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 293 transition count 512
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 293 transition count 512
Applied a total of 81 rules in 29 ms. Remains 293 /333 variables (removed 40) and now considering 512/611 (removed 99) transitions.
// Phase 1: matrix 512 rows 293 cols
[2025-06-02 20:06:59] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:06:59] [INFO ] Implicit Places using invariants in 410 ms returned []
[2025-06-02 20:06:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:07:00] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
Running 511 sub problems to find dead transitions.
[2025-06-02 20:07: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/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:15] [INFO ] Deduced a trap composed of 148 places in 401 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:15] [INFO ] Deduced a trap composed of 165 places in 302 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:16] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:16] [INFO ] Deduced a trap composed of 78 places in 242 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:16] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:17] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:17] [INFO ] Deduced a trap composed of 91 places in 249 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:18] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:19] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:19] [INFO ] Deduced a trap composed of 93 places in 199 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:20] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:25] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/805 variables, and 19 constraints, problems are : Problem set: 0 solved, 511 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/293 constraints, PredecessorRefiner: 511/511 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:07:37] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 5 (OVERLAPS) 512/805 variables, 293/313 constraints. Problems are: Problem set: 0 solved, 511 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 511/824 constraints. Problems are: Problem set: 0 solved, 511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/805 variables, and 824 constraints, problems are : Problem set: 0 solved, 511 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 511/511 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 511 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 293/333 places, 512/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61383 ms. Remains : 293/333 places, 512/611 transitions.
[2025-06-02 20:08:00] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:08:00] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:08:00] [INFO ] Input system was already deterministic with 512 transitions.
[2025-06-02 20:08:00] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:08:00] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7700977857729103732.gal : 3 ms
[2025-06-02 20:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability7348818226999680365.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/CTLFireability7700977857729103732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7348818226999680365.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.
Detected timeout of ITS tools.
[2025-06-02 20:08:30] [INFO ] Flatten gal took : 21 ms
[2025-06-02 20:08:30] [INFO ] Applying decomposition
[2025-06-02 20:08:30] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14804240103828010898.txt' '-o' '/tmp/graph14804240103828010898.bin' '-w' '/tmp/graph14804240103828010898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14804240103828010898.bin' '-l' '-1' '-v' '-w' '/tmp/graph14804240103828010898.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:08:30] [INFO ] Decomposing Gal with order
[2025-06-02 20:08:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:08:30] [INFO ] Removed a total of 586 redundant transitions.
[2025-06-02 20:08:30] [INFO ] Flatten gal took : 44 ms
[2025-06-02 20:08:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 9 ms.
[2025-06-02 20:08:30] [INFO ] Time to serialize gal into /tmp/CTLFireability5697202802467932044.gal : 9 ms
[2025-06-02 20:08:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14847800136280337752.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/CTLFireability5697202802467932044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14847800136280337752.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,2.86809e+10,10.3865,243328,2562,74,320251,1135,1143,1.55495e+06,95,3591,0


Converting to forward existential form...Done !
original formula: AG(((AX((i5.i1.u26.p125==1)) + AF(((i9.i1.u12.p53==0)||(i5.i0.u45.p179==0)))) + (E((((((i1.i1.u11.p52==1)&&(i7.u56.p234==1))&&(i5.i1.u61....524
=> equivalent forward existential formula: ((([(EY(((FwdU(Init,TRUE) * !((!(EX(!((i5.i1.u26.p125==1)))) + !(EG(!(((i9.i1.u12.p53==0)||(i5.i0.u45.p179==0)))...1460
Reverse transition relation is NOT exact ! Due to transitions t66, t154, t192, t208, t209, t216, t221, t222, t224, t235, t243, t248, t252, t253, t255, t256...1229
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Graph (trivial) has 232 edges and 333 vertex of which 11 / 333 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 324 transition count 554
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 277 transition count 554
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 95 place count 277 transition count 536
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 131 place count 259 transition count 536
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 148 place count 242 transition count 474
Iterating global reduction 2 with 17 rules applied. Total rules applied 165 place count 242 transition count 474
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 168 place count 242 transition count 471
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 168 place count 242 transition count 465
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 180 place count 236 transition count 465
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 185 place count 231 transition count 456
Iterating global reduction 3 with 5 rules applied. Total rules applied 190 place count 231 transition count 456
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 229 transition count 454
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 229 transition count 454
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 198 place count 229 transition count 450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 200 place count 227 transition count 450
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 232 place count 211 transition count 434
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 236 place count 207 transition count 408
Iterating global reduction 5 with 4 rules applied. Total rules applied 240 place count 207 transition count 408
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 207 transition count 407
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 242 place count 206 transition count 404
Iterating global reduction 6 with 1 rules applied. Total rules applied 243 place count 206 transition count 404
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 244 place count 205 transition count 402
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 205 transition count 402
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 246 place count 204 transition count 399
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 204 transition count 399
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 248 place count 203 transition count 397
Iterating global reduction 6 with 1 rules applied. Total rules applied 249 place count 203 transition count 397
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 250 place count 202 transition count 394
Iterating global reduction 6 with 1 rules applied. Total rules applied 251 place count 202 transition count 394
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 201 transition count 392
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 201 transition count 392
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 200 transition count 389
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 200 transition count 389
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 256 place count 199 transition count 387
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 199 transition count 387
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 258 place count 198 transition count 384
Iterating global reduction 6 with 1 rules applied. Total rules applied 259 place count 198 transition count 384
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 260 place count 197 transition count 382
Iterating global reduction 6 with 1 rules applied. Total rules applied 261 place count 197 transition count 382
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 262 place count 196 transition count 380
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 196 transition count 380
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 264 place count 195 transition count 378
Iterating global reduction 6 with 1 rules applied. Total rules applied 265 place count 195 transition count 378
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 267 place count 195 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 268 place count 195 transition count 377
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 194 transition count 376
Applied a total of 269 rules in 115 ms. Remains 194 /333 variables (removed 139) and now considering 376/611 (removed 235) transitions.
[2025-06-02 20:09:01] [INFO ] Flow matrix only has 374 transitions (discarded 2 similar events)
// Phase 1: matrix 374 rows 194 cols
[2025-06-02 20:09:01] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:09:01] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-02 20:09:01] [INFO ] Flow matrix only has 374 transitions (discarded 2 similar events)
[2025-06-02 20:09:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:09:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 20:09:01] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:09:01] [INFO ] Redundant transitions in 8 ms returned []
Running 366 sub problems to find dead transitions.
[2025-06-02 20:09:01] [INFO ] Flow matrix only has 374 transitions (discarded 2 similar events)
[2025-06-02 20:09:01] [INFO ] Invariant cache hit.
[2025-06-02 20:09:01] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:03] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:04] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:04] [INFO ] Deduced a trap composed of 52 places in 223 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:04] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:05] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:05] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:05] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:06] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:07] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 32 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:14] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:16] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 373/565 variables, 192/210 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/568 variables, and 212 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/194 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 373/565 variables, 192/210 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 366/578 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:55] [INFO ] Deduced a trap along path composed of 6 places in 42 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/568 variables, and 579 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/194 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in SI_CTL mode, iteration 1 : 194/333 places, 376/611 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60928 ms. Remains : 194/333 places, 376/611 transitions.
[2025-06-02 20:10:01] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:10:01] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:10:01] [INFO ] Input system was already deterministic with 376 transitions.
[2025-06-02 20:10:02] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:10:02] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:10:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13800423865489310139.gal : 3 ms
[2025-06-02 20:10:02] [INFO ] Time to serialize properties into /tmp/CTLFireability7771300308914089919.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/CTLFireability13800423865489310139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7771300308914089919.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.26746e+09,14.5549,277768,2,10700,5,630144,6,0,1147,1.15366e+06,0


Converting to forward existential form...Done !
original formula: EG((EG(((((AG(((p52==0)||(p141==0))) * (p12==1)) * (p136==1)) + (p135==1)) + ((p54==1)||(p100==1)))) + EF(((p53==1)&&(p367==1)))))
=> equivalent forward existential formula: [FwdG(Init,(EG(((((!(E(TRUE U !(((p52==0)||(p141==0))))) * (p12==1)) * (p136==1)) + (p135==1)) + ((p54==1)||(p10...209
Reverse transition relation is NOT exact ! Due to transitions t21, t29, t30, t35, t37, t42, t62, t64, t65, t68, t70, t73, t74, t75, t80, t82, t83, t85, t89...805
Detected timeout of ITS tools.
[2025-06-02 20:10:32] [INFO ] Flatten gal took : 9 ms
[2025-06-02 20:10:32] [INFO ] Applying decomposition
[2025-06-02 20:10:32] [INFO ] Flatten gal took : 9 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/graph2077079532772564260.txt' '-o' '/tmp/graph2077079532772564260.bin' '-w' '/tmp/graph2077079532772564260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2077079532772564260.bin' '-l' '-1' '-v' '-w' '/tmp/graph2077079532772564260.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:10:32] [INFO ] Decomposing Gal with order
[2025-06-02 20:10:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:10:32] [INFO ] Removed a total of 465 redundant transitions.
[2025-06-02 20:10:32] [INFO ] Flatten gal took : 19 ms
[2025-06-02 20:10:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 4 ms.
[2025-06-02 20:10:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16835066018723084293.gal : 4 ms
[2025-06-02 20:10:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9641019455556197352.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/CTLFireability16835066018723084293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9641019455556197352.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.26746e+09,18.1436,359792,1731,78,447840,1589,856,2.42962e+06,113,5961,0


Converting to forward existential form...Done !
original formula: EG((EG(((((AG(((i0.u6.p52==0)||(i0.u21.p141==0))) * (i5.i1.u2.p12==1)) * (i4.u18.p136==1)) + (i4.u18.p135==1)) + ((i8.i0.u8.p54==1)||(i1....219
=> equivalent forward existential formula: [FwdG(Init,(EG(((((!(E(TRUE U !(((i0.u6.p52==0)||(i0.u21.p141==0))))) * (i5.i1.u2.p12==1)) * (i4.u18.p136==1)) +...280
Reverse transition relation is NOT exact ! Due to transitions t89, t92, t96, t97, t101, t104, t105, t107, t130, t138, t166, t179, t182, t183, t185, t188, t...1020
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 308 transition count 560
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 308 transition count 560
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 298 transition count 543
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 298 transition count 543
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 292 transition count 534
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 292 transition count 534
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 292 transition count 532
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 290 transition count 527
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 290 transition count 527
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 288 transition count 522
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 288 transition count 522
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 286 transition count 517
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 286 transition count 517
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 284 transition count 512
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 284 transition count 512
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 282 transition count 507
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 282 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 280 transition count 502
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 280 transition count 502
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 278 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 278 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 276 transition count 492
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 276 transition count 492
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 274 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 274 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 272 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 272 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 270 transition count 479
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 270 transition count 479
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 268 transition count 476
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 268 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 267 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 267 transition count 475
Applied a total of 134 rules in 67 ms. Remains 267 /333 variables (removed 66) and now considering 475/611 (removed 136) transitions.
// Phase 1: matrix 475 rows 267 cols
[2025-06-02 20:11:02] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:11:02] [INFO ] Implicit Places using invariants in 292 ms returned []
[2025-06-02 20:11:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:11:03] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2025-06-02 20:11: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/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:14] [INFO ] Deduced a trap composed of 146 places in 238 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:14] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:14] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:15] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:15] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:16] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:16] [INFO ] Deduced a trap composed of 51 places in 270 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:23] [INFO ] Deduced a trap composed of 147 places in 293 ms of which 64 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/742 variables, and 15 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/267 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:37] [INFO ] Deduced a trap composed of 78 places in 306 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (OVERLAPS) 475/742 variables, 267/283 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 474/757 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:56] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:57] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:01] [INFO ] Deduced a trap composed of 87 places in 296 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:01] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:02] [INFO ] Deduced a trap composed of 147 places in 379 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:03] [INFO ] Deduced a trap composed of 154 places in 347 ms of which 76 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 742/742 variables, and 763 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 267/333 places, 475/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61106 ms. Remains : 267/333 places, 475/611 transitions.
[2025-06-02 20:12:03] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:12:03] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:12:03] [INFO ] Input system was already deterministic with 475 transitions.
[2025-06-02 20:12:03] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:12:03] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:12:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4205898559196535849.gal : 4 ms
[2025-06-02 20:12:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14260781299147577194.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/CTLFireability4205898559196535849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14260781299147577194.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.
Detected timeout of ITS tools.
[2025-06-02 20:12:33] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:12:33] [INFO ] Applying decomposition
[2025-06-02 20:12:33] [INFO ] Flatten gal took : 22 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/graph11093112401913481434.txt' '-o' '/tmp/graph11093112401913481434.bin' '-w' '/tmp/graph11093112401913481434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11093112401913481434.bin' '-l' '-1' '-v' '-w' '/tmp/graph11093112401913481434.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:12:33] [INFO ] Decomposing Gal with order
[2025-06-02 20:12:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:12:33] [INFO ] Removed a total of 534 redundant transitions.
[2025-06-02 20:12:33] [INFO ] Flatten gal took : 22 ms
[2025-06-02 20:12:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 5 ms.
[2025-06-02 20:12:33] [INFO ] Time to serialize gal into /tmp/CTLFireability9958050343657084912.gal : 4 ms
[2025-06-02 20:12:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14310176965818559156.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/CTLFireability9958050343657084912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14310176965818559156.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 306 transition count 539
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 306 transition count 539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 306 transition count 538
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 295 transition count 501
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 295 transition count 501
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 289 transition count 492
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 289 transition count 492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 289 transition count 490
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 287 transition count 485
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 287 transition count 485
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 285 transition count 480
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 285 transition count 480
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 283 transition count 475
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 283 transition count 475
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 281 transition count 470
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 281 transition count 470
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 279 transition count 465
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 279 transition count 465
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 277 transition count 460
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 277 transition count 460
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 275 transition count 455
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 275 transition count 455
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 273 transition count 450
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 273 transition count 450
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 271 transition count 445
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 271 transition count 445
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 269 transition count 441
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 269 transition count 441
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 267 transition count 437
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 267 transition count 437
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 265 transition count 434
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 265 transition count 434
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 264 transition count 433
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 264 transition count 433
Applied a total of 141 rules in 90 ms. Remains 264 /333 variables (removed 69) and now considering 433/611 (removed 178) transitions.
// Phase 1: matrix 433 rows 264 cols
[2025-06-02 20:13:03] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:13:04] [INFO ] Implicit Places using invariants in 300 ms returned []
[2025-06-02 20:13:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:13:04] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2025-06-02 20:13:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:14] [INFO ] Deduced a trap composed of 147 places in 259 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:14] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:14] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:15] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:15] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:16] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:17] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/697 variables, 264/278 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:32] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/697 variables, and 279 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/697 variables, 264/279 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 432/711 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:54] [INFO ] Deduced a trap composed of 81 places in 321 ms of which 56 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 712 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 264/333 places, 433/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61141 ms. Remains : 264/333 places, 433/611 transitions.
[2025-06-02 20:14:04] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:14:04] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:14:04] [INFO ] Input system was already deterministic with 433 transitions.
[2025-06-02 20:14:04] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:14:04] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:14:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14326258212282744397.gal : 3 ms
[2025-06-02 20:14:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5182164932535552753.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/CTLFireability14326258212282744397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5182164932535552753.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.
Detected timeout of ITS tools.
[2025-06-02 20:14:35] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:14:35] [INFO ] Applying decomposition
[2025-06-02 20:14:35] [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/graph4256164810767144975.txt' '-o' '/tmp/graph4256164810767144975.bin' '-w' '/tmp/graph4256164810767144975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4256164810767144975.bin' '-l' '-1' '-v' '-w' '/tmp/graph4256164810767144975.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:14:35] [INFO ] Decomposing Gal with order
[2025-06-02 20:14:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:14:35] [INFO ] Removed a total of 459 redundant transitions.
[2025-06-02 20:14:35] [INFO ] Flatten gal took : 21 ms
[2025-06-02 20:14:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2025-06-02 20:14:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17605331328728023123.gal : 3 ms
[2025-06-02 20:14:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4518237994965313575.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/CTLFireability17605331328728023123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4518237994965313575.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 310 transition count 582
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 310 transition count 582
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 301 transition count 549
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 301 transition count 549
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 296 transition count 541
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 296 transition count 541
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 296 transition count 540
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 294 transition count 535
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 294 transition count 535
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 292 transition count 530
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 292 transition count 530
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 291 transition count 528
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 291 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 290 transition count 525
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 290 transition count 525
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 289 transition count 523
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 289 transition count 523
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 288 transition count 520
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 288 transition count 520
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 287 transition count 518
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 287 transition count 518
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 286 transition count 515
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 286 transition count 515
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 285 transition count 513
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 285 transition count 513
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 284 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 284 transition count 511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 283 transition count 509
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 283 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 282 transition count 508
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 282 transition count 508
Applied a total of 103 rules in 45 ms. Remains 282 /333 variables (removed 51) and now considering 508/611 (removed 103) transitions.
// Phase 1: matrix 508 rows 282 cols
[2025-06-02 20:15:05] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:15:05] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-06-02 20:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:15:05] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 507 sub problems to find dead transitions.
[2025-06-02 20:15:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:18] [INFO ] Deduced a trap composed of 150 places in 282 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:18] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:19] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:19] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:20] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:20] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:20] [INFO ] Deduced a trap composed of 41 places in 291 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:20] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:22] [INFO ] Deduced a trap composed of 52 places in 285 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:25] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:27] [INFO ] Deduced a trap composed of 87 places in 268 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:33] [INFO ] Deduced a trap composed of 152 places in 344 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:34] [INFO ] Deduced a trap composed of 158 places in 361 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:34] [INFO ] Deduced a trap composed of 92 places in 350 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:35] [INFO ] Deduced a trap composed of 93 places in 318 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:35] [INFO ] Deduced a trap composed of 158 places in 300 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:36] [INFO ] Deduced a trap composed of 158 places in 327 ms of which 71 ms to minimize.
SMT process timed out in 30386ms, After SMT, problems are : Problem set: 0 solved, 507 unsolved
Search for dead transitions found 0 dead transitions in 30388ms
Starting structural reductions in LTL mode, iteration 1 : 282/333 places, 508/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31123 ms. Remains : 282/333 places, 508/611 transitions.
[2025-06-02 20:15:36] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:15:36] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:15:36] [INFO ] Input system was already deterministic with 508 transitions.
[2025-06-02 20:15:36] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:15:36] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:15:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10373517352378665241.gal : 3 ms
[2025-06-02 20:15:36] [INFO ] Time to serialize properties into /tmp/CTLFireability904287239773977699.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/CTLFireability10373517352378665241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability904287239773977699.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.
Detected timeout of ITS tools.
[2025-06-02 20:16:06] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:16:06] [INFO ] Applying decomposition
[2025-06-02 20:16:06] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9264969037210610309.txt' '-o' '/tmp/graph9264969037210610309.bin' '-w' '/tmp/graph9264969037210610309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9264969037210610309.bin' '-l' '-1' '-v' '-w' '/tmp/graph9264969037210610309.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:16:06] [INFO ] Decomposing Gal with order
[2025-06-02 20:16:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:16:06] [INFO ] Removed a total of 581 redundant transitions.
[2025-06-02 20:16:06] [INFO ] Flatten gal took : 23 ms
[2025-06-02 20:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 7 ms.
[2025-06-02 20:16:06] [INFO ] Time to serialize gal into /tmp/CTLFireability16282243261815618775.gal : 4 ms
[2025-06-02 20:16:06] [INFO ] Time to serialize properties into /tmp/CTLFireability2413281333733136872.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/CTLFireability16282243261815618775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2413281333733136872.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 333/333 places, 611/611 transitions.
Graph (trivial) has 223 edges and 333 vertex of which 11 / 333 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 324 transition count 558
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 281 transition count 558
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 87 place count 281 transition count 541
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 121 place count 264 transition count 541
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 138 place count 247 transition count 517
Iterating global reduction 2 with 17 rules applied. Total rules applied 155 place count 247 transition count 517
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 157 place count 247 transition count 515
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 157 place count 247 transition count 508
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 171 place count 240 transition count 508
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 177 place count 234 transition count 497
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 234 transition count 497
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 231 transition count 493
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 231 transition count 493
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 193 place count 231 transition count 489
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 195 place count 229 transition count 489
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 228 transition count 486
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 228 transition count 486
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 227 transition count 484
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 227 transition count 484
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 226 transition count 481
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 226 transition count 481
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 202 place count 225 transition count 479
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 225 transition count 479
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 204 place count 224 transition count 476
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 224 transition count 476
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 223 transition count 474
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 223 transition count 474
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 208 place count 222 transition count 471
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 222 transition count 471
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 5 with 30 rules applied. Total rules applied 239 place count 207 transition count 456
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 241 place count 205 transition count 452
Iterating global reduction 5 with 2 rules applied. Total rules applied 243 place count 205 transition count 452
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 244 place count 204 transition count 449
Iterating global reduction 5 with 1 rules applied. Total rules applied 245 place count 204 transition count 449
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 246 place count 203 transition count 447
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 203 transition count 447
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 248 place count 202 transition count 444
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 202 transition count 444
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 250 place count 201 transition count 442
Iterating global reduction 5 with 1 rules applied. Total rules applied 251 place count 201 transition count 442
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 252 place count 200 transition count 439
Iterating global reduction 5 with 1 rules applied. Total rules applied 253 place count 200 transition count 439
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 254 place count 199 transition count 437
Iterating global reduction 5 with 1 rules applied. Total rules applied 255 place count 199 transition count 437
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 198 transition count 434
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 198 transition count 434
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 258 place count 197 transition count 432
Iterating global reduction 5 with 1 rules applied. Total rules applied 259 place count 197 transition count 432
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 260 place count 196 transition count 429
Iterating global reduction 5 with 1 rules applied. Total rules applied 261 place count 196 transition count 429
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 262 place count 195 transition count 427
Iterating global reduction 5 with 1 rules applied. Total rules applied 263 place count 195 transition count 427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 264 place count 194 transition count 426
Applied a total of 264 rules in 121 ms. Remains 194 /333 variables (removed 139) and now considering 426/611 (removed 185) transitions.
[2025-06-02 20:16:36] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
// Phase 1: matrix 422 rows 194 cols
[2025-06-02 20:16:36] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:16:37] [INFO ] Implicit Places using invariants in 260 ms returned []
[2025-06-02 20:16:37] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2025-06-02 20:16:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:16:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 20:16:37] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:16:37] [INFO ] Redundant transitions in 9 ms returned []
Running 419 sub problems to find dead transitions.
[2025-06-02 20:16:37] [INFO ] Flow matrix only has 422 transitions (discarded 4 similar events)
[2025-06-02 20:16:37] [INFO ] Invariant cache hit.
[2025-06-02 20:16:37] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 2/192 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:16:45] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:16:46] [INFO ] Deduced a trap composed of 64 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 20:16:46] [INFO ] Deduced a trap composed of 71 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 20:16:46] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:16:46] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:16:47] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:16:47] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:16:48] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:16:48] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:16:49] [INFO ] Deduced a trap composed of 135 places in 147 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (OVERLAPS) 421/613 variables, 192/209 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:17:05] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/616 variables, and 212 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/194 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 2/192 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (OVERLAPS) 421/613 variables, 192/210 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 419/631 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:17:29] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/616 variables, and 632 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/194 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in SI_CTL mode, iteration 1 : 194/333 places, 426/611 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60907 ms. Remains : 194/333 places, 426/611 transitions.
[2025-06-02 20:17:37] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:17:37] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:17:37] [INFO ] Input system was already deterministic with 426 transitions.
[2025-06-02 20:17:37] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:17:37] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:17:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16904680772243802754.gal : 2 ms
[2025-06-02 20:17:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7032278898291182324.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/CTLFireability16904680772243802754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7032278898291182324.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.4909e+09,19.8859,369804,2,11782,5,823742,6,0,1198,1.55904e+06,0


Converting to forward existential form...Done !
original formula: E((!(((EG(((p41==1)&&(p435==1))) * (!(EG(((p37==1)&&(p408==1)))) + AG((p201==1)))) * !(E((((p46==1)&&(p220==1))||((p51==1)&&(p334==1))) U...267
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(((EG(((p41==1)&&(p435==1))) * (!(EG(((p37==1)&&(p408==1)))) + !(E(TRUE U !((p201==1)))))) * ...332
Reverse transition relation is NOT exact ! Due to transitions t22, t25, t28, t30, t32, t35, t40, t42, t47, t54, t69, t72, t75, t77, t80, t81, t87, t89, t90...759
Detected timeout of ITS tools.
[2025-06-02 20:18:07] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:18:07] [INFO ] Applying decomposition
[2025-06-02 20:18:07] [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/graph14476358029140796118.txt' '-o' '/tmp/graph14476358029140796118.bin' '-w' '/tmp/graph14476358029140796118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14476358029140796118.bin' '-l' '-1' '-v' '-w' '/tmp/graph14476358029140796118.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:18:07] [INFO ] Decomposing Gal with order
[2025-06-02 20:18:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:18:07] [INFO ] Removed a total of 547 redundant transitions.
[2025-06-02 20:18:07] [INFO ] Flatten gal took : 28 ms
[2025-06-02 20:18:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 5 ms.
[2025-06-02 20:18:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5442997691712425582.gal : 3 ms
[2025-06-02 20:18:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3615968176549474928.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/CTLFireability5442997691712425582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3615968176549474928.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.
Detected timeout of ITS tools.
[2025-06-02 20:18:37] [INFO ] Flatten gal took : 25 ms
[2025-06-02 20:18:37] [INFO ] Flatten gal took : 25 ms
[2025-06-02 20:18:37] [INFO ] Applying decomposition
[2025-06-02 20:18:38] [INFO ] Flatten gal took : 25 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/graph4434850187473446967.txt' '-o' '/tmp/graph4434850187473446967.bin' '-w' '/tmp/graph4434850187473446967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4434850187473446967.bin' '-l' '-1' '-v' '-w' '/tmp/graph4434850187473446967.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:18:38] [INFO ] Decomposing Gal with order
[2025-06-02 20:18:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:18:38] [INFO ] Removed a total of 680 redundant transitions.
[2025-06-02 20:18:38] [INFO ] Flatten gal took : 48 ms
[2025-06-02 20:18:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 11 ms.
[2025-06-02 20:18:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6383380823899638803.gal : 6 ms
[2025-06-02 20:18:38] [INFO ] Time to serialize properties into /tmp/CTLFireability8740574391228416700.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/CTLFireability6383380823899638803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8740574391228416700.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 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.71986e+10,50.8493,786040,4473,124,958161,2186,1205,4.41118e+06,111,9126,0


Converting to forward existential form...Done !
original formula: E(!(A(AX(E(((i1.u11.p51==1)&&(i5.u117.p427==1)) U ((i3.u23.p92==1)&&(i2.i1.u29.p110==1)))) U (((i3.u25.p94==1) * EF((i1.u9.p47==1))) * (!...704
=> equivalent forward existential formula: ([(FwdU(Init,!(!((E(!((((i3.u25.p94==1) * E(TRUE U (i1.u9.p47==1))) * (!(((i4.u53.p226==1)||((i1.u11.p51==1)&&(i...2678
Reverse transition relation is NOT exact ! Due to transitions t18, t72, t79, t133, t180, t217, t223, t226, t239, t240, t255, t279, t283, t287, t288, t289, ...1485
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,302.648,2537480,1,0,3.85521e+06,2737,4015,8.16066e+06,292,11645,822719
FORMULA FireWire-PT-18-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EX((AF(AG(((i1.u11.p41==1)&&(i7.u52.p188==1)))) + (AF((i0.i2.u118.p429==1)) * EF(AX((i9.i4.u79.p295==1)))))) U (!((!(AG((i4.u31.p169==1...446
=> equivalent forward existential formula: [((Init * !(EG(!((!((!(!(E(TRUE U !((i4.u31.p169==1))))) + !(!(EX(!(!(E(TRUE U !(((i5.u2.p12==1)&&(i9.i4.u93.p34...1385
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 1,0,980.329,3772372,1,0,5.312e+06,2737,3774,1.49875e+07,265,11645,3952624
FORMULA FireWire-PT-18-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((EF(((i1.u11.p51==1)&&(i5.u94.p346==1))) * AF(((i1.u11.p52==0)||(i5.u115.p422==0)))) * ((EX(((i10.i0.u85.p320==1) + EX(((i5.u4.p19==1...556
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * (E(TRUE U ((i1.u11.p51==1)&&(i5.u94.p346==1))) * !(EG(!(((i1.u11.p52==0)||(i5.u115.p...1528
(forward)formula 2,0,1252.44,4205652,1,0,6.01352e+06,2820,3997,1.49875e+07,293,11864,8802480
FORMULA FireWire-PT-18-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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="FireWire-PT-18"
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 FireWire-PT-18, 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 r086-smll-174860102400378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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