About the Execution of ITS-Tools for FireWire-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?????????T?????? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400394.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-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400394
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 247K 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-20-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-20-CTLFireability-2024-15
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-00
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-01
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-02
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-03
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-04
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-05
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-06
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-07
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-08
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-09
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-10
FORMULA_NAME FireWire-PT-20-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748906644992
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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 23:24:07] [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 23:24:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 23:24:08] [INFO ] Load time of PNML (sax parser for PT used): 271 ms
[2025-06-02 23:24:08] [INFO ] Transformed 626 places.
[2025-06-02 23:24:08] [INFO ] Transformed 1031 transitions.
[2025-06-02 23:24:08] [INFO ] Found NUPN structural information;
[2025-06-02 23:24:08] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Support contains 111 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 611 transition count 1031
Discarding 129 places :
Symmetric choice reduction at 1 with 129 rule applications. Total rules 144 place count 482 transition count 902
Iterating global reduction 1 with 129 rules applied. Total rules applied 273 place count 482 transition count 902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 274 place count 482 transition count 901
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 295 place count 461 transition count 875
Iterating global reduction 2 with 21 rules applied. Total rules applied 316 place count 461 transition count 875
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 321 place count 456 transition count 868
Iterating global reduction 2 with 5 rules applied. Total rules applied 326 place count 456 transition count 868
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 455 transition count 865
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 455 transition count 865
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 329 place count 454 transition count 863
Iterating global reduction 2 with 1 rules applied. Total rules applied 330 place count 454 transition count 863
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 331 place count 453 transition count 860
Iterating global reduction 2 with 1 rules applied. Total rules applied 332 place count 453 transition count 860
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 333 place count 452 transition count 858
Iterating global reduction 2 with 1 rules applied. Total rules applied 334 place count 452 transition count 858
Applied a total of 334 rules in 344 ms. Remains 452 /626 variables (removed 174) and now considering 858/1031 (removed 173) transitions.
// Phase 1: matrix 858 rows 452 cols
[2025-06-02 23:24:08] [INFO ] Computed 10 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:24:09] [INFO ] Implicit Places using invariants in 747 ms returned []
[2025-06-02 23:24:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:24:10] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
Running 857 sub problems to find dead transitions.
[2025-06-02 23:24:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 857 unsolved
SMT process timed out in 31017ms, After SMT, problems are : Problem set: 0 solved, 857 unsolved
Search for dead transitions found 0 dead transitions in 31055ms
Starting structural reductions in LTL mode, iteration 1 : 452/626 places, 858/1031 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33459 ms. Remains : 452/626 places, 858/1031 transitions.
Support contains 111 out of 452 places after structural reductions.
[2025-06-02 23:24:42] [INFO ] Flatten gal took : 197 ms
[2025-06-02 23:24:42] [INFO ] Flatten gal took : 124 ms
[2025-06-02 23:24:42] [INFO ] Input system was already deterministic with 858 transitions.
Support contains 110 out of 452 places (down from 111) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 78 to 77
RANDOM walk for 40000 steps (18 resets) in 1924 ms. (20 steps per ms) remains 68/77 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 68/68 properties
[2025-06-02 23:24:43] [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/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 312/409 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 7/416 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 822/1238 variables, 416/426 constraints. Problems are: Problem set: 4 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:47] [INFO ] Deduced a trap composed of 49 places in 378 ms of which 88 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1238 variables, 1/427 constraints. Problems are: Problem set: 4 solved, 64 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1238/1310 variables, and 427 constraints, problems are : Problem set: 4 solved, 64 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 416/452 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 64 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 320/409 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:49] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:50] [INFO ] Deduced a trap composed of 97 places in 324 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:50] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:50] [INFO ] Deduced a trap composed of 96 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 23:24:50] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:50] [INFO ] Deduced a trap composed of 62 places in 378 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:50] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:52] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 8/18 constraints. Problems are: Problem set: 4 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:53] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/1310 variables, and 19 constraints, problems are : Problem set: 4 solved, 64 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 0/452 constraints, PredecessorRefiner: 0/68 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10098ms problems are : Problem set: 4 solved, 64 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 858/858 transitions.
Graph (trivial) has 230 edges and 452 vertex of which 8 / 452 are part of one of the 2 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 446 transition count 809
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 43 rules applied. Total rules applied 81 place count 409 transition count 803
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 88 place count 406 transition count 799
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 92 place count 402 transition count 799
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 92 place count 402 transition count 777
Deduced a syphon composed of 22 places in 5 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 136 place count 380 transition count 777
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 378 transition count 774
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 378 transition count 774
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 140 place count 378 transition count 773
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 377 transition count 773
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 4 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 228 place count 334 transition count 730
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -195
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 292 place count 302 transition count 925
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 310 place count 302 transition count 907
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 324 place count 302 transition count 893
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 338 place count 288 transition count 893
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 341 place count 285 transition count 890
Iterating global reduction 5 with 3 rules applied. Total rules applied 344 place count 285 transition count 890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 350 place count 285 transition count 884
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 358 place count 285 transition count 884
Applied a total of 358 rules in 517 ms. Remains 285 /452 variables (removed 167) and now considering 884/858 (removed -26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 ms. Remains : 285/452 places, 884/858 transitions.
RANDOM walk for 40000 steps (29 resets) in 876 ms. (45 steps per ms) remains 55/64 properties
BEST_FIRST walk for 4001 steps (11 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (10 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (16 resets) in 35 ms. (111 steps per ms) remains 53/55 properties
BEST_FIRST walk for 4002 steps (12 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (13 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (15 resets) in 20 ms. (190 steps per ms) remains 51/53 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (19 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (16 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (15 resets) in 29 ms. (133 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4002 steps (17 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (13 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (13 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (14 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (17 resets) in 19 ms. (200 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4002 steps (13 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (11 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (11 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (16 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (11 resets) in 25 ms. (153 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (15 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (13 resets) in 22 ms. (173 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (14 resets) in 16 ms. (235 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4002 steps (16 resets) in 19 ms. (200 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (20 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (15 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (11 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (15 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (13 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (11 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (16 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (15 resets) in 25 ms. (154 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (17 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (12 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (14 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (14 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (11 resets) in 40 ms. (97 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (17 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
[2025-06-02 23:24:55] [INFO ] Flow matrix only has 866 transitions (discarded 18 similar events)
// Phase 1: matrix 866 rows 285 cols
[2025-06-02 23:24:55] [INFO ] Computed 10 invariants in 9 ms
[2025-06-02 23:24:55] [INFO ] State equation strengthened by 14 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/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 197/270 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 3/273 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 866/1139 variables, 273/283 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1139 variables, 14/297 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:24:57] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1139 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1139 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 12/1151 variables, 12/310 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1151 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/1151 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1151/1151 variables, and 310 constraints, problems are : Problem set: 0 solved, 47 unsolved in 8625 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 285/285 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 197/270 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:04] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:04] [INFO ] Deduced a trap composed of 53 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 23:25:04] [INFO ] Deduced a trap composed of 80 places in 468 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:05] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:05] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:05] [INFO ] Deduced a trap composed of 41 places in 478 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:06] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:06] [INFO ] Deduced a trap composed of 32 places in 473 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:06] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:06] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:07] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:08] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:09] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 3/273 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:11] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:12] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 866/1139 variables, 273/299 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1139 variables, 14/313 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1139 variables, 45/358 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1139 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 15 (OVERLAPS) 12/1151 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1151 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1151/1151 variables, and 372 constraints, problems are : Problem set: 0 solved, 47 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 285/285 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53708ms problems are : Problem set: 0 solved, 47 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 884/884 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 0 with 2 rules applied. Total rules applied 2 place count 285 transition count 882
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 283 transition count 882
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 283 transition count 880
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 281 transition count 880
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 276 transition count 875
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 272 transition count 901
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 272 transition count 897
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 272 transition count 893
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 268 transition count 893
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 268 transition count 893
Applied a total of 39 rules in 110 ms. Remains 268 /285 variables (removed 17) and now considering 893/884 (removed -9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 268/285 places, 893/884 transitions.
RANDOM walk for 40000 steps (36 resets) in 653 ms. (61 steps per ms) remains 44/47 properties
BEST_FIRST walk for 4002 steps (13 resets) in 30 ms. (129 steps per ms) remains 42/44 properties
BEST_FIRST walk for 4001 steps (16 resets) in 17 ms. (222 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (19 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (15 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (19 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (18 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (14 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (15 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (10 resets) in 32 ms. (121 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4000 steps (14 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (11 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (17 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (17 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (13 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (11 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (14 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (14 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (12 resets) in 23 ms. (166 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4002 steps (14 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (19 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (17 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (18 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (12 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (11 resets) in 22 ms. (173 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (14 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (13 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (15 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
[2025-06-02 23:25:49] [INFO ] Flow matrix only has 863 transitions (discarded 30 similar events)
// Phase 1: matrix 863 rows 268 cols
[2025-06-02 23:25:49] [INFO ] Computed 10 invariants in 9 ms
[2025-06-02 23:25:49] [INFO ] State equation strengthened by 15 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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 192/253 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 3/256 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 863/1119 variables, 256/266 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1119 variables, 15/281 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1119 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 12/1131 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 0/1131 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 293 constraints, problems are : Problem set: 0 solved, 37 unsolved in 6535 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 268/268 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 192/253 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:56] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:56] [INFO ] Deduced a trap composed of 45 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 23:25:56] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:56] [INFO ] Deduced a trap composed of 57 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 23:25:57] [INFO ] Deduced a trap composed of 53 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 23:25:57] [INFO ] Deduced a trap composed of 38 places in 469 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:57] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:57] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:58] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:58] [INFO ] Deduced a trap composed of 30 places in 414 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 3/256 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:25:59] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:00] [INFO ] Deduced a trap composed of 78 places in 441 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:00] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 863/1119 variables, 256/279 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1119 variables, 15/294 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1119 variables, 35/329 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:04] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:26:04] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1119 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1119 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 12/1131 variables, 12/343 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1131 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1131 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (OVERLAPS) 0/1131 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 345 constraints, problems are : Problem set: 0 solved, 37 unsolved in 48697 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 268/268 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55292ms problems are : Problem set: 0 solved, 37 unsolved
Parikh walk visited 3 properties in 30071 ms.
Support contains 56 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 893/893 transitions.
Graph (trivial) has 43 edges and 268 vertex of which 2 / 268 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) 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 0 with 2 rules applied. Total rules applied 3 place count 267 transition count 889
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 265 transition count 889
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 265 transition count 887
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 263 transition count 887
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 262 transition count 886
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 262 transition count 886
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 258 transition count 882
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 31 place count 252 transition count 921
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 252 transition count 917
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 252 transition count 914
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 249 transition count 914
Applied a total of 41 rules in 92 ms. Remains 249 /268 variables (removed 19) and now considering 914/893 (removed -21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 249/268 places, 914/893 transitions.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2025-06-02 23:27:15] [INFO ] Flatten gal took : 53 ms
[2025-06-02 23:27:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-20-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 23:27:15] [INFO ] Flatten gal took : 56 ms
[2025-06-02 23:27:15] [INFO ] Input system was already deterministic with 858 transitions.
Support contains 97 out of 452 places (down from 99) after GAL structural reductions.
Computed a total of 129 stabilizing places and 202 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 858/858 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 426 transition count 734
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 426 transition count 734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 426 transition count 733
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 67 place count 412 transition count 711
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 412 transition count 711
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 412 transition count 708
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 407 transition count 696
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 407 transition count 696
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 404 transition count 689
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 404 transition count 689
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 401 transition count 681
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 401 transition count 681
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 398 transition count 674
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 398 transition count 674
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 395 transition count 667
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 395 transition count 667
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 121 place count 392 transition count 660
Iterating global reduction 2 with 3 rules applied. Total rules applied 124 place count 392 transition count 660
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 127 place count 389 transition count 654
Iterating global reduction 2 with 3 rules applied. Total rules applied 130 place count 389 transition count 654
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 387 transition count 649
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 387 transition count 649
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 385 transition count 644
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 385 transition count 644
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 383 transition count 640
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 383 transition count 640
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 381 transition count 636
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 381 transition count 636
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 148 place count 379 transition count 633
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 379 transition count 633
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 378 transition count 632
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 378 transition count 632
Applied a total of 152 rules in 95 ms. Remains 378 /452 variables (removed 74) and now considering 632/858 (removed 226) transitions.
// Phase 1: matrix 632 rows 378 cols
[2025-06-02 23:27:15] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:27:15] [INFO ] Implicit Places using invariants in 290 ms returned []
[2025-06-02 23:27:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:27:16] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
Running 631 sub problems to find dead transitions.
[2025-06-02 23:27:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:38] [INFO ] Deduced a trap composed of 213 places in 611 ms of which 209 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:39] [INFO ] Deduced a trap composed of 43 places in 429 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:39] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:40] [INFO ] Deduced a trap composed of 220 places in 433 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:41] [INFO ] Deduced a trap composed of 61 places in 458 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:41] [INFO ] Deduced a trap composed of 76 places in 445 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:42] [INFO ] Deduced a trap composed of 56 places in 384 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:42] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:43] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:44] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:44] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1010 variables, and 21 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 631 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:55] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:57] [INFO ] Deduced a trap composed of 213 places in 461 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:57] [INFO ] Deduced a trap composed of 213 places in 468 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:27:58] [INFO ] Deduced a trap composed of 220 places in 459 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:00] [INFO ] Deduced a trap composed of 220 places in 491 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:01] [INFO ] Deduced a trap composed of 214 places in 461 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:01] [INFO ] Deduced a trap composed of 92 places in 442 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:02] [INFO ] Deduced a trap composed of 215 places in 427 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:02] [INFO ] Deduced a trap composed of 215 places in 428 ms of which 94 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 631 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:09] [INFO ] Deduced a trap composed of 216 places in 485 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:09] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:13] [INFO ] Deduced a trap composed of 78 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 23:28:14] [INFO ] Deduced a trap composed of 104 places in 438 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:28:15] [INFO ] Deduced a trap composed of 218 places in 466 ms of which 101 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1010 variables, and 35 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 0/631 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 378/452 places, 632/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61417 ms. Remains : 378/452 places, 632/858 transitions.
[2025-06-02 23:28:16] [INFO ] Flatten gal took : 47 ms
[2025-06-02 23:28:16] [INFO ] Flatten gal took : 48 ms
[2025-06-02 23:28:16] [INFO ] Input system was already deterministic with 632 transitions.
[2025-06-02 23:28:16] [INFO ] Flatten gal took : 47 ms
[2025-06-02 23:28:16] [INFO ] Flatten gal took : 47 ms
[2025-06-02 23:28:17] [INFO ] Time to serialize gal into /tmp/CTLFireability2725983134697578692.gal : 30 ms
[2025-06-02 23:28:17] [INFO ] Time to serialize properties into /tmp/CTLFireability16349277197922025368.ctl : 18 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/CTLFireability2725983134697578692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16349277197922025368.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 23:28:47] [INFO ] Flatten gal took : 24 ms
[2025-06-02 23:28:47] [INFO ] Applying decomposition
[2025-06-02 23:28:47] [INFO ] Flatten gal took : 23 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/graph4051246779817376237.txt' '-o' '/tmp/graph4051246779817376237.bin' '-w' '/tmp/graph4051246779817376237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4051246779817376237.bin' '-l' '-1' '-v' '-w' '/tmp/graph4051246779817376237.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:28:47] [INFO ] Decomposing Gal with order
[2025-06-02 23:28:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:28:47] [INFO ] Removed a total of 680 redundant transitions.
[2025-06-02 23:28:47] [INFO ] Flatten gal took : 181 ms
[2025-06-02 23:28:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 43 ms.
[2025-06-02 23:28:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7435550683918164917.gal : 27 ms
[2025-06-02 23:28:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12732224128659686197.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/CTLFireability7435550683918164917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12732224128659686197.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 : 452/452 places, 858/858 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 426 transition count 734
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 426 transition count 734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 426 transition count 733
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 66 place count 413 transition count 713
Iterating global reduction 1 with 13 rules applied. Total rules applied 79 place count 413 transition count 713
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 413 transition count 710
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 409 transition count 700
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 409 transition count 700
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 407 transition count 696
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 407 transition count 696
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 405 transition count 690
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 405 transition count 690
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 403 transition count 686
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 403 transition count 686
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 401 transition count 681
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 401 transition count 681
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 399 transition count 677
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 399 transition count 677
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 397 transition count 673
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 397 transition count 673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 396 transition count 671
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 396 transition count 671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 395 transition count 668
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 395 transition count 668
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 394 transition count 666
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 394 transition count 666
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 393 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 393 transition count 664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 392 transition count 662
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 392 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 391 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 391 transition count 661
Applied a total of 126 rules in 88 ms. Remains 391 /452 variables (removed 61) and now considering 661/858 (removed 197) transitions.
// Phase 1: matrix 661 rows 391 cols
[2025-06-02 23:29:17] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:29:18] [INFO ] Implicit Places using invariants in 429 ms returned []
[2025-06-02 23:29:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:29:19] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
Running 660 sub problems to find dead transitions.
[2025-06-02 23:29:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:44] [INFO ] Deduced a trap composed of 216 places in 568 ms of which 175 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:44] [INFO ] Deduced a trap composed of 43 places in 439 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:45] [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 23:29:45] [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 23:29:47] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:48] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:29:48] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)timeout
(s342 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/1052 variables, and 17 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/391 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:00] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:00] [INFO ] Deduced a trap composed of 78 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 23:30:06] [INFO ] Deduced a trap composed of 56 places in 447 ms of which 51 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:30:11] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/1052 variables, and 21 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/391 constraints, PredecessorRefiner: 0/660 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Starting structural reductions in LTL mode, iteration 1 : 391/452 places, 661/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61849 ms. Remains : 391/452 places, 661/858 transitions.
[2025-06-02 23:30:19] [INFO ] Flatten gal took : 36 ms
[2025-06-02 23:30:19] [INFO ] Flatten gal took : 40 ms
[2025-06-02 23:30:19] [INFO ] Input system was already deterministic with 661 transitions.
[2025-06-02 23:30:19] [INFO ] Flatten gal took : 41 ms
[2025-06-02 23:30:19] [INFO ] Flatten gal took : 40 ms
[2025-06-02 23:30:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6192954645597810709.gal : 8 ms
[2025-06-02 23:30:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9941261853604210067.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/CTLFireability6192954645597810709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9941261853604210067.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 23:30:50] [INFO ] Flatten gal took : 21 ms
[2025-06-02 23:30:50] [INFO ] Applying decomposition
[2025-06-02 23:30:50] [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/graph603937072253889891.txt' '-o' '/tmp/graph603937072253889891.bin' '-w' '/tmp/graph603937072253889891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph603937072253889891.bin' '-l' '-1' '-v' '-w' '/tmp/graph603937072253889891.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:30:50] [INFO ] Decomposing Gal with order
[2025-06-02 23:30:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:30:50] [INFO ] Removed a total of 732 redundant transitions.
[2025-06-02 23:30:50] [INFO ] Flatten gal took : 50 ms
[2025-06-02 23:30:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 16 ms.
[2025-06-02 23:30:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7389366675702108593.gal : 8 ms
[2025-06-02 23:30:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4294428254251579254.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/CTLFireability7389366675702108593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4294428254251579254.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.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 858/858 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 429 transition count 766
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 429 transition count 766
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 60 place count 415 transition count 743
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 415 transition count 743
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 77 place count 415 transition count 740
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 411 transition count 731
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 411 transition count 731
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 409 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 409 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 407 transition count 721
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 407 transition count 721
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 405 transition count 716
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 405 transition count 716
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 403 transition count 711
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 403 transition count 711
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 401 transition count 706
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 401 transition count 706
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 399 transition count 701
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 399 transition count 701
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 397 transition count 696
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 397 transition count 696
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 395 transition count 691
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 395 transition count 691
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 393 transition count 687
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 393 transition count 687
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 391 transition count 683
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 391 transition count 683
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 389 transition count 680
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 389 transition count 680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 388 transition count 679
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 388 transition count 679
Applied a total of 131 rules in 99 ms. Remains 388 /452 variables (removed 64) and now considering 679/858 (removed 179) transitions.
// Phase 1: matrix 679 rows 388 cols
[2025-06-02 23:31:20] [INFO ] Computed 10 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:31:20] [INFO ] Implicit Places using invariants in 412 ms returned []
[2025-06-02 23:31:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:31:21] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
Running 678 sub problems to find dead transitions.
[2025-06-02 23:31:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (OVERLAPS) 1/388 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:47] [INFO ] Deduced a trap composed of 217 places in 582 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:47] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:48] [INFO ] Deduced a trap composed of 218 places in 447 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:49] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:49] [INFO ] Deduced a trap composed of 83 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 23:31:49] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:31:50] [INFO ] Deduced a trap composed of 78 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 23:31:51] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1067 variables, and 18 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/388 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (OVERLAPS) 1/388 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:01] [INFO ] Deduced a trap composed of 77 places in 216 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:01] [INFO ] Deduced a trap composed of 79 places in 341 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:02] [INFO ] Deduced a trap composed of 225 places in 458 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:02] [INFO ] Deduced a trap composed of 79 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 23:32:02] [INFO ] Deduced a trap composed of 220 places in 508 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:07] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:07] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:08] [INFO ] Deduced a trap composed of 57 places in 420 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:13] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:32:16] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1067 variables, and 28 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/388 constraints, PredecessorRefiner: 0/678 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in LTL mode, iteration 1 : 388/452 places, 679/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61682 ms. Remains : 388/452 places, 679/858 transitions.
[2025-06-02 23:32:22] [INFO ] Flatten gal took : 32 ms
[2025-06-02 23:32:22] [INFO ] Flatten gal took : 33 ms
[2025-06-02 23:32:22] [INFO ] Input system was already deterministic with 679 transitions.
[2025-06-02 23:32:22] [INFO ] Flatten gal took : 33 ms
[2025-06-02 23:32:22] [INFO ] Flatten gal took : 39 ms
[2025-06-02 23:32:22] [INFO ] Time to serialize gal into /tmp/CTLFireability19265729340513942.gal : 8 ms
[2025-06-02 23:32:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5647766076641219472.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/CTLFireability19265729340513942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5647766076641219472.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 23:32:52] [INFO ] Flatten gal took : 20 ms
[2025-06-02 23:32:52] [INFO ] Applying decomposition
[2025-06-02 23:32:52] [INFO ] Flatten gal took : 20 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/graph2607947992272593233.txt' '-o' '/tmp/graph2607947992272593233.bin' '-w' '/tmp/graph2607947992272593233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2607947992272593233.bin' '-l' '-1' '-v' '-w' '/tmp/graph2607947992272593233.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:32:52] [INFO ] Decomposing Gal with order
[2025-06-02 23:32:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:32:52] [INFO ] Removed a total of 807 redundant transitions.
[2025-06-02 23:32:52] [INFO ] Flatten gal took : 75 ms
[2025-06-02 23:32:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 30 ms.
[2025-06-02 23:32:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7755767760017939217.gal : 12 ms
[2025-06-02 23:32:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5787790851937775169.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/CTLFireability7755767760017939217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5787790851937775169.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.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 858/858 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 428 transition count 767
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 428 transition count 767
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 428 transition count 766
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 413 transition count 742
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 413 transition count 742
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 413 transition count 739
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 408 transition count 727
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 408 transition count 727
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 405 transition count 720
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 405 transition count 720
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 101 place count 402 transition count 712
Iterating global reduction 2 with 3 rules applied. Total rules applied 104 place count 402 transition count 712
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 399 transition count 705
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 399 transition count 705
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 397 transition count 700
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 397 transition count 700
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 395 transition count 696
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 395 transition count 696
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 394 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 394 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 393 transition count 691
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 393 transition count 691
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 392 transition count 688
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 392 transition count 688
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 391 transition count 686
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 391 transition count 686
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 390 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 390 transition count 684
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 389 transition count 682
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 389 transition count 682
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 388 transition count 681
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 388 transition count 681
Applied a total of 132 rules in 88 ms. Remains 388 /452 variables (removed 64) and now considering 681/858 (removed 177) transitions.
// Phase 1: matrix 681 rows 388 cols
[2025-06-02 23:33:22] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:33:23] [INFO ] Implicit Places using invariants in 333 ms returned []
[2025-06-02 23:33:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:33:24] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
Running 680 sub problems to find dead transitions.
[2025-06-02 23:33:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 1 (OVERLAPS) 1/388 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:49] [INFO ] Deduced a trap composed of 216 places in 583 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:49] [INFO ] Deduced a trap composed of 44 places in 438 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:50] [INFO ] Deduced a trap composed of 76 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 23:33:50] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:50] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:52] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:52] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33: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 23:33:54] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:54] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 5 ms to minimize.
SMT process timed out in 30284ms, After SMT, problems are : Problem set: 0 solved, 680 unsolved
Search for dead transitions found 0 dead transitions in 30287ms
Starting structural reductions in LTL mode, iteration 1 : 388/452 places, 681/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31518 ms. Remains : 388/452 places, 681/858 transitions.
[2025-06-02 23:33:54] [INFO ] Flatten gal took : 27 ms
[2025-06-02 23:33:54] [INFO ] Flatten gal took : 30 ms
[2025-06-02 23:33:54] [INFO ] Input system was already deterministic with 681 transitions.
[2025-06-02 23:33:54] [INFO ] Flatten gal took : 29 ms
[2025-06-02 23:33:54] [INFO ] Flatten gal took : 29 ms
[2025-06-02 23:33:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13249587706917422014.gal : 7 ms
[2025-06-02 23:33:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6193364535681190447.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/CTLFireability13249587706917422014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6193364535681190447.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 23:34:24] [INFO ] Flatten gal took : 17 ms
[2025-06-02 23:34:24] [INFO ] Applying decomposition
[2025-06-02 23:34:24] [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/graph7700798672174936105.txt' '-o' '/tmp/graph7700798672174936105.bin' '-w' '/tmp/graph7700798672174936105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7700798672174936105.bin' '-l' '-1' '-v' '-w' '/tmp/graph7700798672174936105.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:34:24] [INFO ] Decomposing Gal with order
[2025-06-02 23:34:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:34:24] [INFO ] Removed a total of 770 redundant transitions.
[2025-06-02 23:34:24] [INFO ] Flatten gal took : 40 ms
[2025-06-02 23:34:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 16 ms.
[2025-06-02 23:34:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5756021170411032106.gal : 7 ms
[2025-06-02 23:34:24] [INFO ] Time to serialize properties into /tmp/CTLFireability323298599460135390.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/CTLFireability5756021170411032106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability323298599460135390.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 -...261
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 : 452/452 places, 858/858 transitions.
Graph (trivial) has 309 edges and 452 vertex of which 8 / 452 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 445 transition count 796
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 115 place count 391 transition count 790
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 388 transition count 789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 387 transition count 789
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 120 place count 387 transition count 758
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 182 place count 356 transition count 758
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 202 place count 336 transition count 668
Iterating global reduction 4 with 20 rules applied. Total rules applied 222 place count 336 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 336 transition count 667
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 223 place count 336 transition count 660
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 237 place count 329 transition count 660
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 249 place count 317 transition count 642
Iterating global reduction 5 with 12 rules applied. Total rules applied 261 place count 317 transition count 642
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 267 place count 317 transition count 636
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 270 place count 314 transition count 636
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 275 place count 309 transition count 624
Iterating global reduction 7 with 5 rules applied. Total rules applied 280 place count 309 transition count 624
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 283 place count 306 transition count 617
Iterating global reduction 7 with 3 rules applied. Total rules applied 286 place count 306 transition count 617
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 289 place count 303 transition count 609
Iterating global reduction 7 with 3 rules applied. Total rules applied 292 place count 303 transition count 609
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 295 place count 300 transition count 602
Iterating global reduction 7 with 3 rules applied. Total rules applied 298 place count 300 transition count 602
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 301 place count 297 transition count 595
Iterating global reduction 7 with 3 rules applied. Total rules applied 304 place count 297 transition count 595
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 307 place count 294 transition count 588
Iterating global reduction 7 with 3 rules applied. Total rules applied 310 place count 294 transition count 588
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 312 place count 292 transition count 583
Iterating global reduction 7 with 2 rules applied. Total rules applied 314 place count 292 transition count 583
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 316 place count 290 transition count 578
Iterating global reduction 7 with 2 rules applied. Total rules applied 318 place count 290 transition count 578
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 320 place count 288 transition count 573
Iterating global reduction 7 with 2 rules applied. Total rules applied 322 place count 288 transition count 573
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 324 place count 286 transition count 569
Iterating global reduction 7 with 2 rules applied. Total rules applied 326 place count 286 transition count 569
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 328 place count 284 transition count 565
Iterating global reduction 7 with 2 rules applied. Total rules applied 330 place count 284 transition count 565
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 372 place count 263 transition count 544
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 374 place count 261 transition count 540
Iterating global reduction 7 with 2 rules applied. Total rules applied 376 place count 261 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 377 place count 260 transition count 539
Applied a total of 377 rules in 166 ms. Remains 260 /452 variables (removed 192) and now considering 539/858 (removed 319) transitions.
[2025-06-02 23:34:55] [INFO ] Flow matrix only has 535 transitions (discarded 4 similar events)
// Phase 1: matrix 535 rows 260 cols
[2025-06-02 23:34:55] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:34:55] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-02 23:34:55] [INFO ] Flow matrix only has 535 transitions (discarded 4 similar events)
[2025-06-02 23:34:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:34:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-02 23:34:56] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:34:56] [INFO ] Redundant transitions in 35 ms returned []
Running 526 sub problems to find dead transitions.
[2025-06-02 23:34:56] [INFO ] Flow matrix only has 535 transitions (discarded 4 similar events)
[2025-06-02 23:34:56] [INFO ] Invariant cache hit.
[2025-06-02 23:34:56] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 526 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:01] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:02] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:02] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:03] [INFO ] Deduced a trap composed of 73 places in 355 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:03] [INFO ] Deduced a trap composed of 29 places in 352 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:04] [INFO ] Deduced a trap composed of 35 places in 349 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:05] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:06] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:06] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:08] [INFO ] Deduced a trap composed of 157 places in 321 ms of which 42 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 526 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:35:12] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 526 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 526 unsolved
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 0 solved, 526 unsolved
Search for dead transitions found 0 dead transitions in 30203ms
Starting structural reductions in SI_CTL mode, iteration 1 : 260/452 places, 539/858 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31564 ms. Remains : 260/452 places, 539/858 transitions.
[2025-06-02 23:35:26] [INFO ] Flatten gal took : 25 ms
[2025-06-02 23:35:26] [INFO ] Flatten gal took : 26 ms
[2025-06-02 23:35:26] [INFO ] Input system was already deterministic with 539 transitions.
[2025-06-02 23:35:26] [INFO ] Flatten gal took : 25 ms
[2025-06-02 23:35:26] [INFO ] Flatten gal took : 25 ms
[2025-06-02 23:35:26] [INFO ] Time to serialize gal into /tmp/CTLFireability14948322652224179483.gal : 4 ms
[2025-06-02 23:35:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6651688835420057795.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/CTLFireability14948322652224179483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6651688835420057795.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 23:35:56] [INFO ] Flatten gal took : 16 ms
[2025-06-02 23:35:56] [INFO ] Applying decomposition
[2025-06-02 23:35:56] [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/graph166992094709257537.txt' '-o' '/tmp/graph166992094709257537.bin' '-w' '/tmp/graph166992094709257537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph166992094709257537.bin' '-l' '-1' '-v' '-w' '/tmp/graph166992094709257537.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:35:56] [INFO ] Decomposing Gal with order
[2025-06-02 23:35:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:35:56] [INFO ] Removed a total of 702 redundant transitions.
[2025-06-02 23:35:56] [INFO ] Flatten gal took : 32 ms
[2025-06-02 23:35:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 14 ms.
[2025-06-02 23:35:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9701862717230567111.gal : 5 ms
[2025-06-02 23:35:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7735903719728571093.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/CTLFireability9701862717230567111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7735903719728571093.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 452/452 places, 858/858 transitions.
Graph (trivial) has 312 edges and 452 vertex of which 11 / 452 are part of one of the 3 SCC in 0 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 443 transition count 793
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 61 rules applied. Total rules applied 117 place count 388 transition count 787
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 385 transition count 787
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 120 place count 385 transition count 756
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 182 place count 354 transition count 756
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 202 place count 334 transition count 666
Iterating global reduction 3 with 20 rules applied. Total rules applied 222 place count 334 transition count 666
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 224 place count 334 transition count 664
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 224 place count 334 transition count 658
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 236 place count 328 transition count 658
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 248 place count 316 transition count 640
Iterating global reduction 4 with 12 rules applied. Total rules applied 260 place count 316 transition count 640
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 266 place count 316 transition count 634
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 269 place count 313 transition count 634
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 274 place count 308 transition count 622
Iterating global reduction 6 with 5 rules applied. Total rules applied 279 place count 308 transition count 622
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 282 place count 305 transition count 615
Iterating global reduction 6 with 3 rules applied. Total rules applied 285 place count 305 transition count 615
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 288 place count 302 transition count 607
Iterating global reduction 6 with 3 rules applied. Total rules applied 291 place count 302 transition count 607
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 294 place count 299 transition count 600
Iterating global reduction 6 with 3 rules applied. Total rules applied 297 place count 299 transition count 600
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 300 place count 296 transition count 593
Iterating global reduction 6 with 3 rules applied. Total rules applied 303 place count 296 transition count 593
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 306 place count 293 transition count 586
Iterating global reduction 6 with 3 rules applied. Total rules applied 309 place count 293 transition count 586
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 311 place count 291 transition count 581
Iterating global reduction 6 with 2 rules applied. Total rules applied 313 place count 291 transition count 581
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 315 place count 289 transition count 576
Iterating global reduction 6 with 2 rules applied. Total rules applied 317 place count 289 transition count 576
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 319 place count 287 transition count 571
Iterating global reduction 6 with 2 rules applied. Total rules applied 321 place count 287 transition count 571
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 323 place count 285 transition count 567
Iterating global reduction 6 with 2 rules applied. Total rules applied 325 place count 285 transition count 567
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 327 place count 283 transition count 563
Iterating global reduction 6 with 2 rules applied. Total rules applied 329 place count 283 transition count 563
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 330 place count 282 transition count 561
Iterating global reduction 6 with 1 rules applied. Total rules applied 331 place count 282 transition count 561
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 373 place count 261 transition count 540
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 375 place count 259 transition count 536
Iterating global reduction 6 with 2 rules applied. Total rules applied 377 place count 259 transition count 536
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 379 place count 259 transition count 536
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 380 place count 259 transition count 535
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 381 place count 258 transition count 534
Applied a total of 381 rules in 193 ms. Remains 258 /452 variables (removed 194) and now considering 534/858 (removed 324) transitions.
[2025-06-02 23:36:27] [INFO ] Flow matrix only has 532 transitions (discarded 2 similar events)
// Phase 1: matrix 532 rows 258 cols
[2025-06-02 23:36:27] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:36:27] [INFO ] Implicit Places using invariants in 342 ms returned []
[2025-06-02 23:36:27] [INFO ] Flow matrix only has 532 transitions (discarded 2 similar events)
[2025-06-02 23:36:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:36:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-02 23:36:28] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:36:28] [INFO ] Redundant transitions in 12 ms returned []
Running 521 sub problems to find dead transitions.
[2025-06-02 23:36:28] [INFO ] Flow matrix only has 532 transitions (discarded 2 similar events)
[2025-06-02 23:36:28] [INFO ] Invariant cache hit.
[2025-06-02 23:36:28] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:33] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:33] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:34] [INFO ] Deduced a trap composed of 58 places in 364 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:35] [INFO ] Deduced a trap composed of 73 places in 349 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:35] [INFO ] Deduced a trap composed of 28 places in 330 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:36] [INFO ] Deduced a trap composed of 34 places in 327 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:37] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:39] [INFO ] Deduced a trap composed of 154 places in 312 ms of which 40 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (OVERLAPS) 531/786 variables, 255/273 constraints. Problems are: Problem set: 0 solved, 521 unsolved
SMT process timed out in 30118ms, After SMT, problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 30120ms
Starting structural reductions in SI_CTL mode, iteration 1 : 258/452 places, 534/858 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31362 ms. Remains : 258/452 places, 534/858 transitions.
[2025-06-02 23:36:58] [INFO ] Flatten gal took : 20 ms
[2025-06-02 23:36:58] [INFO ] Flatten gal took : 21 ms
[2025-06-02 23:36:58] [INFO ] Input system was already deterministic with 534 transitions.
[2025-06-02 23:36:58] [INFO ] Flatten gal took : 21 ms
[2025-06-02 23:36:58] [INFO ] Flatten gal took : 22 ms
[2025-06-02 23:36:58] [INFO ] Time to serialize gal into /tmp/CTLFireability7472678348367595543.gal : 4 ms
[2025-06-02 23:36:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1876049118336071785.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/CTLFireability7472678348367595543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1876049118336071785.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 23:37:28] [INFO ] Flatten gal took : 13 ms
[2025-06-02 23:37:28] [INFO ] Applying decomposition
[2025-06-02 23:37:28] [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/graph13680739502675792624.txt' '-o' '/tmp/graph13680739502675792624.bin' '-w' '/tmp/graph13680739502675792624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13680739502675792624.bin' '-l' '-1' '-v' '-w' '/tmp/graph13680739502675792624.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:37:28] [INFO ] Decomposing Gal with order
[2025-06-02 23:37:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:37:28] [INFO ] Removed a total of 709 redundant transitions.
[2025-06-02 23:37:28] [INFO ] Flatten gal took : 48 ms
[2025-06-02 23:37:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 16 ms.
[2025-06-02 23:37:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14482383789815550919.gal : 7 ms
[2025-06-02 23:37:28] [INFO ] Time to serialize properties into /tmp/CTLFireability16942199965992857108.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/CTLFireability14482383789815550919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16942199965992857108.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 : 452/452 places, 858/858 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 428 transition count 794
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 428 transition count 794
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 61 place count 415 transition count 773
Iterating global reduction 0 with 13 rules applied. Total rules applied 74 place count 415 transition count 773
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 77 place count 415 transition count 770
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 82 place count 410 transition count 758
Iterating global reduction 1 with 5 rules applied. Total rules applied 87 place count 410 transition count 758
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 407 transition count 751
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 407 transition count 751
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 404 transition count 743
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 404 transition count 743
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 401 transition count 736
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 401 transition count 736
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 399 transition count 731
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 399 transition count 731
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 397 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 397 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 395 transition count 721
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 395 transition count 721
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 393 transition count 716
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 393 transition count 716
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 391 transition count 711
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 391 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 390 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 390 transition count 709
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 389 transition count 707
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 389 transition count 707
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 388 transition count 705
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 388 transition count 705
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 387 transition count 704
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 387 transition count 704
Applied a total of 133 rules in 90 ms. Remains 387 /452 variables (removed 65) and now considering 704/858 (removed 154) transitions.
// Phase 1: matrix 704 rows 387 cols
[2025-06-02 23:37:58] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:37:59] [INFO ] Implicit Places using invariants in 303 ms returned []
[2025-06-02 23:37:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:37:59] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2025-06-02 23:37:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/387 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:25] [INFO ] Deduced a trap composed of 217 places in 394 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:25] [INFO ] Deduced a trap composed of 45 places in 295 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:26] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:26] [INFO ] Deduced a trap composed of 89 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 23:38:26] [INFO ] Deduced a trap composed of 79 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 23:38:26] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:28] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:28] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:28] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/1091 variables, and 19 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/387 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/387 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:44] [INFO ] Deduced a trap composed of 58 places in 421 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:47] [INFO ] Deduced a trap composed of 63 places in 418 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:48] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:38:55] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/1091 variables, and 23 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/387 constraints, PredecessorRefiner: 0/703 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Starting structural reductions in LTL mode, iteration 1 : 387/452 places, 704/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61377 ms. Remains : 387/452 places, 704/858 transitions.
[2025-06-02 23:39:00] [INFO ] Flatten gal took : 26 ms
[2025-06-02 23:39:00] [INFO ] Flatten gal took : 28 ms
[2025-06-02 23:39:00] [INFO ] Input system was already deterministic with 704 transitions.
[2025-06-02 23:39:00] [INFO ] Flatten gal took : 28 ms
[2025-06-02 23:39:00] [INFO ] Flatten gal took : 28 ms
[2025-06-02 23:39:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3255439840570756623.gal : 6 ms
[2025-06-02 23:39:00] [INFO ] Time to serialize properties into /tmp/CTLFireability17215379202036805836.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/CTLFireability3255439840570756623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17215379202036805836.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 23:39:30] [INFO ] Flatten gal took : 17 ms
[2025-06-02 23:39:30] [INFO ] Applying decomposition
[2025-06-02 23:39:30] [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/graph6447837695811853024.txt' '-o' '/tmp/graph6447837695811853024.bin' '-w' '/tmp/graph6447837695811853024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6447837695811853024.bin' '-l' '-1' '-v' '-w' '/tmp/graph6447837695811853024.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:39:30] [INFO ] Decomposing Gal with order
[2025-06-02 23:39:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:39:30] [INFO ] Removed a total of 788 redundant transitions.
[2025-06-02 23:39:30] [INFO ] Flatten gal took : 37 ms
[2025-06-02 23:39:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 10 ms.
[2025-06-02 23:39:30] [INFO ] Time to serialize gal into /tmp/CTLFireability6652586414849512125.gal : 7 ms
[2025-06-02 23:39:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12637637156908527907.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/CTLFireability6652586414849512125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12637637156908527907.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 : 452/452 places, 858/858 transitions.
Graph (trivial) has 310 edges and 452 vertex of which 11 / 452 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 443 transition count 794
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 115 place count 389 transition count 788
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 386 transition count 788
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 118 place count 386 transition count 756
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 182 place count 354 transition count 756
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 200 place count 336 transition count 669
Iterating global reduction 3 with 18 rules applied. Total rules applied 218 place count 336 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 219 place count 336 transition count 668
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 219 place count 336 transition count 662
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 231 place count 330 transition count 662
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 241 place count 320 transition count 646
Iterating global reduction 4 with 10 rules applied. Total rules applied 251 place count 320 transition count 646
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 4 with 4 rules applied. Total rules applied 255 place count 320 transition count 642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 257 place count 318 transition count 642
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 261 place count 314 transition count 633
Iterating global reduction 6 with 4 rules applied. Total rules applied 265 place count 314 transition count 633
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 267 place count 312 transition count 628
Iterating global reduction 6 with 2 rules applied. Total rules applied 269 place count 312 transition count 628
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 271 place count 310 transition count 623
Iterating global reduction 6 with 2 rules applied. Total rules applied 273 place count 310 transition count 623
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 275 place count 308 transition count 618
Iterating global reduction 6 with 2 rules applied. Total rules applied 277 place count 308 transition count 618
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 279 place count 306 transition count 614
Iterating global reduction 6 with 2 rules applied. Total rules applied 281 place count 306 transition count 614
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 283 place count 304 transition count 609
Iterating global reduction 6 with 2 rules applied. Total rules applied 285 place count 304 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 286 place count 303 transition count 607
Iterating global reduction 6 with 1 rules applied. Total rules applied 287 place count 303 transition count 607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 288 place count 302 transition count 604
Iterating global reduction 6 with 1 rules applied. Total rules applied 289 place count 302 transition count 604
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 290 place count 301 transition count 602
Iterating global reduction 6 with 1 rules applied. Total rules applied 291 place count 301 transition count 602
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 292 place count 300 transition count 600
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 300 transition count 600
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 294 place count 299 transition count 598
Iterating global reduction 6 with 1 rules applied. Total rules applied 295 place count 299 transition count 598
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 337 place count 278 transition count 577
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 338 place count 277 transition count 575
Iterating global reduction 6 with 1 rules applied. Total rules applied 339 place count 277 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 340 place count 276 transition count 574
Applied a total of 340 rules in 122 ms. Remains 276 /452 variables (removed 176) and now considering 574/858 (removed 284) transitions.
[2025-06-02 23:40:00] [INFO ] Flow matrix only has 569 transitions (discarded 5 similar events)
// Phase 1: matrix 569 rows 276 cols
[2025-06-02 23:40:00] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:40:00] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-06-02 23:40:00] [INFO ] Flow matrix only has 569 transitions (discarded 5 similar events)
[2025-06-02 23:40:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:40:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-02 23:40:01] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:40:01] [INFO ] Redundant transitions in 11 ms returned []
Running 562 sub problems to find dead transitions.
[2025-06-02 23:40:01] [INFO ] Flow matrix only has 569 transitions (discarded 5 similar events)
[2025-06-02 23:40:01] [INFO ] Invariant cache hit.
[2025-06-02 23:40:01] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:07] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:08] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:10] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:11] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (OVERLAPS) 1/273 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:31] [INFO ] Deduced a trap composed of 63 places in 330 ms of which 43 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 273/845 variables, and 15 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/276 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (OVERLAPS) 1/273 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:45] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:45] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:45] [INFO ] Deduced a trap composed of 80 places in 360 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:46] [INFO ] Deduced a trap composed of 27 places in 366 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:46] [INFO ] Deduced a trap composed of 33 places in 353 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:50] [INFO ] Deduced a trap composed of 165 places in 349 ms of which 47 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:56] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:41:01] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/845 variables, and 23 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/276 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/562 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Starting structural reductions in SI_CTL mode, iteration 1 : 276/452 places, 574/858 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61420 ms. Remains : 276/452 places, 574/858 transitions.
[2025-06-02 23:41:02] [INFO ] Flatten gal took : 13 ms
[2025-06-02 23:41:02] [INFO ] Flatten gal took : 14 ms
[2025-06-02 23:41:02] [INFO ] Input system was already deterministic with 574 transitions.
[2025-06-02 23:41:02] [INFO ] Flatten gal took : 14 ms
[2025-06-02 23:41:02] [INFO ] Flatten gal took : 14 ms
[2025-06-02 23:41:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1235175939248110269.gal : 3 ms
[2025-06-02 23:41:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12062981632479440574.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/CTLFireability1235175939248110269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12062981632479440574.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 23:41:32] [INFO ] Flatten gal took : 13 ms
[2025-06-02 23:41:32] [INFO ] Applying decomposition
[2025-06-02 23:41:32] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15278370198726376255.txt' '-o' '/tmp/graph15278370198726376255.bin' '-w' '/tmp/graph15278370198726376255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15278370198726376255.bin' '-l' '-1' '-v' '-w' '/tmp/graph15278370198726376255.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:41:32] [INFO ] Decomposing Gal with order
[2025-06-02 23:41:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:41:32] [INFO ] Removed a total of 776 redundant transitions.
[2025-06-02 23:41:32] [INFO ] Flatten gal took : 30 ms
[2025-06-02 23:41:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 9 ms.
[2025-06-02 23:41:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12074114092901559335.gal : 5 ms
[2025-06-02 23:41:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13843645000844510780.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/CTLFireability12074114092901559335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13843645000844510780.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 : 452/452 places, 858/858 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 427 transition count 735
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 427 transition count 735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 427 transition count 734
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 412 transition count 710
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 412 transition count 710
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 412 transition count 707
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 407 transition count 695
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 407 transition count 695
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 404 transition count 688
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 404 transition count 688
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 402 transition count 683
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 402 transition count 683
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 400 transition count 678
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 400 transition count 678
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 398 transition count 674
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 398 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 396 transition count 669
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 396 transition count 669
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 394 transition count 666
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 394 transition count 666
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 393 transition count 663
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 393 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 392 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 392 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 391 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 391 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 390 transition count 657
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 390 transition count 657
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 389 transition count 656
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 389 transition count 656
Applied a total of 130 rules in 77 ms. Remains 389 /452 variables (removed 63) and now considering 656/858 (removed 202) transitions.
// Phase 1: matrix 656 rows 389 cols
[2025-06-02 23:42:02] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:42:02] [INFO ] Implicit Places using invariants in 419 ms returned []
[2025-06-02 23:42:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:42:03] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Running 655 sub problems to find dead transitions.
[2025-06-02 23:42: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/388 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/389 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:28] [INFO ] Deduced a trap composed of 216 places in 585 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:28] [INFO ] Deduced a trap composed of 43 places in 424 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:29] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:29] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:30] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:31] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:32] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:33] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 389/1045 variables, and 18 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/389 constraints, PredecessorRefiner: 655/655 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 1 (OVERLAPS) 1/389 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 655 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:48] [INFO ] Deduced a trap composed of 56 places in 412 ms of which 62 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/389 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 655 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:56] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:57] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:58] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/1045 variables, and 22 constraints, problems are : Problem set: 0 solved, 655 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/389 constraints, PredecessorRefiner: 0/655 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60261ms problems are : Problem set: 0 solved, 655 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Starting structural reductions in LTL mode, iteration 1 : 389/452 places, 656/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61781 ms. Remains : 389/452 places, 656/858 transitions.
[2025-06-02 23:43:04] [INFO ] Flatten gal took : 25 ms
[2025-06-02 23:43:04] [INFO ] Flatten gal took : 27 ms
[2025-06-02 23:43:04] [INFO ] Input system was already deterministic with 656 transitions.
[2025-06-02 23:43:04] [INFO ] Flatten gal took : 26 ms
[2025-06-02 23:43:04] [INFO ] Flatten gal took : 27 ms
[2025-06-02 23:43:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7591297643440988532.gal : 5 ms
[2025-06-02 23:43:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6790074613041544432.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/CTLFireability7591297643440988532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6790074613041544432.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 23:43:34] [INFO ] Flatten gal took : 16 ms
[2025-06-02 23:43:34] [INFO ] Applying decomposition
[2025-06-02 23:43:34] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18383076187517543688.txt' '-o' '/tmp/graph18383076187517543688.bin' '-w' '/tmp/graph18383076187517543688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18383076187517543688.bin' '-l' '-1' '-v' '-w' '/tmp/graph18383076187517543688.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:43:34] [INFO ] Decomposing Gal with order
[2025-06-02 23:43:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:43:34] [INFO ] Removed a total of 723 redundant transitions.
[2025-06-02 23:43:34] [INFO ] Flatten gal took : 33 ms
[2025-06-02 23:43:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2025-06-02 23:43:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8999529143583078285.gal : 6 ms
[2025-06-02 23:43:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15492079191449653926.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/CTLFireability8999529143583078285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15492079191449653926.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 : 452/452 places, 858/858 transitions.
Graph (trivial) has 314 edges and 452 vertex of which 11 / 452 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 443 transition count 793
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 61 rules applied. Total rules applied 117 place count 388 transition count 787
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 385 transition count 787
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 120 place count 385 transition count 756
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 182 place count 354 transition count 756
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 201 place count 335 transition count 668
Iterating global reduction 3 with 19 rules applied. Total rules applied 220 place count 335 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 221 place count 335 transition count 667
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 221 place count 335 transition count 660
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 235 place count 328 transition count 660
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 247 place count 316 transition count 642
Iterating global reduction 4 with 12 rules applied. Total rules applied 259 place count 316 transition count 642
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 265 place count 316 transition count 636
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 268 place count 313 transition count 636
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 273 place count 308 transition count 624
Iterating global reduction 6 with 5 rules applied. Total rules applied 278 place count 308 transition count 624
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 281 place count 305 transition count 617
Iterating global reduction 6 with 3 rules applied. Total rules applied 284 place count 305 transition count 617
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 287 place count 302 transition count 609
Iterating global reduction 6 with 3 rules applied. Total rules applied 290 place count 302 transition count 609
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 293 place count 299 transition count 602
Iterating global reduction 6 with 3 rules applied. Total rules applied 296 place count 299 transition count 602
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 299 place count 296 transition count 595
Iterating global reduction 6 with 3 rules applied. Total rules applied 302 place count 296 transition count 595
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 305 place count 293 transition count 588
Iterating global reduction 6 with 3 rules applied. Total rules applied 308 place count 293 transition count 588
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 310 place count 291 transition count 583
Iterating global reduction 6 with 2 rules applied. Total rules applied 312 place count 291 transition count 583
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 314 place count 289 transition count 578
Iterating global reduction 6 with 2 rules applied. Total rules applied 316 place count 289 transition count 578
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 318 place count 287 transition count 573
Iterating global reduction 6 with 2 rules applied. Total rules applied 320 place count 287 transition count 573
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 322 place count 285 transition count 569
Iterating global reduction 6 with 2 rules applied. Total rules applied 324 place count 285 transition count 569
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 326 place count 283 transition count 565
Iterating global reduction 6 with 2 rules applied. Total rules applied 328 place count 283 transition count 565
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 329 place count 282 transition count 563
Iterating global reduction 6 with 1 rules applied. Total rules applied 330 place count 282 transition count 563
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 372 place count 261 transition count 542
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 374 place count 259 transition count 538
Iterating global reduction 6 with 2 rules applied. Total rules applied 376 place count 259 transition count 538
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 377 place count 258 transition count 537
Applied a total of 377 rules in 121 ms. Remains 258 /452 variables (removed 194) and now considering 537/858 (removed 321) transitions.
[2025-06-02 23:44:04] [INFO ] Flow matrix only has 532 transitions (discarded 5 similar events)
// Phase 1: matrix 532 rows 258 cols
[2025-06-02 23:44:04] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:44:04] [INFO ] Implicit Places using invariants in 274 ms returned []
[2025-06-02 23:44:04] [INFO ] Flow matrix only has 532 transitions (discarded 5 similar events)
[2025-06-02 23:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:44:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-02 23:44:05] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:44:05] [INFO ] Redundant transitions in 9 ms returned []
Running 524 sub problems to find dead transitions.
[2025-06-02 23:44:05] [INFO ] Flow matrix only has 532 transitions (discarded 5 similar events)
[2025-06-02 23:44:05] [INFO ] Invariant cache hit.
[2025-06-02 23:44:05] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:10] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:11] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:12] [INFO ] Deduced a trap composed of 57 places in 355 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:13] [INFO ] Deduced a trap composed of 73 places in 357 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:13] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:13] [INFO ] Deduced a trap composed of 33 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 23:44:14] [INFO ] Deduced a trap composed of 27 places in 303 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:15] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:44:17] [INFO ] Deduced a trap composed of 155 places in 341 ms of which 57 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (OVERLAPS) 531/786 variables, 255/274 constraints. Problems are: Problem set: 0 solved, 524 unsolved
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 30185ms
Starting structural reductions in SI_CTL mode, iteration 1 : 258/452 places, 537/858 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31370 ms. Remains : 258/452 places, 537/858 transitions.
[2025-06-02 23:44:35] [INFO ] Flatten gal took : 19 ms
[2025-06-02 23:44:35] [INFO ] Flatten gal took : 21 ms
[2025-06-02 23:44:36] [INFO ] Input system was already deterministic with 537 transitions.
[2025-06-02 23:44:36] [INFO ] Flatten gal took : 21 ms
[2025-06-02 23:44:36] [INFO ] Flatten gal took : 22 ms
[2025-06-02 23:44:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4914953515263337689.gal : 3 ms
[2025-06-02 23:44:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11367676811292399996.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/CTLFireability4914953515263337689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11367676811292399996.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 23:45:06] [INFO ] Flatten gal took : 17 ms
[2025-06-02 23:45:06] [INFO ] Applying decomposition
[2025-06-02 23:45:06] [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/graph5055859055783024227.txt' '-o' '/tmp/graph5055859055783024227.bin' '-w' '/tmp/graph5055859055783024227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5055859055783024227.bin' '-l' '-1' '-v' '-w' '/tmp/graph5055859055783024227.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:45:06] [INFO ] Decomposing Gal with order
[2025-06-02 23:45:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:45:06] [INFO ] Removed a total of 700 redundant transitions.
[2025-06-02 23:45:06] [INFO ] Flatten gal took : 27 ms
[2025-06-02 23:45:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 6 ms.
[2025-06-02 23:45:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15907754575445054928.gal : 4 ms
[2025-06-02 23:45:06] [INFO ] Time to serialize properties into /tmp/CTLFireability9162877288980951963.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/CTLFireability15907754575445054928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9162877288980951963.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 : 452/452 places, 858/858 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 431 transition count 771
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 431 transition count 771
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 417 transition count 748
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 417 transition count 748
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 72 place count 417 transition count 746
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 412 transition count 734
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 412 transition count 734
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 409 transition count 727
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 409 transition count 727
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 406 transition count 719
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 406 transition count 719
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 97 place count 403 transition count 712
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 403 transition count 712
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 400 transition count 705
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 400 transition count 705
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 398 transition count 700
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 398 transition count 700
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 396 transition count 697
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 396 transition count 697
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 395 transition count 694
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 395 transition count 694
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 394 transition count 692
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 394 transition count 692
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 393 transition count 690
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 393 transition count 690
Applied a total of 120 rules in 65 ms. Remains 393 /452 variables (removed 59) and now considering 690/858 (removed 168) transitions.
// Phase 1: matrix 690 rows 393 cols
[2025-06-02 23:45:36] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:45:36] [INFO ] Implicit Places using invariants in 427 ms returned []
[2025-06-02 23:45:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:45:37] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Running 689 sub problems to find dead transitions.
[2025-06-02 23:45: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/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 689 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:03] [INFO ] Deduced a trap composed of 218 places in 613 ms of which 191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:04] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:04] [INFO ] Deduced a trap composed of 222 places in 331 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:04] [INFO ] Deduced a trap composed of 240 places in 282 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:05] [INFO ] Deduced a trap composed of 244 places in 437 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:05] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:06] [INFO ] Deduced a trap composed of 76 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 23:46:06] [INFO ] Deduced a trap composed of 222 places in 489 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:07] [INFO ] Deduced a trap composed of 225 places in 483 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:07] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1083 variables, and 20 constraints, problems are : Problem set: 0 solved, 689 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/393 constraints, PredecessorRefiner: 689/689 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 689 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 689 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:17] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:17] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:19] [INFO ] Deduced a trap composed of 223 places in 418 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:20] [INFO ] Deduced a trap composed of 91 places in 470 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:21] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:22] [INFO ] Deduced a trap composed of 77 places in 484 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:23] [INFO ] Deduced a trap composed of 223 places in 480 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:24] [INFO ] Deduced a trap composed of 224 places in 525 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:24] [INFO ] Deduced a trap composed of 220 places in 493 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:25] [INFO ] Deduced a trap composed of 59 places in 487 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:31] [INFO ] Deduced a trap composed of 64 places in 451 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:31] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 689 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/1083 variables, and 32 constraints, problems are : Problem set: 0 solved, 689 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/393 constraints, PredecessorRefiner: 0/689 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 689 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Starting structural reductions in LTL mode, iteration 1 : 393/452 places, 690/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61691 ms. Remains : 393/452 places, 690/858 transitions.
[2025-06-02 23:46:38] [INFO ] Flatten gal took : 25 ms
[2025-06-02 23:46:38] [INFO ] Flatten gal took : 28 ms
[2025-06-02 23:46:38] [INFO ] Input system was already deterministic with 690 transitions.
[2025-06-02 23:46:38] [INFO ] Flatten gal took : 28 ms
[2025-06-02 23:46:38] [INFO ] Flatten gal took : 28 ms
[2025-06-02 23:46:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13443069910824710124.gal : 5 ms
[2025-06-02 23:46:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11923127079522397995.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/CTLFireability13443069910824710124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11923127079522397995.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 23:47:08] [INFO ] Flatten gal took : 16 ms
[2025-06-02 23:47:08] [INFO ] Applying decomposition
[2025-06-02 23:47:08] [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/graph6089572345901904885.txt' '-o' '/tmp/graph6089572345901904885.bin' '-w' '/tmp/graph6089572345901904885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6089572345901904885.bin' '-l' '-1' '-v' '-w' '/tmp/graph6089572345901904885.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:47:08] [INFO ] Decomposing Gal with order
[2025-06-02 23:47:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:47:08] [INFO ] Removed a total of 777 redundant transitions.
[2025-06-02 23:47:08] [INFO ] Flatten gal took : 31 ms
[2025-06-02 23:47:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 8 ms.
[2025-06-02 23:47:08] [INFO ] Time to serialize gal into /tmp/CTLFireability8055757439747976853.gal : 5 ms
[2025-06-02 23:47:08] [INFO ] Time to serialize properties into /tmp/CTLFireability14152844775311097481.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/CTLFireability8055757439747976853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14152844775311097481.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 : 452/452 places, 858/858 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 428 transition count 766
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 428 transition count 766
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 428 transition count 765
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 414 transition count 742
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 414 transition count 742
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 414 transition count 740
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 84 place count 409 transition count 728
Iterating global reduction 2 with 5 rules applied. Total rules applied 89 place count 409 transition count 728
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 406 transition count 721
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 406 transition count 721
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 403 transition count 713
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 403 transition count 713
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 400 transition count 706
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 400 transition count 706
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 397 transition count 699
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 397 transition count 699
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 116 place count 394 transition count 692
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 394 transition count 692
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 391 transition count 686
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 391 transition count 686
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 389 transition count 681
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 389 transition count 681
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 387 transition count 676
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 387 transition count 676
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 385 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 385 transition count 672
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 383 transition count 668
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 383 transition count 668
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 381 transition count 665
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 381 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 380 transition count 664
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 380 transition count 664
Applied a total of 147 rules in 109 ms. Remains 380 /452 variables (removed 72) and now considering 664/858 (removed 194) transitions.
// Phase 1: matrix 664 rows 380 cols
[2025-06-02 23:47:38] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:47:38] [INFO ] Implicit Places using invariants in 411 ms returned []
[2025-06-02 23:47:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:47:39] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
Running 663 sub problems to find dead transitions.
[2025-06-02 23:47: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/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:04] [INFO ] Deduced a trap composed of 215 places in 598 ms of which 188 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:04] [INFO ] Deduced a trap composed of 44 places in 433 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:05] [INFO ] Deduced a trap composed of 218 places in 446 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:05] [INFO ] Deduced a trap composed of 215 places in 462 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:06] [INFO ] Deduced a trap composed of 76 places in 435 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:07] [INFO ] Deduced a trap composed of 77 places in 444 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:07] [INFO ] Deduced a trap composed of 222 places in 448 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:07] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:09] [INFO ] Deduced a trap composed of 222 places in 453 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:09] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1044 variables, and 20 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/380 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:19] [INFO ] Deduced a trap composed of 215 places in 482 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:20] [INFO ] Deduced a trap composed of 78 places in 387 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:20] [INFO ] Deduced a trap composed of 91 places in 450 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:21] [INFO ] Deduced a trap composed of 220 places in 478 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:24] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:24] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:25] [INFO ] Deduced a trap composed of 222 places in 443 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:26] [INFO ] Deduced a trap composed of 216 places in 449 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:27] [INFO ] Deduced a trap composed of 217 places in 459 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:27] [INFO ] Deduced a trap composed of 217 places in 452 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:27] [INFO ] Deduced a trap composed of 79 places in 426 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:29] [INFO ] Deduced a trap composed of 57 places in 439 ms of which 64 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:36] [INFO ] Deduced a trap composed of 92 places in 444 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:36] [INFO ] Deduced a trap composed of 216 places in 466 ms of which 94 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1044 variables, and 34 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/380 constraints, PredecessorRefiner: 0/663 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60235ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in LTL mode, iteration 1 : 380/452 places, 664/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61758 ms. Remains : 380/452 places, 664/858 transitions.
[2025-06-02 23:48:40] [INFO ] Flatten gal took : 25 ms
[2025-06-02 23:48:40] [INFO ] Flatten gal took : 27 ms
[2025-06-02 23:48:40] [INFO ] Input system was already deterministic with 664 transitions.
[2025-06-02 23:48:40] [INFO ] Flatten gal took : 27 ms
[2025-06-02 23:48:40] [INFO ] Flatten gal took : 27 ms
[2025-06-02 23:48:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11772425635775268849.gal : 5 ms
[2025-06-02 23:48:40] [INFO ] Time to serialize properties into /tmp/CTLFireability16926501105227021057.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/CTLFireability11772425635775268849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16926501105227021057.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 23:49:10] [INFO ] Flatten gal took : 15 ms
[2025-06-02 23:49:10] [INFO ] Applying decomposition
[2025-06-02 23:49:10] [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/graph9016359058806165565.txt' '-o' '/tmp/graph9016359058806165565.bin' '-w' '/tmp/graph9016359058806165565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9016359058806165565.bin' '-l' '-1' '-v' '-w' '/tmp/graph9016359058806165565.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:49:10] [INFO ] Decomposing Gal with order
[2025-06-02 23:49:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:49:10] [INFO ] Removed a total of 776 redundant transitions.
[2025-06-02 23:49:10] [INFO ] Flatten gal took : 45 ms
[2025-06-02 23:49:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 17 ms.
[2025-06-02 23:49:10] [INFO ] Time to serialize gal into /tmp/CTLFireability6686790262840695265.gal : 7 ms
[2025-06-02 23:49:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7435869198110403542.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/CTLFireability6686790262840695265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7435869198110403542.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.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 858/858 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 432 transition count 829
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 432 transition count 829
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 419 transition count 809
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 419 transition count 809
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 419 transition count 806
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 415 transition count 797
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 415 transition count 797
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 413 transition count 792
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 413 transition count 792
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 411 transition count 787
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 411 transition count 787
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 409 transition count 782
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 409 transition count 782
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 407 transition count 777
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 407 transition count 777
Applied a total of 93 rules in 41 ms. Remains 407 /452 variables (removed 45) and now considering 777/858 (removed 81) transitions.
// Phase 1: matrix 777 rows 407 cols
[2025-06-02 23:49:40] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:49:41] [INFO ] Implicit Places using invariants in 338 ms returned []
[2025-06-02 23:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:49:42] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
Running 776 sub problems to find dead transitions.
[2025-06-02 23:49: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/406 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 776 unsolved
At refinement iteration 1 (OVERLAPS) 1/407 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 776 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:11] [INFO ] Deduced a trap composed of 216 places in 624 ms of which 191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:12] [INFO ] Deduced a trap composed of 47 places in 469 ms of which 38 ms to minimize.
SMT process timed out in 30395ms, After SMT, problems are : Problem set: 0 solved, 776 unsolved
Search for dead transitions found 0 dead transitions in 30397ms
Starting structural reductions in LTL mode, iteration 1 : 407/452 places, 777/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31733 ms. Remains : 407/452 places, 777/858 transitions.
[2025-06-02 23:50:12] [INFO ] Flatten gal took : 27 ms
[2025-06-02 23:50:12] [INFO ] Flatten gal took : 30 ms
[2025-06-02 23:50:12] [INFO ] Input system was already deterministic with 777 transitions.
[2025-06-02 23:50:12] [INFO ] Flatten gal took : 29 ms
[2025-06-02 23:50:12] [INFO ] Flatten gal took : 30 ms
[2025-06-02 23:50:12] [INFO ] Time to serialize gal into /tmp/CTLFireability3115753748634813470.gal : 5 ms
[2025-06-02 23:50:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9728594700671941525.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/CTLFireability3115753748634813470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9728594700671941525.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 23:50:42] [INFO ] Flatten gal took : 19 ms
[2025-06-02 23:50:42] [INFO ] Applying decomposition
[2025-06-02 23:50:42] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11221724540950813974.txt' '-o' '/tmp/graph11221724540950813974.bin' '-w' '/tmp/graph11221724540950813974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11221724540950813974.bin' '-l' '-1' '-v' '-w' '/tmp/graph11221724540950813974.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:50:42] [INFO ] Decomposing Gal with order
[2025-06-02 23:50:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:50:42] [INFO ] Removed a total of 905 redundant transitions.
[2025-06-02 23:50:42] [INFO ] Flatten gal took : 31 ms
[2025-06-02 23:50:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 7 ms.
[2025-06-02 23:50:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5756722413113056796.gal : 5 ms
[2025-06-02 23:50:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5586857202700621154.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/CTLFireability5756722413113056796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5586857202700621154.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 452/452 places, 858/858 transitions.
Graph (trivial) has 314 edges and 452 vertex of which 11 / 452 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 443 transition count 794
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 115 place count 389 transition count 788
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 386 transition count 788
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 118 place count 386 transition count 756
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 182 place count 354 transition count 756
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 202 place count 334 transition count 666
Iterating global reduction 3 with 20 rules applied. Total rules applied 222 place count 334 transition count 666
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 224 place count 334 transition count 664
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 224 place count 334 transition count 658
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 236 place count 328 transition count 658
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 247 place count 317 transition count 641
Iterating global reduction 4 with 11 rules applied. Total rules applied 258 place count 317 transition count 641
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 4 with 4 rules applied. Total rules applied 262 place count 317 transition count 637
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 264 place count 315 transition count 637
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 269 place count 310 transition count 625
Iterating global reduction 6 with 5 rules applied. Total rules applied 274 place count 310 transition count 625
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 277 place count 307 transition count 618
Iterating global reduction 6 with 3 rules applied. Total rules applied 280 place count 307 transition count 618
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 283 place count 304 transition count 610
Iterating global reduction 6 with 3 rules applied. Total rules applied 286 place count 304 transition count 610
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 289 place count 301 transition count 603
Iterating global reduction 6 with 3 rules applied. Total rules applied 292 place count 301 transition count 603
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 295 place count 298 transition count 596
Iterating global reduction 6 with 3 rules applied. Total rules applied 298 place count 298 transition count 596
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 301 place count 295 transition count 589
Iterating global reduction 6 with 3 rules applied. Total rules applied 304 place count 295 transition count 589
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 306 place count 293 transition count 584
Iterating global reduction 6 with 2 rules applied. Total rules applied 308 place count 293 transition count 584
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 310 place count 291 transition count 579
Iterating global reduction 6 with 2 rules applied. Total rules applied 312 place count 291 transition count 579
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 314 place count 289 transition count 574
Iterating global reduction 6 with 2 rules applied. Total rules applied 316 place count 289 transition count 574
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 318 place count 287 transition count 570
Iterating global reduction 6 with 2 rules applied. Total rules applied 320 place count 287 transition count 570
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 322 place count 285 transition count 566
Iterating global reduction 6 with 2 rules applied. Total rules applied 324 place count 285 transition count 566
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 325 place count 284 transition count 564
Iterating global reduction 6 with 1 rules applied. Total rules applied 326 place count 284 transition count 564
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 368 place count 263 transition count 543
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 370 place count 261 transition count 539
Iterating global reduction 6 with 2 rules applied. Total rules applied 372 place count 261 transition count 539
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 261 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 374 place count 260 transition count 538
Applied a total of 374 rules in 168 ms. Remains 260 /452 variables (removed 192) and now considering 538/858 (removed 320) transitions.
[2025-06-02 23:51:13] [INFO ] Flow matrix only has 533 transitions (discarded 5 similar events)
// Phase 1: matrix 533 rows 260 cols
[2025-06-02 23:51:13] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:13] [INFO ] Implicit Places using invariants in 399 ms returned []
[2025-06-02 23:51:13] [INFO ] Flow matrix only has 533 transitions (discarded 5 similar events)
[2025-06-02 23:51:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-02 23:51:14] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:51:14] [INFO ] Redundant transitions in 5 ms returned []
Running 524 sub problems to find dead transitions.
[2025-06-02 23:51:14] [INFO ] Flow matrix only has 533 transitions (discarded 5 similar events)
[2025-06-02 23:51:14] [INFO ] Invariant cache hit.
[2025-06-02 23:51:14] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:19] [INFO ] Deduced a trap composed of 54 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 23:51:20] [INFO ] Deduced a trap composed of 57 places in 333 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:21] [INFO ] Deduced a trap composed of 72 places in 326 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:21] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:21] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:22] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:23] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:25] [INFO ] Deduced a trap composed of 156 places in 334 ms of which 38 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (OVERLAPS) 1/257 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:42] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 257/793 variables, and 19 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/260 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (OVERLAPS) 1/257 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 532/789 variables, 257/276 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/789 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 524/803 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 789/793 variables, and 803 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 257/260 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in SI_CTL mode, iteration 1 : 260/452 places, 538/858 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61300 ms. Remains : 260/452 places, 538/858 transitions.
[2025-06-02 23:52:14] [INFO ] Flatten gal took : 19 ms
[2025-06-02 23:52:14] [INFO ] Flatten gal took : 20 ms
[2025-06-02 23:52:14] [INFO ] Input system was already deterministic with 538 transitions.
[2025-06-02 23:52:14] [INFO ] Flatten gal took : 21 ms
[2025-06-02 23:52:14] [INFO ] Flatten gal took : 21 ms
[2025-06-02 23:52:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17134228288922423818.gal : 4 ms
[2025-06-02 23:52:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1719063033390684015.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/CTLFireability17134228288922423818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1719063033390684015.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 23:52:44] [INFO ] Flatten gal took : 13 ms
[2025-06-02 23:52:44] [INFO ] Applying decomposition
[2025-06-02 23:52:44] [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/graph6446809970206841417.txt' '-o' '/tmp/graph6446809970206841417.bin' '-w' '/tmp/graph6446809970206841417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6446809970206841417.bin' '-l' '-1' '-v' '-w' '/tmp/graph6446809970206841417.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:52:44] [INFO ] Decomposing Gal with order
[2025-06-02 23:52:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:52:44] [INFO ] Removed a total of 709 redundant transitions.
[2025-06-02 23:52:44] [INFO ] Flatten gal took : 37 ms
[2025-06-02 23:52:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 9 ms.
[2025-06-02 23:52:44] [INFO ] Time to serialize gal into /tmp/CTLFireability9701271055032315066.gal : 5 ms
[2025-06-02 23:52:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14574892466076133563.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/CTLFireability9701271055032315066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14574892466076133563.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 : 452/452 places, 858/858 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 428 transition count 736
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 428 transition count 736
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 428 transition count 735
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 61 place count 416 transition count 717
Iterating global reduction 1 with 12 rules applied. Total rules applied 73 place count 416 transition count 717
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 76 place count 416 transition count 714
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 413 transition count 706
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 413 transition count 706
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 411 transition count 702
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 411 transition count 702
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 409 transition count 696
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 409 transition count 696
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 407 transition count 692
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 407 transition count 692
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 405 transition count 687
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 405 transition count 687
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 403 transition count 683
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 403 transition count 683
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 401 transition count 679
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 401 transition count 679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 400 transition count 677
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 400 transition count 677
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 399 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 399 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 398 transition count 672
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 398 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 397 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 397 transition count 670
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 396 transition count 668
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 396 transition count 668
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 395 transition count 667
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 395 transition count 667
Applied a total of 118 rules in 84 ms. Remains 395 /452 variables (removed 57) and now considering 667/858 (removed 191) transitions.
// Phase 1: matrix 667 rows 395 cols
[2025-06-02 23:53:14] [INFO ] Computed 10 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:53:14] [INFO ] Implicit Places using invariants in 328 ms returned []
[2025-06-02 23:53:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:53:15] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
Running 666 sub problems to find dead transitions.
[2025-06-02 23:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:41] [INFO ] Deduced a trap composed of 221 places in 370 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:41] [INFO ] Deduced a trap composed of 43 places in 371 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:42] [INFO ] Deduced a trap composed of 225 places in 523 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:42] [INFO ] Deduced a trap composed of 233 places in 454 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:43] [INFO ] Deduced a trap composed of 242 places in 481 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:44] [INFO ] Deduced a trap composed of 83 places in 478 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:44] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:45] [INFO ] Deduced a trap composed of 225 places in 503 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:45] [INFO ] Deduced a trap composed of 230 places in 526 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:45] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 395/1062 variables, and 20 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/395 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:56] [INFO ] Deduced a trap composed of 79 places in 314 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:56] [INFO ] Deduced a trap composed of 228 places in 498 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:57] [INFO ] Deduced a trap composed of 79 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 23:53:58] [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 23:54:00] [INFO ] Deduced a trap composed of 230 places in 501 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:00] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:01] [INFO ] Deduced a trap composed of 226 places in 505 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:02] [INFO ] Deduced a trap composed of 81 places in 462 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:02] [INFO ] Deduced a trap composed of 227 places in 452 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:03] [INFO ] Deduced a trap composed of 81 places in 418 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:03] [INFO ] Deduced a trap composed of 227 places in 393 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:03] [INFO ] Deduced a trap composed of 227 places in 375 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:04] [INFO ] Deduced a trap composed of 227 places in 494 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:05] [INFO ] Deduced a trap composed of 56 places in 478 ms of which 81 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/1062 variables, and 34 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/395 constraints, PredecessorRefiner: 0/666 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Starting structural reductions in LTL mode, iteration 1 : 395/452 places, 667/858 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61642 ms. Remains : 395/452 places, 667/858 transitions.
[2025-06-02 23:54:16] [INFO ] Flatten gal took : 25 ms
[2025-06-02 23:54:16] [INFO ] Flatten gal took : 27 ms
[2025-06-02 23:54:16] [INFO ] Input system was already deterministic with 667 transitions.
[2025-06-02 23:54:16] [INFO ] Flatten gal took : 26 ms
[2025-06-02 23:54:16] [INFO ] Flatten gal took : 26 ms
[2025-06-02 23:54:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14061017701312169624.gal : 5 ms
[2025-06-02 23:54:16] [INFO ] Time to serialize properties into /tmp/CTLFireability2139398376706451472.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/CTLFireability14061017701312169624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2139398376706451472.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 23:54:46] [INFO ] Flatten gal took : 15 ms
[2025-06-02 23:54:46] [INFO ] Applying decomposition
[2025-06-02 23:54:46] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16389956522677602800.txt' '-o' '/tmp/graph16389956522677602800.bin' '-w' '/tmp/graph16389956522677602800.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16389956522677602800.bin' '-l' '-1' '-v' '-w' '/tmp/graph16389956522677602800.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:54:46] [INFO ] Decomposing Gal with order
[2025-06-02 23:54:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:54:46] [INFO ] Removed a total of 727 redundant transitions.
[2025-06-02 23:54:46] [INFO ] Flatten gal took : 41 ms
[2025-06-02 23:54:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 10 ms.
[2025-06-02 23:54:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10619694994812880728.gal : 9 ms
[2025-06-02 23:54:46] [INFO ] Time to serialize properties into /tmp/CTLFireability10801987434642058578.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/CTLFireability10619694994812880728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10801987434642058578.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.
[2025-06-02 23:55:16] [INFO ] Flatten gal took : 21 ms
[2025-06-02 23:55:16] [INFO ] Flatten gal took : 22 ms
[2025-06-02 23:55:16] [INFO ] Applying decomposition
[2025-06-02 23:55:16] [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/graph4608306203700099924.txt' '-o' '/tmp/graph4608306203700099924.bin' '-w' '/tmp/graph4608306203700099924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4608306203700099924.bin' '-l' '-1' '-v' '-w' '/tmp/graph4608306203700099924.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:55:16] [INFO ] Decomposing Gal with order
[2025-06-02 23:55:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:55:16] [INFO ] Removed a total of 991 redundant transitions.
[2025-06-02 23:55:16] [INFO ] Flatten gal took : 38 ms
[2025-06-02 23:55:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 7 ms.
[2025-06-02 23:55:16] [INFO ] Time to serialize gal into /tmp/CTLFireability930105407092921088.gal : 5 ms
[2025-06-02 23:55:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14237618600596257997.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/CTLFireability930105407092921088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14237618600596257997.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 15 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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-20"
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-20, 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-174860102400394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 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 '
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 ;