Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700282.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 PolyORBLF-COL-S02J04T10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T10-CTLFireability-2025-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748911090713

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202505121319
[2025-06-03 00:38:11] [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-03 00:38:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 00:38:12] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 00:38:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 00:38:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 715 ms
[2025-06-03 00:38:12] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2025-06-03 00:38:12] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2025-06-03 00:38:12] [INFO ] Skeletonized 13 HLPN properties in 2 ms. Removed 3 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (12 resets) in 1570 ms. (25 steps per ms) remains 16/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 125 ms. (31 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4001 steps (10 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (10 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (9 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
[2025-06-03 00:38:13] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 00:38:13] [INFO ] Computed 26 invariants in 12 ms
[2025-06-03 00:38:13] [INFO ] State equation strengthened by 8 read => feed constraints.
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/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 3 (OVERLAPS) 23/62 variables, 7/9 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/64 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 8 (OVERLAPS) 14/78 variables, 10/23 constraints. Problems are: Problem set: 11 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:14] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:14] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 2/25 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/81 variables, 2/28 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/81 variables, 0/28 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 64/145 variables, 81/109 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 8/117 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 11 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 117 constraints, problems are : Problem set: 11 solved, 4 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/78 variables, 3/24 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 4/116 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/145 variables, 2/118 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 1/119 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 2/121 constraints. Problems are: Problem set: 11 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:15] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:15] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:15] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 6 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 3/124 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/145 variables, 0/124 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/145 variables, 0/124 constraints. Problems are: Problem set: 11 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 124 constraints, problems are : Problem set: 11 solved, 4 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/15 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1601ms problems are : Problem set: 11 solved, 4 unsolved
Parikh walk visited 0 properties in 1324 ms.
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 30 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2025-06-03 00:38:16] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2025-06-03 00:38:16] [INFO ] Computed 25 invariants in 2 ms
[2025-06-03 00:38:16] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:17] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:17] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:17] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:17] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:17] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:17] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:17] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 6/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/92 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/100 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:18] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 1/101 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:18] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/104 variables, 1/102 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:18] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/104 variables, 1/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 15 (OVERLAPS) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 103 constraints, problems are : Problem set: 2 solved, 42 unsolved in 2739 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/29 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/95 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 42/145 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:20] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:20] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:20] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 3/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:20] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 1/149 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/104 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 149 constraints, problems are : Problem set: 2 solved, 42 unsolved in 3281 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6042ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 6044ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/81 places, 43/65 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 0 places and 2 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6091 ms. Remains : 60/81 places, 39/65 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Successfully simplified 15 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 00:38:22] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-03 00:38:22] [INFO ] Flatten gal took : 30 ms
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 00:38:22] [INFO ] Flatten gal took : 22 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-03 00:38:22] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 79 ms.
[2025-06-03 00:38:22] [INFO ] Unfolded 13 HLPN properties in 1 ms.
[2025-06-03 00:38:22] [INFO ] Reduced 110 identical enabling conditions.
[2025-06-03 00:38:22] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-03 00:38:22] [INFO ] Reduced 110 identical enabling conditions.
[2025-06-03 00:38:22] [INFO ] Reduced 40 identical enabling conditions.
[2025-06-03 00:38:22] [INFO ] Reduced 110 identical enabling conditions.
[2025-06-03 00:38:22] [INFO ] Reduced 40 identical enabling conditions.
[2025-06-03 00:38:22] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 670 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 26 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2025-06-03 00:38:23] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2025-06-03 00:38:23] [INFO ] Computed 54 invariants in 55 ms
[2025-06-03 00:38:23] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:43] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:43] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:43] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:43] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:43] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:43] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:43] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:43] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:43] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:38:44] [INFO ] Deduced a trap composed of 353 places in 440 ms of which 133 ms to minimize.
SMT process timed out in 21573ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 21587ms
[2025-06-03 00:38:44] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 00:38:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:38:44] [INFO ] Implicit Places using invariants in 260 ms returned []
[2025-06-03 00:38:44] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 00:38:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:38:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 00:38:47] [INFO ] Implicit Places using invariants and state equation in 2403 ms returned []
Implicit Place search using SMT with State Equation took 2690 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2025-06-03 00:38:47] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 00:38:47] [INFO ] Invariant cache hit.
[2025-06-03 00:38:47] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:09] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:09] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:14] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:15] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:15] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:15] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:15] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:15] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:15] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:16] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:18] [INFO ] Deduced a trap composed of 333 places in 479 ms of which 183 ms to minimize.
SMT process timed out in 31424ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 31427ms
Finished structural reductions in LTL mode , in 1 iterations and 55754 ms. Remains : 752/752 places, 1412/1412 transitions.
Support contains 670 out of 752 places after structural reductions.
[2025-06-03 00:39:19] [INFO ] Flatten gal took : 260 ms
[2025-06-03 00:39:19] [INFO ] Flatten gal took : 137 ms
[2025-06-03 00:39:20] [INFO ] Input system was already deterministic with 1412 transitions.
Reduction of identical properties reduced properties to check from 67 to 64
RANDOM walk for 40000 steps (11 resets) in 3806 ms. (10 steps per ms) remains 19/64 properties
BEST_FIRST walk for 4001 steps (8 resets) in 180 ms. (22 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 133 ms. (29 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 185 ms. (21 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 228 ms. (17 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 126 ms. (31 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 102 ms. (38 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 121 ms. (32 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 109 ms. (36 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 108 ms. (36 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 143 ms. (27 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 125 ms. (31 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 138 ms. (28 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 120 ms. (33 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 128 ms. (31 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 126 ms. (31 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 134 ms. (29 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 102 ms. (38 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 103 ms. (38 steps per ms) remains 19/19 properties
[2025-06-03 00:39:22] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 00:39:22] [INFO ] Invariant cache hit.
[2025-06-03 00:39:22] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/435 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp59 is UNSAT
At refinement iteration 3 (OVERLAPS) 185/620 variables, 13/26 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/620 variables, 11/37 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 6 (OVERLAPS) 131/751 variables, 16/53 constraints. Problems are: Problem set: 9 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/2144 variables, and 53 constraints, problems are : Problem set: 9 solved, 10 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 19/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 186/518 variables, 12/13 constraints. Problems are: Problem set: 9 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 10/23 constraints. Problems are: Problem set: 9 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/23 constraints. Problems are: Problem set: 9 solved, 10 unsolved
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 5 (OVERLAPS) 232/750 variables, 29/52 constraints. Problems are: Problem set: 11 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:31] [INFO ] Deduced a trap composed of 65 places in 454 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:31] [INFO ] Deduced a trap composed of 65 places in 441 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:32] [INFO ] Deduced a trap composed of 65 places in 558 ms of which 108 ms to minimize.
SMT process timed out in 10182ms, After SMT, problems are : Problem set: 11 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 277 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 750 transition count 1392
Reduce places removed 20 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 40 rules applied. Total rules applied 62 place count 730 transition count 1372
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 82 place count 710 transition count 1372
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 82 place count 710 transition count 1332
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 162 place count 670 transition count 1332
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 18 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 222 place count 640 transition count 1302
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 232 place count 640 transition count 1302
Applied a total of 232 rules in 257 ms. Remains 640 /752 variables (removed 112) and now considering 1302/1412 (removed 110) transitions.
Running 1300 sub problems to find dead transitions.
[2025-06-03 00:39:32] [INFO ] Flow matrix only has 1282 transitions (discarded 20 similar events)
// Phase 1: matrix 1282 rows 640 cols
[2025-06-03 00:39:32] [INFO ] Computed 52 invariants in 63 ms
[2025-06-03 00:39:32] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:48] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:49] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:50] [INFO ] Deduced a trap composed of 263 places in 379 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:50] [INFO ] Deduced a trap composed of 273 places in 353 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:51] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:51] [INFO ] Deduced a trap composed of 253 places in 366 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:39:53] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/1922 variables, and 65 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/640 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/638 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:04] [INFO ] Deduced a trap composed of 411 places in 416 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:05] [INFO ] Deduced a trap composed of 277 places in 405 ms of which 151 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 638/1922 variables, and 67 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/640 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41055ms problems are : Problem set: 0 solved, 1300 unsolved
Search for dead transitions found 0 dead transitions in 41058ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41338 ms. Remains : 640/752 places, 1302/1412 transitions.
RANDOM walk for 40000 steps (11 resets) in 1213 ms. (32 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 933 ms. (42 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 661 ms. (60 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (10 resets) in 534 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 559 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 708 ms. (56 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 510 ms. (78 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 556 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 522 ms. (76 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 207869 steps, run timeout after 6001 ms. (steps per millisecond=34 ) properties seen :0 out of 8
Probabilistic random walk after 207869 steps, saw 120657 distinct states, run finished after 6005 ms. (steps per millisecond=34 ) properties seen :0
[2025-06-03 00:40:21] [INFO ] Flow matrix only has 1282 transitions (discarded 20 similar events)
[2025-06-03 00:40:21] [INFO ] Invariant cache hit.
[2025-06-03 00:40:21] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 131/408 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 5 (OVERLAPS) 225/633 variables, 36/45 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/633 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 7 (OVERLAPS) 4/637 variables, 4/49 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/49 constraints. Problems are: Problem set: 4 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/640 variables, 3/52 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/640 variables, 0/52 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1282/1922 variables, 640/692 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1922 variables, 120/812 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1922 variables, 0/812 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1922 variables, 0/812 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1922/1922 variables, and 812 constraints, problems are : Problem set: 4 solved, 4 unsolved in 31564 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 640/640 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 186/218 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 387/605 variables, 25/28 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:54] [INFO ] Deduced a trap composed of 54 places in 338 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:54] [INFO ] Deduced a trap composed of 54 places in 321 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:54] [INFO ] Deduced a trap composed of 54 places in 316 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:55] [INFO ] Deduced a trap composed of 54 places in 316 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:55] [INFO ] Deduced a trap composed of 54 places in 329 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:56] [INFO ] Deduced a trap composed of 54 places in 316 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:56] [INFO ] Deduced a trap composed of 54 places in 307 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:56] [INFO ] Deduced a trap composed of 54 places in 315 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:57] [INFO ] Deduced a trap composed of 54 places in 314 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:57] [INFO ] Deduced a trap composed of 311 places in 347 ms of which 92 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 10/38 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/38 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 19/624 variables, 9/47 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:58] [INFO ] Deduced a trap composed of 321 places in 356 ms of which 98 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/624 variables, 1/48 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 0/48 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 14/638 variables, 14/62 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:40:58] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 1/63 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/638 variables, 0/63 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1282/1920 variables, 638/701 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1920 variables, 120/821 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1920 variables, 4/825 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1920 variables, 0/825 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/1922 variables, 2/827 constraints. Problems are: Problem set: 4 solved, 4 unsolved
SMT process timed out in 76611ms, After SMT, problems are : Problem set: 4 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3537 ms.
Support contains 32 out of 640 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 640/640 places, 1302/1302 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 640 transition count 1272
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 610 transition count 1272
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 60 place count 610 transition count 1222
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 160 place count 560 transition count 1222
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 260 place count 510 transition count 1172
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 280 place count 510 transition count 1152
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 300 place count 490 transition count 1152
Applied a total of 300 rules in 82 ms. Remains 490 /640 variables (removed 150) and now considering 1152/1302 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 490/640 places, 1152/1302 transitions.
Successfully simplified 15 atomic propositions for a total of 13 simplifications.
[2025-06-03 00:41:42] [INFO ] Flatten gal took : 69 ms
[2025-06-03 00:41:42] [INFO ] Flatten gal took : 78 ms
[2025-06-03 00:41:42] [INFO ] Input system was already deterministic with 1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 19 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2025-06-03 00:41:42] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2025-06-03 00:41:42] [INFO ] Computed 54 invariants in 53 ms
[2025-06-03 00:41:42] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:02] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:02] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:02] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:02] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:02] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:02] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:02] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:03] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:03] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:42:03] [INFO ] Deduced a trap composed of 353 places in 416 ms of which 133 ms to minimize.
SMT process timed out in 21175ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 21179ms
[2025-06-03 00:42:03] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 00:42:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:42:04] [INFO ] Implicit Places using invariants in 464 ms returned [576, 577, 578, 579, 580, 581, 582, 583, 584, 585]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 467 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 742/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 8 ms. Remains 742 /742 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21676 ms. Remains : 742/752 places, 1412/1412 transitions.
[2025-06-03 00:42:04] [INFO ] Flatten gal took : 54 ms
[2025-06-03 00:42:04] [INFO ] Flatten gal took : 56 ms
[2025-06-03 00:42:04] [INFO ] Input system was already deterministic with 1412 transitions.
[2025-06-03 00:42:04] [INFO ] Flatten gal took : 53 ms
[2025-06-03 00:42:04] [INFO ] Flatten gal took : 53 ms
[2025-06-03 00:42:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13660354752596332319.gal : 31 ms
[2025-06-03 00:42:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17076125833925162977.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13660354752596332319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17076125833925162977.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-03 00:42:34] [INFO ] Flatten gal took : 46 ms
[2025-06-03 00:42:34] [INFO ] Applying decomposition
[2025-06-03 00:42:34] [INFO ] Flatten gal took : 46 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/graph6792404988046103828.txt' '-o' '/tmp/graph6792404988046103828.bin' '-w' '/tmp/graph6792404988046103828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6792404988046103828.bin' '-l' '-1' '-v' '-w' '/tmp/graph6792404988046103828.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:42:35] [INFO ] Decomposing Gal with order
[2025-06-03 00:42:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:42:36] [INFO ] Removed a total of 1219 redundant transitions.
[2025-06-03 00:42:36] [INFO ] Flatten gal took : 686 ms
[2025-06-03 00:42:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 313 labels/synchronizations in 75 ms.
[2025-06-03 00:42:36] [INFO ] Time to serialize gal into /tmp/CTLFireability5225180427358781342.gal : 47 ms
[2025-06-03 00:42:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12695333347210256318.ctl : 10 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/CTLFireability5225180427358781342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12695333347210256318.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 38 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 00:43:06] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2025-06-03 00:43:06] [INFO ] Computed 52 invariants in 23 ms
[2025-06-03 00:43:06] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:26] [INFO ] Deduced a trap composed of 63 places in 146 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:26] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:26] [INFO ] Deduced a trap composed of 63 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-03 00:43:27] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:27] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:27] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:27] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:27] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:27] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:31] [INFO ] Deduced a trap composed of 142 places in 393 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:31] [INFO ] Deduced a trap composed of 197 places in 393 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:31] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:32] [INFO ] Deduced a trap composed of 312 places in 430 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:33] [INFO ] Deduced a trap composed of 402 places in 441 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:44] [INFO ] Deduced a trap composed of 490 places in 489 ms of which 205 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:43:45] [INFO ] Deduced a trap composed of 357 places in 476 ms of which 181 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 66 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41061ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41065ms
[2025-06-03 00:43:47] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 00:43:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:43:48] [INFO ] Implicit Places using invariants in 774 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 786 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 14 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41907 ms. Remains : 720/752 places, 1392/1412 transitions.
[2025-06-03 00:43:48] [INFO ] Flatten gal took : 41 ms
[2025-06-03 00:43:48] [INFO ] Flatten gal took : 46 ms
[2025-06-03 00:43:48] [INFO ] Input system was already deterministic with 1392 transitions.
[2025-06-03 00:43:48] [INFO ] Flatten gal took : 42 ms
[2025-06-03 00:43:48] [INFO ] Flatten gal took : 45 ms
[2025-06-03 00:43:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16320518400765861979.gal : 7 ms
[2025-06-03 00:43:49] [INFO ] Time to serialize properties into /tmp/CTLFireability467461920937919186.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/CTLFireability16320518400765861979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability467461920937919186.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-03 00:44:19] [INFO ] Flatten gal took : 41 ms
[2025-06-03 00:44:19] [INFO ] Applying decomposition
[2025-06-03 00:44:19] [INFO ] Flatten gal took : 40 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/graph9603420997774762055.txt' '-o' '/tmp/graph9603420997774762055.bin' '-w' '/tmp/graph9603420997774762055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9603420997774762055.bin' '-l' '-1' '-v' '-w' '/tmp/graph9603420997774762055.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:44:19] [INFO ] Decomposing Gal with order
[2025-06-03 00:44:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:44:19] [INFO ] Removed a total of 1218 redundant transitions.
[2025-06-03 00:44:19] [INFO ] Flatten gal took : 125 ms
[2025-06-03 00:44:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 360 labels/synchronizations in 52 ms.
[2025-06-03 00:44:19] [INFO ] Time to serialize gal into /tmp/CTLFireability18354815497653547238.gal : 12 ms
[2025-06-03 00:44:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10600242259183901173.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/CTLFireability18354815497653547238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10600242259183901173.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 61 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 00:44:49] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 00:44:49] [INFO ] Invariant cache hit.
[2025-06-03 00:44:49] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:10] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:10] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:10] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:10] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:10] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:10] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:10] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:10] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 58 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:17] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:17] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:18] [INFO ] Deduced a trap composed of 197 places in 387 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:19] [INFO ] Deduced a trap composed of 312 places in 437 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:45:20] [INFO ] Deduced a trap composed of 362 places in 471 ms of which 181 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 63 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41088ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41100ms
[2025-06-03 00:45:30] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 00:45:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:45:32] [INFO ] Implicit Places using invariants in 1077 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1090 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 11 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42265 ms. Remains : 720/752 places, 1392/1412 transitions.
[2025-06-03 00:45:32] [INFO ] Flatten gal took : 72 ms
[2025-06-03 00:45:32] [INFO ] Flatten gal took : 72 ms
[2025-06-03 00:45:32] [INFO ] Input system was already deterministic with 1392 transitions.
[2025-06-03 00:45:32] [INFO ] Flatten gal took : 72 ms
[2025-06-03 00:45:32] [INFO ] Flatten gal took : 86 ms
[2025-06-03 00:45:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13388328563505819870.gal : 6 ms
[2025-06-03 00:45:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6702052746403221257.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/CTLFireability13388328563505819870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6702052746403221257.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-03 00:46:02] [INFO ] Flatten gal took : 39 ms
[2025-06-03 00:46:02] [INFO ] Applying decomposition
[2025-06-03 00:46:02] [INFO ] Flatten gal took : 39 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/graph5537639717339030487.txt' '-o' '/tmp/graph5537639717339030487.bin' '-w' '/tmp/graph5537639717339030487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5537639717339030487.bin' '-l' '-1' '-v' '-w' '/tmp/graph5537639717339030487.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:46:02] [INFO ] Decomposing Gal with order
[2025-06-03 00:46:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:46:03] [INFO ] Removed a total of 1276 redundant transitions.
[2025-06-03 00:46:03] [INFO ] Flatten gal took : 231 ms
[2025-06-03 00:46:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 29 ms.
[2025-06-03 00:46:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8222218046710398577.gal : 13 ms
[2025-06-03 00:46:03] [INFO ] Time to serialize properties into /tmp/CTLFireability4240125071719504823.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/CTLFireability8222218046710398577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4240125071719504823.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Applied a total of 22 rules in 30 ms. Remains 740 /752 variables (removed 12) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2025-06-03 00:46:33] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 740 cols
[2025-06-03 00:46:33] [INFO ] Computed 52 invariants in 17 ms
[2025-06-03 00:46:33] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:53] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:53] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:53] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:53] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:53] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:53] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:53] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:54] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:54] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.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 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 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 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)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.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 9.0)
(s203 0.0)
(s204 1.0)
(s205 1.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)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.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 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.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)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 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 738/2122 variables, and 59 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:58] [INFO ] Deduced a trap composed of 152 places in 425 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:59] [INFO ] Deduced a trap composed of 64 places in 363 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:46:59] [INFO ] Deduced a trap composed of 207 places in 423 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:00] [INFO ] Deduced a trap composed of 322 places in 443 ms of which 166 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:11] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:47:14] [INFO ] Deduced a trap composed of 367 places in 431 ms of which 146 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/2122 variables, and 65 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41014ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 41017ms
[2025-06-03 00:47:14] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:47:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:47:15] [INFO ] Implicit Places using invariants in 816 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 839 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/752 places, 1402/1412 transitions.
Applied a total of 0 rules in 19 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41908 ms. Remains : 730/752 places, 1402/1412 transitions.
[2025-06-03 00:47:15] [INFO ] Flatten gal took : 56 ms
[2025-06-03 00:47:15] [INFO ] Flatten gal took : 43 ms
[2025-06-03 00:47:15] [INFO ] Input system was already deterministic with 1402 transitions.
[2025-06-03 00:47:15] [INFO ] Flatten gal took : 37 ms
[2025-06-03 00:47:15] [INFO ] Flatten gal took : 39 ms
[2025-06-03 00:47:15] [INFO ] Time to serialize gal into /tmp/CTLFireability13952773319591461990.gal : 7 ms
[2025-06-03 00:47:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8312583186061561238.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/CTLFireability13952773319591461990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8312583186061561238.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-03 00:47:45] [INFO ] Flatten gal took : 39 ms
[2025-06-03 00:47:45] [INFO ] Applying decomposition
[2025-06-03 00:47:45] [INFO ] Flatten gal took : 39 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/graph15550163547865052348.txt' '-o' '/tmp/graph15550163547865052348.bin' '-w' '/tmp/graph15550163547865052348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15550163547865052348.bin' '-l' '-1' '-v' '-w' '/tmp/graph15550163547865052348.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:47:46] [INFO ] Decomposing Gal with order
[2025-06-03 00:47:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:47:46] [INFO ] Removed a total of 1314 redundant transitions.
[2025-06-03 00:47:46] [INFO ] Flatten gal took : 90 ms
[2025-06-03 00:47:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 11 ms.
[2025-06-03 00:47:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12598604044932722403.gal : 11 ms
[2025-06-03 00:47:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17111329870241430734.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/CTLFireability12598604044932722403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17111329870241430734.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Applied a total of 2 rules in 11 ms. Remains 750 /752 variables (removed 2) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2025-06-03 00:48:16] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 750 cols
[2025-06-03 00:48:16] [INFO ] Computed 52 invariants in 16 ms
[2025-06-03 00:48:16] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:36] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:36] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:36] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:36] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:36] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:37] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:37] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:37] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2142 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/750 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:41] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:41] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:42] [INFO ] Deduced a trap composed of 217 places in 413 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:43] [INFO ] Deduced a trap composed of 332 places in 430 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:55] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:56] [INFO ] Deduced a trap composed of 353 places in 485 ms of which 181 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:48:57] [INFO ] Deduced a trap composed of 377 places in 468 ms of which 162 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(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 1)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(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 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(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)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2142 variables, and 65 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/750 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40966ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 40969ms
[2025-06-03 00:48:57] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 00:48:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:48:58] [INFO ] Implicit Places using invariants in 976 ms returned []
[2025-06-03 00:48:58] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 00:48:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:48:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 00:49:15] [INFO ] Implicit Places using invariants and state equation in 17193 ms returned []
Implicit Place search using SMT with State Equation took 18184 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2025-06-03 00:49:15] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 00:49:15] [INFO ] Invariant cache hit.
[2025-06-03 00:49:15] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:36] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:36] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:36] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:36] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:36] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:36] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:36] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:36] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:37] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:38] [INFO ] Deduced a trap composed of 353 places in 472 ms of which 185 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:38] [INFO ] Deduced a trap composed of 162 places in 421 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:39] [INFO ] Deduced a trap composed of 217 places in 407 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:39] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:41] [INFO ] Deduced a trap composed of 363 places in 488 ms of which 179 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:41] [INFO ] Deduced a trap composed of 333 places in 489 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:42] [INFO ] Deduced a trap composed of 23 places in 347 ms of which 42 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 748/2142 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/750 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:51] [INFO ] Deduced a trap composed of 332 places in 465 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:51] [INFO ] Deduced a trap composed of 422 places in 431 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:04] [INFO ] Deduced a trap composed of 377 places in 442 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:05] [INFO ] Deduced a trap composed of 491 places in 473 ms of which 164 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2142 variables, and 70 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/750 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61015ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 61019ms
Starting structural reductions in LTL mode, iteration 1 : 750/752 places, 1412/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120191 ms. Remains : 750/752 places, 1412/1412 transitions.
[2025-06-03 00:50:16] [INFO ] Flatten gal took : 36 ms
[2025-06-03 00:50:16] [INFO ] Flatten gal took : 38 ms
[2025-06-03 00:50:16] [INFO ] Input system was already deterministic with 1412 transitions.
[2025-06-03 00:50:16] [INFO ] Flatten gal took : 37 ms
[2025-06-03 00:50:16] [INFO ] Flatten gal took : 84 ms
[2025-06-03 00:50:16] [INFO ] Time to serialize gal into /tmp/CTLFireability12943321289825977775.gal : 6 ms
[2025-06-03 00:50:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3157704001285011029.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/CTLFireability12943321289825977775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3157704001285011029.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-03 00:50:46] [INFO ] Flatten gal took : 38 ms
[2025-06-03 00:50:46] [INFO ] Applying decomposition
[2025-06-03 00:50:47] [INFO ] Flatten gal took : 38 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/graph12690536201656681653.txt' '-o' '/tmp/graph12690536201656681653.bin' '-w' '/tmp/graph12690536201656681653.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12690536201656681653.bin' '-l' '-1' '-v' '-w' '/tmp/graph12690536201656681653.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:50:47] [INFO ] Decomposing Gal with order
[2025-06-03 00:50:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:50:47] [INFO ] Removed a total of 990 redundant transitions.
[2025-06-03 00:50:47] [INFO ] Flatten gal took : 89 ms
[2025-06-03 00:50:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 10 ms.
[2025-06-03 00:50:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5821182608156278604.gal : 10 ms
[2025-06-03 00:50:47] [INFO ] Time to serialize properties into /tmp/CTLFireability1536031653046638222.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/CTLFireability5821182608156278604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1536031653046638222.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 30 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 00:51:17] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2025-06-03 00:51:17] [INFO ] Computed 52 invariants in 23 ms
[2025-06-03 00:51:17] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:36] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:36] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:36] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:36] [INFO ] Deduced a trap composed of 63 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-03 00:51:36] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:36] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:36] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:36] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:36] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:37] [INFO ] Deduced a trap composed of 353 places in 451 ms of which 166 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:38] [INFO ] Deduced a trap composed of 197 places in 377 ms of which 126 ms to minimize.
SMT process timed out in 21109ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 21112ms
[2025-06-03 00:51:38] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 00:51:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:51:39] [INFO ] Implicit Places using invariants in 705 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 707 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 10 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21867 ms. Remains : 720/752 places, 1392/1412 transitions.
[2025-06-03 00:51:39] [INFO ] Flatten gal took : 35 ms
[2025-06-03 00:51:39] [INFO ] Flatten gal took : 37 ms
[2025-06-03 00:51:39] [INFO ] Input system was already deterministic with 1392 transitions.
[2025-06-03 00:51:39] [INFO ] Flatten gal took : 37 ms
[2025-06-03 00:51:39] [INFO ] Flatten gal took : 37 ms
[2025-06-03 00:51:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8356248070202837276.gal : 6 ms
[2025-06-03 00:51:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1738494942675245019.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/CTLFireability8356248070202837276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1738494942675245019.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-03 00:52:09] [INFO ] Flatten gal took : 36 ms
[2025-06-03 00:52:09] [INFO ] Applying decomposition
[2025-06-03 00:52:09] [INFO ] Flatten gal took : 36 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/graph3655452254214976219.txt' '-o' '/tmp/graph3655452254214976219.bin' '-w' '/tmp/graph3655452254214976219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3655452254214976219.bin' '-l' '-1' '-v' '-w' '/tmp/graph3655452254214976219.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:52:09] [INFO ] Decomposing Gal with order
[2025-06-03 00:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:52:09] [INFO ] Removed a total of 1230 redundant transitions.
[2025-06-03 00:52:09] [INFO ] Flatten gal took : 76 ms
[2025-06-03 00:52:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 15 ms.
[2025-06-03 00:52:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9599639422282869655.gal : 9 ms
[2025-06-03 00:52:09] [INFO ] Time to serialize properties into /tmp/CTLFireability12432158483900009473.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/CTLFireability9599639422282869655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12432158483900009473.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 750 transition count 1362
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 700 transition count 1362
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 100 place count 700 transition count 1292
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 240 place count 630 transition count 1292
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 340 place count 580 transition count 1242
Applied a total of 340 rules in 88 ms. Remains 580 /752 variables (removed 172) and now considering 1242/1412 (removed 170) transitions.
Running 1240 sub problems to find dead transitions.
[2025-06-03 00:52:39] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 580 cols
[2025-06-03 00:52:40] [INFO ] Computed 52 invariants in 33 ms
[2025-06-03 00:52:40] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:54] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:54] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:54] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:54] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:54] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:54] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:54] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:54] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:54] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:55] [INFO ] Deduced a trap composed of 137 places in 304 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:57] [INFO ] Deduced a trap composed of 233 places in 362 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:57] [INFO ] Deduced a trap composed of 242 places in 361 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:57] [INFO ] Deduced a trap composed of 223 places in 347 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:58] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:59] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1802 variables, and 65 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/580 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/1802 variables, and 65 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/580 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1240 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40976ms problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 40979ms
[2025-06-03 00:53:20] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2025-06-03 00:53:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:22] [INFO ] Implicit Places using invariants in 1192 ms returned [524, 525, 526, 527, 528, 529, 530, 531, 532, 533]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1195 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 570/752 places, 1242/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 560 transition count 1232
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 560 transition count 1232
Applied a total of 20 rules in 32 ms. Remains 560 /570 variables (removed 10) and now considering 1232/1242 (removed 10) transitions.
[2025-06-03 00:53:22] [INFO ] Flow matrix only has 1212 transitions (discarded 20 similar events)
// Phase 1: matrix 1212 rows 560 cols
[2025-06-03 00:53:22] [INFO ] Computed 42 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:23] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2025-06-03 00:53:23] [INFO ] Flow matrix only has 1212 transitions (discarded 20 similar events)
[2025-06-03 00:53:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:53:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 00:53:35] [INFO ] Implicit Places using invariants and state equation in 11945 ms returned []
Implicit Place search using SMT with State Equation took 13182 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 560/752 places, 1232/1412 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 55480 ms. Remains : 560/752 places, 1232/1412 transitions.
[2025-06-03 00:53:35] [INFO ] Flatten gal took : 33 ms
[2025-06-03 00:53:35] [INFO ] Flatten gal took : 36 ms
[2025-06-03 00:53:35] [INFO ] Input system was already deterministic with 1232 transitions.
[2025-06-03 00:53:35] [INFO ] Flatten gal took : 53 ms
[2025-06-03 00:53:35] [INFO ] Flatten gal took : 38 ms
[2025-06-03 00:53:35] [INFO ] Time to serialize gal into /tmp/CTLFireability3688176123058548513.gal : 7 ms
[2025-06-03 00:53:35] [INFO ] Time to serialize properties into /tmp/CTLFireability1354147072864860769.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/CTLFireability3688176123058548513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1354147072864860769.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-03 00:54:05] [INFO ] Flatten gal took : 36 ms
[2025-06-03 00:54:05] [INFO ] Applying decomposition
[2025-06-03 00:54:05] [INFO ] Flatten gal took : 35 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/graph12778161838021391648.txt' '-o' '/tmp/graph12778161838021391648.bin' '-w' '/tmp/graph12778161838021391648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12778161838021391648.bin' '-l' '-1' '-v' '-w' '/tmp/graph12778161838021391648.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:54:05] [INFO ] Decomposing Gal with order
[2025-06-03 00:54:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:54:05] [INFO ] Removed a total of 1129 redundant transitions.
[2025-06-03 00:54:06] [INFO ] Flatten gal took : 71 ms
[2025-06-03 00:54:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 11 ms.
[2025-06-03 00:54:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15525726620170478862.gal : 9 ms
[2025-06-03 00:54:06] [INFO ] Time to serialize properties into /tmp/CTLFireability4516107497610994054.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/CTLFireability15525726620170478862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4516107497610994054.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 25 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 00:54:36] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2025-06-03 00:54:36] [INFO ] Computed 52 invariants in 23 ms
[2025-06-03 00:54:36] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:54] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:54] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:54] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:54] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:54] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:55] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:55] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:55] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:55] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:56] [INFO ] Deduced a trap composed of 353 places in 462 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:56] [INFO ] Deduced a trap composed of 197 places in 412 ms of which 126 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.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 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 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 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 timeout
0.0)
(s160 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 61 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:03] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:04] [INFO ] Deduced a trap composed of 312 places in 431 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:06] [INFO ] Deduced a trap composed of 362 places in 557 ms of which 241 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 64 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41001ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41003ms
[2025-06-03 00:55:17] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 00:55:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:55:17] [INFO ] Implicit Places using invariants in 672 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 676 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 11 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41718 ms. Remains : 720/752 places, 1392/1412 transitions.
[2025-06-03 00:55:17] [INFO ] Flatten gal took : 37 ms
[2025-06-03 00:55:17] [INFO ] Flatten gal took : 46 ms
[2025-06-03 00:55:17] [INFO ] Input system was already deterministic with 1392 transitions.
[2025-06-03 00:55:18] [INFO ] Flatten gal took : 40 ms
[2025-06-03 00:55:18] [INFO ] Flatten gal took : 41 ms
[2025-06-03 00:55:18] [INFO ] Time to serialize gal into /tmp/CTLFireability6209349563084156291.gal : 6 ms
[2025-06-03 00:55:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10378680313027463107.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/CTLFireability6209349563084156291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10378680313027463107.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-03 00:55:48] [INFO ] Flatten gal took : 39 ms
[2025-06-03 00:55:48] [INFO ] Applying decomposition
[2025-06-03 00:55:48] [INFO ] Flatten gal took : 38 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/graph14802972765220600094.txt' '-o' '/tmp/graph14802972765220600094.bin' '-w' '/tmp/graph14802972765220600094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14802972765220600094.bin' '-l' '-1' '-v' '-w' '/tmp/graph14802972765220600094.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:55:48] [INFO ] Decomposing Gal with order
[2025-06-03 00:55:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:55:48] [INFO ] Removed a total of 1211 redundant transitions.
[2025-06-03 00:55:48] [INFO ] Flatten gal took : 81 ms
[2025-06-03 00:55:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 370 labels/synchronizations in 17 ms.
[2025-06-03 00:55:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15629923591854792125.gal : 8 ms
[2025-06-03 00:55:48] [INFO ] Time to serialize properties into /tmp/CTLFireability13430736771512256421.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/CTLFireability15629923591854792125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13430736771512256421.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 SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 180 place count 660 transition count 1242
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 340 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 500 place count 500 transition count 1162
Applied a total of 500 rules in 45 ms. Remains 500 /752 variables (removed 252) and now considering 1162/1412 (removed 250) transitions.
Running 1160 sub problems to find dead transitions.
[2025-06-03 00:56:18] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 500 cols
[2025-06-03 00:56:18] [INFO ] Computed 52 invariants in 24 ms
[2025-06-03 00:56:18] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:30] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:30] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:31] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:31] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:31] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:31] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:31] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:31] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:31] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:31] [INFO ] Deduced a trap composed of 173 places in 332 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:32] [INFO ] Deduced a trap composed of 182 places in 288 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:32] [INFO ] Deduced a trap composed of 163 places in 280 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:32] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:33] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:33] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:33] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:33] [INFO ] Deduced a trap composed of 23 places in 254 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:35] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:37] [INFO ] Deduced a trap composed of 290 places in 257 ms of which 68 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1642 variables, and 69 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1642 variables, and 69 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40977ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 40979ms
[2025-06-03 00:56:59] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2025-06-03 00:56:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:00] [INFO ] Implicit Places using invariants in 827 ms returned [444, 445, 446, 447, 448, 449, 450, 451, 452, 453]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 833 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 490/752 places, 1162/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 480 transition count 1152
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 480 transition count 1152
Applied a total of 20 rules in 27 ms. Remains 480 /490 variables (removed 10) and now considering 1152/1162 (removed 10) transitions.
[2025-06-03 00:57:00] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
// Phase 1: matrix 1132 rows 480 cols
[2025-06-03 00:57:00] [INFO ] Computed 42 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:01] [INFO ] Implicit Places using invariants in 735 ms returned []
[2025-06-03 00:57:01] [INFO ] Flow matrix only has 1132 transitions (discarded 20 similar events)
[2025-06-03 00:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:57:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 00:57:08] [INFO ] Implicit Places using invariants and state equation in 7105 ms returned []
Implicit Place search using SMT with State Equation took 7846 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 480/752 places, 1152/1412 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 49739 ms. Remains : 480/752 places, 1152/1412 transitions.
[2025-06-03 00:57:08] [INFO ] Flatten gal took : 33 ms
[2025-06-03 00:57:08] [INFO ] Flatten gal took : 35 ms
[2025-06-03 00:57:08] [INFO ] Input system was already deterministic with 1152 transitions.
[2025-06-03 00:57:08] [INFO ] Flatten gal took : 34 ms
[2025-06-03 00:57:08] [INFO ] Flatten gal took : 35 ms
[2025-06-03 00:57:08] [INFO ] Time to serialize gal into /tmp/CTLFireability9498491144921660748.gal : 5 ms
[2025-06-03 00:57:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15500902631683298151.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/CTLFireability9498491144921660748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15500902631683298151.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-03 00:57:38] [INFO ] Flatten gal took : 35 ms
[2025-06-03 00:57:38] [INFO ] Applying decomposition
[2025-06-03 00:57:38] [INFO ] Flatten gal took : 34 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/graph15119949434211614472.txt' '-o' '/tmp/graph15119949434211614472.bin' '-w' '/tmp/graph15119949434211614472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15119949434211614472.bin' '-l' '-1' '-v' '-w' '/tmp/graph15119949434211614472.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:57:38] [INFO ] Decomposing Gal with order
[2025-06-03 00:57:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:57:38] [INFO ] Removed a total of 897 redundant transitions.
[2025-06-03 00:57:38] [INFO ] Flatten gal took : 114 ms
[2025-06-03 00:57:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 293 labels/synchronizations in 14 ms.
[2025-06-03 00:57:38] [INFO ] Time to serialize gal into /tmp/CTLFireability15333345728365089487.gal : 7 ms
[2025-06-03 00:57:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9767495720345088055.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/CTLFireability15333345728365089487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9767495720345088055.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 750 transition count 1342
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 680 transition count 1332
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 160 place count 670 transition count 1332
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 160 place count 670 transition count 1242
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 340 place count 580 transition count 1242
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 440 place count 530 transition count 1192
Applied a total of 440 rules in 54 ms. Remains 530 /752 variables (removed 222) and now considering 1192/1412 (removed 220) transitions.
Running 1190 sub problems to find dead transitions.
[2025-06-03 00:58:09] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
// Phase 1: matrix 1172 rows 530 cols
[2025-06-03 00:58:09] [INFO ] Computed 52 invariants in 21 ms
[2025-06-03 00:58:09] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:21] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:21] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:21] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:21] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:21] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:21] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:21] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:21] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:21] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:22] [INFO ] Deduced a trap composed of 203 places in 299 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:22] [INFO ] Deduced a trap composed of 212 places in 292 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:23] [INFO ] Deduced a trap composed of 183 places in 311 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:23] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:24] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1702 variables, and 64 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1702 variables, and 64 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41007ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 41010ms
[2025-06-03 00:58:50] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2025-06-03 00:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:58:51] [INFO ] Implicit Places using invariants in 996 ms returned []
[2025-06-03 00:58:51] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2025-06-03 00:58:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:58:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 00:59:04] [INFO ] Implicit Places using invariants and state equation in 13414 ms returned []
Implicit Place search using SMT with State Equation took 14428 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:59:04] [INFO ] Redundant transitions in 64 ms returned []
Running 1190 sub problems to find dead transitions.
[2025-06-03 00:59:04] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2025-06-03 00:59:04] [INFO ] Invariant cache hit.
[2025-06-03 00:59:04] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:19] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:19] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:19] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:19] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:19] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:19] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:19] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:19] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:19] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:23] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:25] [INFO ] Deduced a trap composed of 183 places in 437 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:26] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:27] [INFO ] Deduced a trap composed of 212 places in 291 ms of which 62 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1702 variables, and 63 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:54] [INFO ] Deduced a trap composed of 203 places in 346 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:54] [INFO ] Deduced a trap composed of 212 places in 336 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:58] [INFO ] Deduced a trap composed of 97 places in 288 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:00:01] [INFO ] Deduced a trap composed of 320 places in 315 ms of which 103 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1702 variables, and 67 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60950ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 60952ms
Starting structural reductions in SI_CTL mode, iteration 1 : 530/752 places, 1192/1412 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 116519 ms. Remains : 530/752 places, 1192/1412 transitions.
[2025-06-03 01:00:05] [INFO ] Flatten gal took : 30 ms
[2025-06-03 01:00:05] [INFO ] Flatten gal took : 33 ms
[2025-06-03 01:00:05] [INFO ] Input system was already deterministic with 1192 transitions.
[2025-06-03 01:00:05] [INFO ] Flatten gal took : 32 ms
[2025-06-03 01:00:05] [INFO ] Flatten gal took : 33 ms
[2025-06-03 01:00:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15395676431137817342.gal : 6 ms
[2025-06-03 01:00:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8590887563609243847.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/CTLFireability15395676431137817342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8590887563609243847.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-03 01:00:35] [INFO ] Flatten gal took : 34 ms
[2025-06-03 01:00:35] [INFO ] Applying decomposition
[2025-06-03 01:00:35] [INFO ] Flatten gal took : 33 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/graph2120721252832951012.txt' '-o' '/tmp/graph2120721252832951012.bin' '-w' '/tmp/graph2120721252832951012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2120721252832951012.bin' '-l' '-1' '-v' '-w' '/tmp/graph2120721252832951012.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:00:36] [INFO ] Decomposing Gal with order
[2025-06-03 01:00:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:00:36] [INFO ] Removed a total of 1212 redundant transitions.
[2025-06-03 01:00:36] [INFO ] Flatten gal took : 71 ms
[2025-06-03 01:00:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 461 labels/synchronizations in 15 ms.
[2025-06-03 01:00:36] [INFO ] Time to serialize gal into /tmp/CTLFireability5293150257198751547.gal : 7 ms
[2025-06-03 01:00:36] [INFO ] Time to serialize properties into /tmp/CTLFireability15580471969761501721.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/CTLFireability5293150257198751547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15580471969761501721.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 750 transition count 1342
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 680 transition count 1332
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 160 place count 670 transition count 1332
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 160 place count 670 transition count 1242
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 340 place count 580 transition count 1242
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 440 place count 530 transition count 1192
Applied a total of 440 rules in 44 ms. Remains 530 /752 variables (removed 222) and now considering 1192/1412 (removed 220) transitions.
Running 1190 sub problems to find dead transitions.
[2025-06-03 01:01:06] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2025-06-03 01:01:06] [INFO ] Invariant cache hit.
[2025-06-03 01:01:06] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:20] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:20] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:20] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:20] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:21] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:21] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:21] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:21] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:21] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:25] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.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 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 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 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)
(s182 9.0)
(s183 1.0)
(s184 0.0)
(s185 1.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 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 1.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 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.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 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1702 variables, and 60 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1702 variables, and 60 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40992ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 40995ms
[2025-06-03 01:01:47] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2025-06-03 01:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:01:48] [INFO ] Implicit Places using invariants in 853 ms returned []
[2025-06-03 01:01:48] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2025-06-03 01:01:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:01:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:02:01] [INFO ] Implicit Places using invariants and state equation in 13305 ms returned []
Implicit Place search using SMT with State Equation took 14164 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:02:01] [INFO ] Redundant transitions in 46 ms returned []
Running 1190 sub problems to find dead transitions.
[2025-06-03 01:02:01] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2025-06-03 01:02:01] [INFO ] Invariant cache hit.
[2025-06-03 01:02:01] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:16] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:16] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:16] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:16] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:16] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:16] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:17] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:17] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:17] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:20] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:23] [INFO ] Deduced a trap composed of 183 places in 300 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:23] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:24] [INFO ] Deduced a trap composed of 212 places in 295 ms of which 60 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1702 variables, and 63 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:51] [INFO ] Deduced a trap composed of 203 places in 358 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:52] [INFO ] Deduced a trap composed of 212 places in 351 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:55] [INFO ] Deduced a trap composed of 97 places in 278 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:58] [INFO ] Deduced a trap composed of 320 places in 320 ms of which 102 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/1702 variables, and 67 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 38/39 constraints, State Equation: 0/530 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60902ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 60904ms
Starting structural reductions in SI_CTL mode, iteration 1 : 530/752 places, 1192/1412 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 116168 ms. Remains : 530/752 places, 1192/1412 transitions.
[2025-06-03 01:03:02] [INFO ] Flatten gal took : 30 ms
[2025-06-03 01:03:02] [INFO ] Flatten gal took : 32 ms
[2025-06-03 01:03:02] [INFO ] Input system was already deterministic with 1192 transitions.
[2025-06-03 01:03:02] [INFO ] Flatten gal took : 31 ms
[2025-06-03 01:03:02] [INFO ] Flatten gal took : 32 ms
[2025-06-03 01:03:02] [INFO ] Time to serialize gal into /tmp/CTLFireability229261391315053426.gal : 6 ms
[2025-06-03 01:03:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8769407782113616993.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/CTLFireability229261391315053426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8769407782113616993.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:03:32] [INFO ] Flatten gal took : 34 ms
[2025-06-03 01:03:32] [INFO ] Applying decomposition
[2025-06-03 01:03:32] [INFO ] Flatten gal took : 50 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/graph12539219587474191031.txt' '-o' '/tmp/graph12539219587474191031.bin' '-w' '/tmp/graph12539219587474191031.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12539219587474191031.bin' '-l' '-1' '-v' '-w' '/tmp/graph12539219587474191031.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:03:32] [INFO ] Decomposing Gal with order
[2025-06-03 01:03:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:03:32] [INFO ] Removed a total of 1059 redundant transitions.
[2025-06-03 01:03:33] [INFO ] Flatten gal took : 67 ms
[2025-06-03 01:03:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 564 labels/synchronizations in 14 ms.
[2025-06-03 01:03:33] [INFO ] Time to serialize gal into /tmp/CTLFireability14641283861127198880.gal : 6 ms
[2025-06-03 01:03:33] [INFO ] Time to serialize properties into /tmp/CTLFireability18143247597416840966.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/CTLFireability14641283861127198880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18143247597416840966.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 32 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:04:03] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2025-06-03 01:04:03] [INFO ] Computed 52 invariants in 31 ms
[2025-06-03 01:04:03] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:22] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:22] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:22] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:22] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:22] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:22] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:22] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:22] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:22] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:23] [INFO ] Deduced a trap composed of 353 places in 449 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:24] [INFO ] Deduced a trap composed of 197 places in 380 ms of which 124 ms to minimize.
SMT process timed out in 21099ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 21102ms
[2025-06-03 01:04:24] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:04:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:04:25] [INFO ] Implicit Places using invariants in 731 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 733 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 720/752 places, 1392/1412 transitions.
Applied a total of 0 rules in 11 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21883 ms. Remains : 720/752 places, 1392/1412 transitions.
[2025-06-03 01:04:25] [INFO ] Flatten gal took : 36 ms
[2025-06-03 01:04:25] [INFO ] Flatten gal took : 39 ms
[2025-06-03 01:04:25] [INFO ] Input system was already deterministic with 1392 transitions.
[2025-06-03 01:04:25] [INFO ] Flatten gal took : 60 ms
[2025-06-03 01:04:25] [INFO ] Flatten gal took : 38 ms
[2025-06-03 01:04:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9292649683906232085.gal : 6 ms
[2025-06-03 01:04:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8654040075279530649.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/CTLFireability9292649683906232085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8654040075279530649.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-03 01:04:55] [INFO ] Flatten gal took : 49 ms
[2025-06-03 01:04:55] [INFO ] Applying decomposition
[2025-06-03 01:04:55] [INFO ] Flatten gal took : 36 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/graph3536457241010681058.txt' '-o' '/tmp/graph3536457241010681058.bin' '-w' '/tmp/graph3536457241010681058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3536457241010681058.bin' '-l' '-1' '-v' '-w' '/tmp/graph3536457241010681058.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:04:55] [INFO ] Decomposing Gal with order
[2025-06-03 01:04:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:04:55] [INFO ] Removed a total of 1249 redundant transitions.
[2025-06-03 01:04:55] [INFO ] Flatten gal took : 76 ms
[2025-06-03 01:04:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 11 ms.
[2025-06-03 01:04:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18269705642946002551.gal : 8 ms
[2025-06-03 01:04:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16886031181787226015.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/CTLFireability18269705642946002551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16886031181787226015.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 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Applied a total of 22 rules in 26 ms. Remains 740 /752 variables (removed 12) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2025-06-03 01:05:25] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 740 cols
[2025-06-03 01:05:25] [INFO ] Computed 52 invariants in 20 ms
[2025-06-03 01:05:25] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:44] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:44] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:45] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:45] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:45] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:45] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:45] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:45] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:45] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:46] [INFO ] Deduced a trap composed of 207 places in 413 ms of which 134 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/2122 variables, and 60 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:50] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:51] [INFO ] Deduced a trap composed of 322 places in 452 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:52] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:04] [INFO ] Deduced a trap composed of 491 places in 462 ms of which 160 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/2122 variables, and 64 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40997ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 41000ms
[2025-06-03 01:06:06] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 01:06:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:06:07] [INFO ] Implicit Places using invariants in 988 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 991 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/752 places, 1402/1412 transitions.
Applied a total of 0 rules in 10 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42032 ms. Remains : 730/752 places, 1402/1412 transitions.
[2025-06-03 01:06:07] [INFO ] Flatten gal took : 35 ms
[2025-06-03 01:06:07] [INFO ] Flatten gal took : 45 ms
[2025-06-03 01:06:07] [INFO ] Input system was already deterministic with 1402 transitions.
[2025-06-03 01:06:08] [INFO ] Flatten gal took : 38 ms
[2025-06-03 01:06:08] [INFO ] Flatten gal took : 37 ms
[2025-06-03 01:06:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7377784339359012081.gal : 6 ms
[2025-06-03 01:06:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10424466690258572878.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/CTLFireability7377784339359012081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10424466690258572878.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-03 01:06:38] [INFO ] Flatten gal took : 37 ms
[2025-06-03 01:06:38] [INFO ] Applying decomposition
[2025-06-03 01:06:38] [INFO ] Flatten gal took : 36 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/graph2973433159942371689.txt' '-o' '/tmp/graph2973433159942371689.bin' '-w' '/tmp/graph2973433159942371689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2973433159942371689.bin' '-l' '-1' '-v' '-w' '/tmp/graph2973433159942371689.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:06:38] [INFO ] Decomposing Gal with order
[2025-06-03 01:06:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:06:38] [INFO ] Removed a total of 925 redundant transitions.
[2025-06-03 01:06:38] [INFO ] Flatten gal took : 79 ms
[2025-06-03 01:06:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 10 ms.
[2025-06-03 01:06:38] [INFO ] Time to serialize gal into /tmp/CTLFireability12797685963361832975.gal : 9 ms
[2025-06-03 01:06:38] [INFO ] Time to serialize properties into /tmp/CTLFireability175713368345467152.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/CTLFireability12797685963361832975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability175713368345467152.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:07:08] [INFO ] Flatten gal took : 50 ms
[2025-06-03 01:07:08] [INFO ] Flatten gal took : 50 ms
[2025-06-03 01:07:08] [INFO ] Applying decomposition
[2025-06-03 01:07:08] [INFO ] Flatten gal took : 51 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/graph13806709175916735594.txt' '-o' '/tmp/graph13806709175916735594.bin' '-w' '/tmp/graph13806709175916735594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13806709175916735594.bin' '-l' '-1' '-v' '-w' '/tmp/graph13806709175916735594.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:07:09] [INFO ] Decomposing Gal with order
[2025-06-03 01:07:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:07:09] [INFO ] Removed a total of 932 redundant transitions.
[2025-06-03 01:07:09] [INFO ] Flatten gal took : 98 ms
[2025-06-03 01:07:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 215 labels/synchronizations in 8 ms.
[2025-06-03 01:07:09] [INFO ] Time to serialize gal into /tmp/CTLFireability18355637772932073770.gal : 7 ms
[2025-06-03 01:07:09] [INFO ] Time to serialize properties into /tmp/CTLFireability18372282718542690226.ctl : 6 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/CTLFireability18355637772932073770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18372282718542690226.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 13 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 01:36:50] [INFO ] Applying decomposition
[2025-06-03 01:36:51] [INFO ] Flatten gal took : 273 ms
[2025-06-03 01:36:51] [INFO ] Decomposing Gal with order
[2025-06-03 01:36:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:36:51] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, Try_Check_Sources_E_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, Try_Check_Sources_E_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, Try_Check_Sources_E_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, Try_Check_Sources_E_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, Try_Check_Sources_E_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, Try_Check_Sources_E_5, P_1617_5, ScheduleTaskE_Idle_5],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, Idle_6, NotifyEventJobCompletedE_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, Try_Check_Sources_E_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, Idle_7, NotifyEventJobCompletedE_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, Try_Check_Sources_E_7, P_1617_7, ScheduleTaskE_Idle_7],[AwakeTasks_8, IdleTasks_8, NotifyEventJobQueuedE_8, QueueJobE_8, P_2321_8, TryAllocateOneTaskE_8, TryAllocateOneTaskB_8, P_2318_8, EnablePollingE_8, EnablePollingB_8, FetchJobB_8, ScheduleTaskE_Check_8, ScheduleTaskB_8, Abort_Check_Sources_E_8, Abort_Check_Sources_B_8, NotifyEventSourceAddedB_8, Insert_Source_E_8, NotifyEventSourceAddedE_8, P_1113_8, ProcessingEvt_8, P_1155_8, nyo_8, P_1158_8, P_1159_8, P_1160_8, NotifyEventEndOfCheckSourcesB_8, NotifyEventEndOfCheckSourcesE_8, Check_Sources_B_8, Check_Sources_E_8, Idle_8, NotifyEventJobCompletedE_8, NotifyEventJobCompletedB_8, RunE_8, RunB_8, Perform_Work_E_8, Try_Check_Sources_B_8, Try_Check_Sources_E_8, P_1617_8, ScheduleTaskE_Idle_8],[AwakeTasks_9, IdleTasks_9, NotifyEventJobQueuedE_9, QueueJobE_9, P_2321_9, TryAllocateOneTaskE_9, TryAllocateOneTaskB_9, P_2318_9, EnablePollingE_9, EnablePollingB_9, FetchJobB_9, ScheduleTaskE_Check_9, ScheduleTaskB_9, Abort_Check_Sources_E_9, Abort_Check_Sources_B_9, NotifyEventSourceAddedB_9, Insert_Source_E_9, NotifyEventSourceAddedE_9, P_1113_9, ProcessingEvt_9, P_1155_9, nyo_9, P_1158_9, P_1159_9, P_1160_9, NotifyEventEndOfCheckSourcesB_9, NotifyEventEndOfCheckSourcesE_9, Check_Sources_B_9, Check_Sources_E_9, Idle_9, NotifyEventJobCompletedE_9, NotifyEventJobCompletedB_9, RunE_9, RunB_9, Perform_Work_E_9, Try_Check_Sources_B_9, Try_Check_Sources_E_9, P_1617_9, ScheduleTaskE_Idle_9],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42, ScheduleTaskE_Work_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43, ScheduleTaskE_Work_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44, ScheduleTaskE_Work_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45, ScheduleTaskE_Work_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46, ScheduleTaskE_Work_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47, ScheduleTaskE_Work_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48, ScheduleTaskE_Work_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49, ScheduleTaskE_Work_49],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],[DisablePollingE_16, DisablePollingB_16, Insert_Source_B_16, P_1119_16, P_2579_16],[DisablePollingE_17, DisablePollingB_17, Insert_Source_B_17, P_1119_17, P_2579_17],[DisablePollingE_18, DisablePollingB_18, Insert_Source_B_18, P_1119_18, P_2579_18],[DisablePollingE_19, DisablePollingB_19, Insert_Source_B_19, P_1119_19, P_2579_19],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-03 01:36:51] [INFO ] Flatten gal took : 287 ms
[2025-06-03 01:36:51] [INFO ] Time to serialize gal into /tmp/CTLFireability2233967744808825416.gal : 23 ms
[2025-06-03 01:36:51] [INFO ] Time to serialize properties into /tmp/CTLFireability932873224470705173.ctl : 31 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/CTLFireability2233967744808825416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability932873224470705173.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 13 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="PolyORBLF-COL-S02J04T10"
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 PolyORBLF-COL-S02J04T10, 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 r156-tall-174881253700282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T10.tgz
mv PolyORBLF-COL-S02J04T10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;