About the Execution of ITS-Tools for PolyORBLF-COL-S02J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FT?F??????FF???F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700266.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-S02J04T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700266
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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-S02J04T06-CTLFireability-2025-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLFireability-2025-15
=== Now, execution of the tool begins
BK_START 1748903298905
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-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202505121319
[2025-06-02 22:28:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 22:28:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:28:20] [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-02 22:28:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 22:28:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 624 ms
[2025-06-02 22:28:20] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
[2025-06-02 22:28:20] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 22:28:20] [INFO ] Skeletonized 14 HLPN properties in 5 ms. Removed 2 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
Reduction of identical properties reduced properties to check from 63 to 61
RANDOM walk for 40000 steps (20 resets) in 1336 ms. (29 steps per ms) remains 12/61 properties
BEST_FIRST walk for 40001 steps (11 resets) in 480 ms. (83 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (15 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (12 resets) in 351 ms. (113 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (13 resets) in 220 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (12 resets) in 213 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (16 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (15 resets) in 227 ms. (175 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (14 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (10 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (11 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 312 ms. (127 steps per ms) remains 12/12 properties
[2025-06-02 22:28:22] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 22:28:22] [INFO ] Computed 26 invariants in 11 ms
[2025-06-02 22:28:22] [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/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 2 (OVERLAPS) 30/61 variables, 8/9 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/63 variables, 2/11 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 6 (OVERLAPS) 18/81 variables, 15/26 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:22] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:22] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:22] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 3/29 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/29 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 64/145 variables, 81/110 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 8/118 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/118 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/145 variables, 0/118 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 118 constraints, problems are : Problem set: 7 solved, 5 unsolved in 616 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: 12/12 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/52 variables, 3/9 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 21/73 variables, 12/21 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 5/118 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 0/118 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/145 variables, 2/120 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 1/121 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 2/123 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 0/123 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/145 variables, 0/123 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 123 constraints, problems are : Problem set: 7 solved, 5 unsolved in 489 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: 5/12 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1184ms problems are : Problem set: 7 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1357 ms.
Support contains 9 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 72 transition count 55
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 70 transition count 55
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 33 place count 64 transition count 49
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 64 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 63 transition count 48
Applied a total of 35 rules in 30 ms. Remains 63 /81 variables (removed 18) and now considering 48/65 (removed 17) transitions.
Running 47 sub problems to find dead transitions.
[2025-06-02 22:28:24] [INFO ] Flow matrix only has 47 transitions (discarded 1 similar events)
// Phase 1: matrix 47 rows 63 cols
[2025-06-02 22:28:24] [INFO ] Computed 25 invariants in 2 ms
[2025-06-02 22:28:24] [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/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:25] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:25] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:25] [INFO ] Deduced a trap composed of 13 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-02 22:28:25] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:25] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:25] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:25] [INFO ] Deduced a trap composed of 13 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-02 22:28:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 7/33 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 47/110 variables, 63/96 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 8/104 constraints. Problems are: Problem set: 2 solved, 45 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 104 constraints, problems are : Problem set: 2 solved, 45 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 6/30 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 2/33 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 47/110 variables, 63/96 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 8/104 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 45/149 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:27] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:27] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 2/151 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/151 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 151 constraints, problems are : Problem set: 2 solved, 45 unsolved in 3372 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 63/63 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/47 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4818ms problems are : Problem set: 2 solved, 45 unsolved
Search for dead transitions found 2 dead transitions in 4819ms
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 : 63/81 places, 46/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 7 ms. Remains 63 /63 variables (removed 0) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4867 ms. Remains : 63/81 places, 42/65 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
[2025-06-02 22:28:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 22:28:29] [INFO ] Flatten gal took : 30 ms
[2025-06-02 22:28:29] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-COL-S02J04T06-CTLFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-CTLFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 22:28:29] [INFO ] Flatten gal took : 8 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-02 22:28:30] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 30 ms.
[2025-06-02 22:28:30] [INFO ] Unfolded 13 HLPN properties in 1 ms.
[2025-06-02 22:28:30] [INFO ] Reduced 66 identical enabling conditions.
[2025-06-02 22:28:30] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-02 22:28:30] [INFO ] Reduced 24 identical enabling conditions.
[2025-06-02 22:28:30] [INFO ] Reduced 24 identical enabling conditions.
[2025-06-02 22:28:30] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 433 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Applied a total of 0 rules in 7 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2025-06-02 22:28:30] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2025-06-02 22:28:30] [INFO ] Computed 46 invariants in 51 ms
[2025-06-02 22:28:30] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:37] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:37] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:37] [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-02 22:28:37] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:37] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:38] [INFO ] Deduced a trap composed of 217 places in 239 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:38] [INFO ] Deduced a trap composed of 98 places in 213 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:38] [INFO ] Deduced a trap composed of 133 places in 222 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:39] [INFO ] Deduced a trap composed of 254 places in 221 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:39] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:39] [INFO ] Deduced a trap composed of 223 places in 285 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:42] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:44] [INFO ] Deduced a trap composed of 205 places in 250 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:44] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:47] [INFO ] Deduced a trap composed of 235 places in 276 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:28:47] [INFO ] Deduced a trap composed of 223 places in 268 ms of which 79 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 58 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 58 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40709ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 40714ms
[2025-06-02 22:29:10] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 22:29:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:29:10] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-02 22:29:10] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 22:29:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:29:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:29:12] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
Running 822 sub problems to find dead transitions.
[2025-06-02 22:29:12] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 22:29:12] [INFO ] Invariant cache hit.
[2025-06-02 22:29:12] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:19] [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-02 22:29:20] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:20] [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-02 22:29:20] [INFO ] Deduced a trap composed of 65 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-02 22:29:20] [INFO ] Deduced a trap composed of 65 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-02 22:29:20] [INFO ] Deduced a trap composed of 133 places in 212 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:20] [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-02 22:29:25] [INFO ] Deduced a trap composed of 205 places in 274 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:25] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:28] [INFO ] Deduced a trap composed of 223 places in 262 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:31] [INFO ] Deduced a trap composed of 200 places in 218 ms of which 49 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:38] [INFO ] Deduced a trap composed of 223 places in 265 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:39] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:39] [INFO ] Deduced a trap composed of 235 places in 255 ms of which 83 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 56 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:54] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:54] [INFO ] Deduced a trap composed of 217 places in 257 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:29:56] [INFO ] Deduced a trap composed of 98 places in 242 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 59 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60450ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60453ms
Finished structural reductions in LTL mode , in 1 iterations and 102830 ms. Remains : 476/476 places, 824/824 transitions.
Support contains 433 out of 476 places after structural reductions.
[2025-06-02 22:30:13] [INFO ] Flatten gal took : 117 ms
[2025-06-02 22:30:13] [INFO ] Flatten gal took : 88 ms
[2025-06-02 22:30:13] [INFO ] Input system was already deterministic with 824 transitions.
Support contains 420 out of 476 places (down from 433) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 61 to 60
RANDOM walk for 40000 steps (13 resets) in 1093 ms. (36 steps per ms) remains 11/60 properties
BEST_FIRST walk for 40001 steps (11 resets) in 748 ms. (53 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 429 ms. (93 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 388 ms. (102 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (11 resets) in 552 ms. (72 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (10 resets) in 473 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 654 ms. (61 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 626 ms. (63 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (11 resets) in 582 ms. (68 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 667 ms. (59 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 557 ms. (71 steps per ms) remains 10/10 properties
[2025-06-02 22:30:16] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 22:30:16] [INFO ] Invariant cache hit.
[2025-06-02 22:30:16] [INFO ] State equation strengthened by 72 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/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 2 (OVERLAPS) 112/282 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 5 (OVERLAPS) 190/472 variables, 31/42 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/42 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/475 variables, 3/45 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/45 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/476 variables, 1/46 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/46 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 812/1288 variables, 476/522 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1288 variables, 72/594 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 7 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1288/1288 variables, and 594 constraints, problems are : Problem set: 7 solved, 3 unsolved in 3123 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 476/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 10/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 137/189 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 264/453 variables, 24/30 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:19] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:20] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:20] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:20] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:20] [INFO ] Deduced a trap composed of 207 places in 212 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:20] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:21] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 48 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 7/37 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/37 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/464 variables, 5/42 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:21] [INFO ] Deduced a trap composed of 130 places in 282 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:22] [INFO ] Deduced a trap composed of 159 places in 272 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:22] [INFO ] Deduced a trap composed of 208 places in 311 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:22] [INFO ] Deduced a trap composed of 219 places in 273 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:22] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 5/47 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/47 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 10/474 variables, 10/57 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/57 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 812/1286 variables, 474/531 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1286 variables, 72/603 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1286 variables, 2/605 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1286 variables, 0/605 constraints. Problems are: Problem set: 7 solved, 3 unsolved
SMT process timed out in 8167ms, After SMT, problems are : Problem set: 7 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 420 transition count 770
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 110 place count 420 transition count 752
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 146 place count 402 transition count 752
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 242 place count 354 transition count 704
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 354 transition count 692
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 266 place count 342 transition count 692
Applied a total of 266 rules in 114 ms. Remains 342 /476 variables (removed 134) and now considering 692/824 (removed 132) transitions.
Running 690 sub problems to find dead transitions.
[2025-06-02 22:30:24] [INFO ] Flow matrix only has 680 transitions (discarded 12 similar events)
// Phase 1: matrix 680 rows 342 cols
[2025-06-02 22:30:24] [INFO ] Computed 44 invariants in 16 ms
[2025-06-02 22:30:24] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:29] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:29] [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-02 22:30:29] [INFO ] Deduced a trap composed of 43 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-02 22:30:30] [INFO ] Deduced a trap composed of 43 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-02 22:30:30] [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-02 22:30:30] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:30] [INFO ] Deduced a trap composed of 133 places in 188 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:30] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:30] [INFO ] Deduced a trap composed of 127 places in 191 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:31] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:31] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:32] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:32] [INFO ] Deduced a trap composed of 196 places in 191 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:36] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:36] [INFO ] Deduced a trap composed of 110 places in 196 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:36] [INFO ] Deduced a trap composed of 127 places in 187 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:30:36] [INFO ] Deduced a trap composed of 132 places in 164 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/1022 variables, and 59 constraints, problems are : Problem set: 0 solved, 690 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/340 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/1022 variables, and 59 constraints, problems are : Problem set: 0 solved, 690 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/342 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/690 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40498ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 40501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40617 ms. Remains : 342/476 places, 692/824 transitions.
RANDOM walk for 40000 steps (25 resets) in 518 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (22 resets) in 301 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (13 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (12 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 224672 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 3
Probabilistic random walk after 224672 steps, saw 125086 distinct states, run finished after 3006 ms. (steps per millisecond=74 ) properties seen :0
[2025-06-02 22:31:08] [INFO ] Flow matrix only has 680 transitions (discarded 12 similar events)
[2025-06-02 22:31:08] [INFO ] Invariant cache hit.
[2025-06-02 22:31:08] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 116/168 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 153/321 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/324 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/339 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 680/1020 variables, 340/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1020 variables, 72/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1020 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1022 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1022 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1022 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1022 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 458 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1400 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 342/342 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 116/168 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 153/321 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:10] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:10] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:10] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:10] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:10] [INFO ] Deduced a trap composed of 139 places in 182 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:11] [INFO ] Deduced a trap composed of 143 places in 165 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:11] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/324 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 15/339 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 680/1020 variables, 340/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1020 variables, 72/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1020 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1020 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1022 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1022 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1022 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1022 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 467 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3497 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 342/342 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4912ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 378 ms.
Support contains 52 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 692/692 transitions.
Applied a total of 0 rules in 15 ms. Remains 342 /342 variables (removed 0) and now considering 692/692 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 342/342 places, 692/692 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 692/692 transitions.
Applied a total of 0 rules in 16 ms. Remains 342 /342 variables (removed 0) and now considering 692/692 (removed 0) transitions.
[2025-06-02 22:31:13] [INFO ] Flow matrix only has 680 transitions (discarded 12 similar events)
[2025-06-02 22:31:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:31:14] [INFO ] Implicit Places using invariants in 843 ms returned [276, 277, 278, 279, 280, 281]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 846 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 336/342 places, 692/692 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 330 transition count 686
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 330 transition count 686
Applied a total of 12 rules in 22 ms. Remains 330 /336 variables (removed 6) and now considering 686/692 (removed 6) transitions.
[2025-06-02 22:31:14] [INFO ] Flow matrix only has 674 transitions (discarded 12 similar events)
// Phase 1: matrix 674 rows 330 cols
[2025-06-02 22:31:14] [INFO ] Computed 38 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:31:15] [INFO ] Implicit Places using invariants in 814 ms returned []
[2025-06-02 22:31:15] [INFO ] Flow matrix only has 674 transitions (discarded 12 similar events)
[2025-06-02 22:31:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:31:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:31:18] [INFO ] Implicit Places using invariants and state equation in 3380 ms returned []
Implicit Place search using SMT with State Equation took 4198 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 330/342 places, 686/692 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5082 ms. Remains : 330/342 places, 686/692 transitions.
RANDOM walk for 40000 steps (26 resets) in 312 ms. (127 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (12 resets) in 315 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (11 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 256918 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 3
Probabilistic random walk after 256918 steps, saw 124243 distinct states, run finished after 3002 ms. (steps per millisecond=85 ) properties seen :0
[2025-06-02 22:31:22] [INFO ] Flow matrix only has 674 transitions (discarded 12 similar events)
[2025-06-02 22:31:22] [INFO ] Invariant cache hit.
[2025-06-02 22:31:22] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 142/194 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/197 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 130/327 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/328 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 674/1002 variables, 328/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1002 variables, 72/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1002 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/1004 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1004 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1004 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1004 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1004/1004 variables, and 440 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1315 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 330/330 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 142/194 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/197 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 130/327 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:23] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:24] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:24] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:24] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:24] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:24] [INFO ] Deduced a trap composed of 132 places in 190 ms of which 37 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 674/1002 variables, 328/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1002 variables, 72/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1002 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1002 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1004 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1004 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1004 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1004 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1004/1004 variables, and 448 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3114 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 330/330 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4441ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1053 ms.
Support contains 52 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 686/686 transitions.
Applied a total of 0 rules in 13 ms. Remains 330 /330 variables (removed 0) and now considering 686/686 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 330/330 places, 686/686 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 686/686 transitions.
Applied a total of 0 rules in 21 ms. Remains 330 /330 variables (removed 0) and now considering 686/686 (removed 0) transitions.
[2025-06-02 22:31:27] [INFO ] Flow matrix only has 674 transitions (discarded 12 similar events)
[2025-06-02 22:31:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:31:28] [INFO ] Implicit Places using invariants in 771 ms returned []
[2025-06-02 22:31:28] [INFO ] Flow matrix only has 674 transitions (discarded 12 similar events)
[2025-06-02 22:31:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:31:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:31:31] [INFO ] Implicit Places using invariants and state equation in 3339 ms returned []
Implicit Place search using SMT with State Equation took 4113 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:31:31] [INFO ] Redundant transitions in 44 ms returned []
Running 684 sub problems to find dead transitions.
[2025-06-02 22:31:31] [INFO ] Flow matrix only has 674 transitions (discarded 12 similar events)
[2025-06-02 22:31:31] [INFO ] Invariant cache hit.
[2025-06-02 22:31:31] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 684 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 684 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:36] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:36] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:37] [INFO ] Deduced a trap composed of 43 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-02 22:31:37] [INFO ] Deduced a trap composed of 43 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-02 22:31:37] [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-02 22:31:37] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:37] [INFO ] Deduced a trap composed of 133 places in 196 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:37] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:38] [INFO ] Deduced a trap composed of 127 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:38] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:38] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:38] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:38] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:39] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:40] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:40] [INFO ] Deduced a trap composed of 127 places in 159 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:40] [INFO ] Deduced a trap composed of 196 places in 174 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:43] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:31:44] [INFO ] Deduced a trap composed of 110 places in 184 ms of which 35 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 684 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 684 unsolved
Problem TDEAD606 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/329 variables, 1/56 constraints. Problems are: Problem set: 6 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 329/1004 variables, and 56 constraints, problems are : Problem set: 6 solved, 678 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/330 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 684/684 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 678 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 13/13 constraints. Problems are: Problem set: 6 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 23/36 constraints. Problems are: Problem set: 6 solved, 678 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 19/55 constraints. Problems are: Problem set: 6 solved, 678 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:18] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:18] [INFO ] Deduced a trap composed of 132 places in 189 ms of which 42 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 2/57 constraints. Problems are: Problem set: 6 solved, 678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/1004 variables, and 57 constraints, problems are : Problem set: 6 solved, 678 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 23/24 constraints, State Equation: 0/330 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/684 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60505ms problems are : Problem set: 6 solved, 678 unsolved
Search for dead transitions found 6 dead transitions in 60508ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 330/330 places, 680/686 transitions.
Applied a total of 0 rules in 11 ms. Remains 330 /330 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:32:32] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64730 ms. Remains : 330/330 places, 680/686 transitions.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
[2025-06-02 22:32:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 22:32:32] [INFO ] Flatten gal took : 53 ms
FORMULA PolyORBLF-COL-S02J04T06-CTLFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 22:32:32] [INFO ] Flatten gal took : 52 ms
[2025-06-02 22:32:32] [INFO ] Input system was already deterministic with 824 transitions.
Support contains 381 out of 476 places (down from 385) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 462 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 462 transition count 812
Applied a total of 26 rules in 21 ms. Remains 462 /476 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:32:32] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 462 cols
[2025-06-02 22:32:32] [INFO ] Computed 44 invariants in 13 ms
[2025-06-02 22:32:32] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:38] [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-02 22:32:38] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:38] [INFO ] Deduced a trap composed of 63 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-02 22:32:38] [INFO ] Deduced a trap composed of 63 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-02 22:32:39] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:39] [INFO ] Deduced a trap composed of 217 places in 244 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:39] [INFO ] Deduced a trap composed of 121 places in 210 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:40] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:40] [INFO ] Deduced a trap composed of 222 places in 218 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:42] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:43] [INFO ] Deduced a trap composed of 205 places in 229 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:44] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:32:46] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.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 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 1.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 9.0)
(s123 0.0)
(s124 1.0)
(s125 1.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 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 (/ 1.0 3.0))
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 (/ 1.0 3.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 1.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 (/ 1.0 3.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 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1262 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:02] [INFO ] Deduced a trap composed of 298 places in 263 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:33:08] [INFO ] Deduced a trap composed of 242 places in 245 ms of which 78 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1262 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40370ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40372ms
[2025-06-02 22:33:13] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:33:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:33:13] [INFO ] Implicit Places using invariants in 492 ms returned [366, 367, 368, 369, 370, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 493 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/476 places, 812/824 transitions.
Applied a total of 0 rules in 5 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40893 ms. Remains : 456/476 places, 812/824 transitions.
[2025-06-02 22:33:13] [INFO ] Flatten gal took : 49 ms
[2025-06-02 22:33:13] [INFO ] Flatten gal took : 35 ms
[2025-06-02 22:33:13] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-02 22:33:13] [INFO ] Flatten gal took : 31 ms
[2025-06-02 22:33:13] [INFO ] Flatten gal took : 31 ms
[2025-06-02 22:33:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5441008114196118632.gal : 19 ms
[2025-06-02 22:33:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5196388725015407340.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/CTLFireability5441008114196118632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5196388725015407340.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:33:43] [INFO ] Flatten gal took : 29 ms
[2025-06-02 22:33:43] [INFO ] Applying decomposition
[2025-06-02 22:33:43] [INFO ] Flatten gal took : 29 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/graph12894035798003023153.txt' '-o' '/tmp/graph12894035798003023153.bin' '-w' '/tmp/graph12894035798003023153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12894035798003023153.bin' '-l' '-1' '-v' '-w' '/tmp/graph12894035798003023153.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:33:44] [INFO ] Decomposing Gal with order
[2025-06-02 22:33:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:33:44] [INFO ] Removed a total of 642 redundant transitions.
[2025-06-02 22:33:44] [INFO ] Flatten gal took : 129 ms
[2025-06-02 22:33:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 31 ms.
[2025-06-02 22:33:44] [INFO ] Time to serialize gal into /tmp/CTLFireability18340594876090649779.gal : 15 ms
[2025-06-02 22:33:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15722731858076336599.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/CTLFireability18340594876090649779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15722731858076336599.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 474 transition count 800
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 450 transition count 800
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 450 transition count 788
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 438 transition count 788
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 432 transition count 782
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 432 transition count 782
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 132 place count 408 transition count 758
Applied a total of 132 rules in 70 ms. Remains 408 /476 variables (removed 68) and now considering 758/824 (removed 66) transitions.
Running 756 sub problems to find dead transitions.
[2025-06-02 22:34:14] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
// Phase 1: matrix 746 rows 408 cols
[2025-06-02 22:34:14] [INFO ] Computed 44 invariants in 7 ms
[2025-06-02 22:34:14] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:20] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:20] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:20] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:20] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:21] [INFO ] Deduced a trap composed of 54 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-02 22:34:21] [INFO ] Deduced a trap composed of 181 places in 201 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:21] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:21] [INFO ] Deduced a trap composed of 54 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-02 22:34:22] [INFO ] Deduced a trap composed of 186 places in 217 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:23] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:24] [INFO ] Deduced a trap composed of 250 places in 234 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:27] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:27] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:29] [INFO ] Deduced a trap composed of 200 places in 219 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:34:30] [INFO ] Deduced a trap composed of 192 places in 207 ms of which 58 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1154 variables, and 57 constraints, problems are : Problem set: 0 solved, 756 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/408 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 756 unsolved
SMT process timed out in 40386ms, After SMT, problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 40390ms
[2025-06-02 22:34:54] [INFO ] Flow matrix only has 746 transitions (discarded 12 similar events)
[2025-06-02 22:34:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:34:55] [INFO ] Implicit Places using invariants in 802 ms returned [330, 331, 332, 333, 334, 335]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 805 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 402/476 places, 758/824 transitions.
Applied a total of 0 rules in 15 ms. Remains 402 /402 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41282 ms. Remains : 402/476 places, 758/824 transitions.
[2025-06-02 22:34:55] [INFO ] Flatten gal took : 25 ms
[2025-06-02 22:34:55] [INFO ] Flatten gal took : 29 ms
[2025-06-02 22:34:55] [INFO ] Input system was already deterministic with 758 transitions.
[2025-06-02 22:34:55] [INFO ] Flatten gal took : 33 ms
[2025-06-02 22:34:55] [INFO ] Flatten gal took : 28 ms
[2025-06-02 22:34:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6403305417608569262.gal : 5 ms
[2025-06-02 22:34:55] [INFO ] Time to serialize properties into /tmp/CTLFireability2363806111267506068.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/CTLFireability6403305417608569262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2363806111267506068.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:35:26] [INFO ] Flatten gal took : 28 ms
[2025-06-02 22:35:26] [INFO ] Applying decomposition
[2025-06-02 22:35:26] [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/graph12116668217339195432.txt' '-o' '/tmp/graph12116668217339195432.bin' '-w' '/tmp/graph12116668217339195432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12116668217339195432.bin' '-l' '-1' '-v' '-w' '/tmp/graph12116668217339195432.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:35:26] [INFO ] Decomposing Gal with order
[2025-06-02 22:35:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:35:26] [INFO ] Removed a total of 577 redundant transitions.
[2025-06-02 22:35:26] [INFO ] Flatten gal took : 59 ms
[2025-06-02 22:35:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 11 ms.
[2025-06-02 22:35:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10020561687741506103.gal : 7 ms
[2025-06-02 22:35:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17512334331106339273.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/CTLFireability10020561687741506103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17512334331106339273.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 462 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 462 transition count 812
Applied a total of 26 rules in 11 ms. Remains 462 /476 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:35:56] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 462 cols
[2025-06-02 22:35:56] [INFO ] Computed 44 invariants in 8 ms
[2025-06-02 22:35:56] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:02] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:02] [INFO ] Deduced a trap composed of 63 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-02 22:36:02] [INFO ] Deduced a trap composed of 63 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-02 22:36:03] [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-02 22:36:03] [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-02 22:36:03] [INFO ] Deduced a trap composed of 217 places in 236 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:03] [INFO ] Deduced a trap composed of 121 places in 218 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:04] [INFO ] Deduced a trap composed of 242 places in 225 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:04] [INFO ] Deduced a trap composed of 222 places in 226 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:06] [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-02 22:36:08] [INFO ] Deduced a trap composed of 205 places in 222 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:08] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:10] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1262 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:26] [INFO ] Deduced a trap composed of 298 places in 246 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:36:32] [INFO ] Deduced a trap composed of 242 places in 241 ms of which 77 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1262 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40417ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40419ms
[2025-06-02 22:36:36] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:36:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:36:37] [INFO ] Implicit Places using invariants in 312 ms returned [366, 367, 368, 369, 370, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 314 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/476 places, 812/824 transitions.
Applied a total of 0 rules in 3 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40750 ms. Remains : 456/476 places, 812/824 transitions.
[2025-06-02 22:36:37] [INFO ] Flatten gal took : 22 ms
[2025-06-02 22:36:37] [INFO ] Flatten gal took : 24 ms
[2025-06-02 22:36:37] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-02 22:36:37] [INFO ] Flatten gal took : 24 ms
[2025-06-02 22:36:37] [INFO ] Flatten gal took : 25 ms
[2025-06-02 22:36:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15042093890431428959.gal : 4 ms
[2025-06-02 22:36:37] [INFO ] Time to serialize properties into /tmp/CTLFireability5394683993070164434.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/CTLFireability15042093890431428959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5394683993070164434.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:37:07] [INFO ] Flatten gal took : 26 ms
[2025-06-02 22:37:07] [INFO ] Applying decomposition
[2025-06-02 22:37:07] [INFO ] Flatten gal took : 29 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/graph5624627833996875953.txt' '-o' '/tmp/graph5624627833996875953.bin' '-w' '/tmp/graph5624627833996875953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5624627833996875953.bin' '-l' '-1' '-v' '-w' '/tmp/graph5624627833996875953.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:37:07] [INFO ] Decomposing Gal with order
[2025-06-02 22:37:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:37:07] [INFO ] Removed a total of 621 redundant transitions.
[2025-06-02 22:37:07] [INFO ] Flatten gal took : 74 ms
[2025-06-02 22:37:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 11 ms.
[2025-06-02 22:37:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11661323992800951763.gal : 6 ms
[2025-06-02 22:37:07] [INFO ] Time to serialize properties into /tmp/CTLFireability6029275729812063018.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/CTLFireability11661323992800951763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6029275729812063018.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 420 transition count 770
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 108 place count 420 transition count 752
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 144 place count 402 transition count 752
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 240 place count 354 transition count 704
Applied a total of 240 rules in 71 ms. Remains 354 /476 variables (removed 122) and now considering 704/824 (removed 120) transitions.
Running 702 sub problems to find dead transitions.
[2025-06-02 22:37:37] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
// Phase 1: matrix 692 rows 354 cols
[2025-06-02 22:37:37] [INFO ] Computed 44 invariants in 7 ms
[2025-06-02 22:37:37] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:42] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:42] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:42] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:43] [INFO ] Deduced a trap composed of 45 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-02 22:37:43] [INFO ] Deduced a trap composed of 45 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-02 22:37:43] [INFO ] Deduced a trap composed of 45 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-02 22:37:43] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:43] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:43] [INFO ] Deduced a trap composed of 144 places in 202 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:44] [INFO ] Deduced a trap composed of 133 places in 202 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:44] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:45] [INFO ] Deduced a trap composed of 208 places in 187 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:37:50] [INFO ] Deduced a trap composed of 110 places in 179 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 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 9.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.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 1.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 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.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 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.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 1.0)
(s242 0.0)
(s243 10.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.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 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 6.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/1046 variables, and 55 constraints, problems are : Problem set: 0 solved, 702 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:38:17] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 43 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/1046 variables, and 56 constraints, problems are : Problem set: 0 solved, 702 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/354 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/702 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40444ms problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 40445ms
[2025-06-02 22:38:18] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2025-06-02 22:38:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:38:19] [INFO ] Implicit Places using invariants in 868 ms returned [288, 289, 290, 291, 292, 293]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 882 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 348/476 places, 704/824 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 342 transition count 698
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 342 transition count 698
Applied a total of 12 rules in 20 ms. Remains 342 /348 variables (removed 6) and now considering 698/704 (removed 6) transitions.
[2025-06-02 22:38:19] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
// Phase 1: matrix 686 rows 342 cols
[2025-06-02 22:38:19] [INFO ] Computed 38 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:38:20] [INFO ] Implicit Places using invariants in 987 ms returned []
[2025-06-02 22:38:20] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 22:38:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:38:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:38:23] [INFO ] Implicit Places using invariants and state equation in 3536 ms returned []
Implicit Place search using SMT with State Equation took 4533 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 342/476 places, 698/824 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 45973 ms. Remains : 342/476 places, 698/824 transitions.
[2025-06-02 22:38:23] [INFO ] Flatten gal took : 21 ms
[2025-06-02 22:38:23] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:38:23] [INFO ] Input system was already deterministic with 698 transitions.
[2025-06-02 22:38:23] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:38:23] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14156613191508049516.gal : 3 ms
[2025-06-02 22:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability13483927249239599273.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/CTLFireability14156613191508049516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13483927249239599273.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:38:54] [INFO ] Flatten gal took : 21 ms
[2025-06-02 22:38:54] [INFO ] Applying decomposition
[2025-06-02 22:38:54] [INFO ] Flatten gal took : 31 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/graph7228449299723241293.txt' '-o' '/tmp/graph7228449299723241293.bin' '-w' '/tmp/graph7228449299723241293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7228449299723241293.bin' '-l' '-1' '-v' '-w' '/tmp/graph7228449299723241293.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:38:54] [INFO ] Decomposing Gal with order
[2025-06-02 22:38:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:38:54] [INFO ] Removed a total of 522 redundant transitions.
[2025-06-02 22:38:54] [INFO ] Flatten gal took : 52 ms
[2025-06-02 22:38:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 5 ms.
[2025-06-02 22:38:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10784792436744578565.gal : 5 ms
[2025-06-02 22:38:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17207704174945860098.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/CTLFireability10784792436744578565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17207704174945860098.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Applied a total of 14 rules in 15 ms. Remains 468 /476 variables (removed 8) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2025-06-02 22:39:24] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 468 cols
[2025-06-02 22:39:24] [INFO ] Computed 44 invariants in 9 ms
[2025-06-02 22:39:24] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:32] [INFO ] Deduced a trap composed of 64 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-02 22:39:33] [INFO ] Deduced a trap composed of 64 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-02 22:39:33] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:33] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:33] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:34] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:35] [INFO ] Deduced a trap composed of 205 places in 230 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:36] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:38] [INFO ] Deduced a trap composed of 223 places in 216 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:38] [INFO ] Deduced a trap composed of 223 places in 242 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:39] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:39] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:39] [INFO ] Deduced a trap composed of 235 places in 249 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:40] [INFO ] Deduced a trap composed of 127 places in 226 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:42] [INFO ] Deduced a trap composed of 194 places in 218 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:43] [INFO ] Deduced a trap composed of 228 places in 228 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:44] [INFO ] Deduced a trap composed of 282 places in 233 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:44] [INFO ] Deduced a trap composed of 288 places in 258 ms of which 86 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1274 variables, and 60 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:52] [INFO ] Deduced a trap composed of 223 places in 226 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:39:57] [INFO ] Deduced a trap composed of 92 places in 235 ms of which 61 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1274 variables, and 62 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40354ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 40356ms
[2025-06-02 22:40:04] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:40:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:40:05] [INFO ] Implicit Places using invariants in 487 ms returned [366, 367, 368, 369, 370, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 489 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 462/476 places, 818/824 transitions.
Applied a total of 0 rules in 5 ms. Remains 462 /462 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40868 ms. Remains : 462/476 places, 818/824 transitions.
[2025-06-02 22:40:05] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:40:05] [INFO ] Flatten gal took : 28 ms
[2025-06-02 22:40:05] [INFO ] Input system was already deterministic with 818 transitions.
[2025-06-02 22:40:05] [INFO ] Flatten gal took : 24 ms
[2025-06-02 22:40:05] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:40:05] [INFO ] Time to serialize gal into /tmp/CTLFireability18164693994660897064.gal : 4 ms
[2025-06-02 22:40:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10945587362248002557.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/CTLFireability18164693994660897064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10945587362248002557.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:40:35] [INFO ] Flatten gal took : 22 ms
[2025-06-02 22:40:35] [INFO ] Applying decomposition
[2025-06-02 22:40:35] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5391082123378941497.txt' '-o' '/tmp/graph5391082123378941497.bin' '-w' '/tmp/graph5391082123378941497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5391082123378941497.bin' '-l' '-1' '-v' '-w' '/tmp/graph5391082123378941497.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:40:35] [INFO ] Decomposing Gal with order
[2025-06-02 22:40:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:40:35] [INFO ] Removed a total of 621 redundant transitions.
[2025-06-02 22:40:35] [INFO ] Flatten gal took : 65 ms
[2025-06-02 22:40:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 175 labels/synchronizations in 7 ms.
[2025-06-02 22:40:35] [INFO ] Time to serialize gal into /tmp/CTLFireability808321842826628636.gal : 5 ms
[2025-06-02 22:40:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7437859925684378833.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/CTLFireability808321842826628636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7437859925684378833.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 462 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 462 transition count 812
Applied a total of 26 rules in 20 ms. Remains 462 /476 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:41:05] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 462 cols
[2025-06-02 22:41:05] [INFO ] Computed 44 invariants in 8 ms
[2025-06-02 22:41:05] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:11] [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-02 22:41:11] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:11] [INFO ] Deduced a trap composed of 63 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-02 22:41:11] [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-02 22:41:12] [INFO ] Deduced a trap composed of 63 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-02 22:41:12] [INFO ] Deduced a trap composed of 217 places in 230 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:12] [INFO ] Deduced a trap composed of 121 places in 203 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:13] [INFO ] Deduced a trap composed of 242 places in 216 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:13] [INFO ] Deduced a trap composed of 222 places in 224 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:15] [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-02 22:41:16] [INFO ] Deduced a trap composed of 205 places in 243 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:17] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:19] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1262 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:35] [INFO ] Deduced a trap composed of 298 places in 260 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:41:41] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 79 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1262 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40397ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40399ms
[2025-06-02 22:41:46] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:41:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:41:46] [INFO ] Implicit Places using invariants in 469 ms returned [366, 367, 368, 369, 370, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 471 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/476 places, 812/824 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40895 ms. Remains : 456/476 places, 812/824 transitions.
[2025-06-02 22:41:46] [INFO ] Flatten gal took : 21 ms
[2025-06-02 22:41:46] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:41:46] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-02 22:41:46] [INFO ] Flatten gal took : 22 ms
[2025-06-02 22:41:46] [INFO ] Flatten gal took : 22 ms
[2025-06-02 22:41:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15568371244937354096.gal : 4 ms
[2025-06-02 22:41:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14808147705983356047.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/CTLFireability15568371244937354096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14808147705983356047.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:42:16] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:42:16] [INFO ] Applying decomposition
[2025-06-02 22:42:16] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14524708194983939563.txt' '-o' '/tmp/graph14524708194983939563.bin' '-w' '/tmp/graph14524708194983939563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14524708194983939563.bin' '-l' '-1' '-v' '-w' '/tmp/graph14524708194983939563.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:42:16] [INFO ] Decomposing Gal with order
[2025-06-02 22:42:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:42:17] [INFO ] Removed a total of 625 redundant transitions.
[2025-06-02 22:42:17] [INFO ] Flatten gal took : 46 ms
[2025-06-02 22:42:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 7 ms.
[2025-06-02 22:42:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14205251475662636055.gal : 13 ms
[2025-06-02 22:42:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3325566411100616068.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/CTLFireability14205251475662636055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3325566411100616068.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 420 transition count 770
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 108 place count 420 transition count 752
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 144 place count 402 transition count 752
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 240 place count 354 transition count 704
Applied a total of 240 rules in 28 ms. Remains 354 /476 variables (removed 122) and now considering 704/824 (removed 120) transitions.
Running 702 sub problems to find dead transitions.
[2025-06-02 22:42:47] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
// Phase 1: matrix 692 rows 354 cols
[2025-06-02 22:42:47] [INFO ] Computed 44 invariants in 8 ms
[2025-06-02 22:42:47] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:51] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:52] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:52] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:52] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:52] [INFO ] Deduced a trap composed of 45 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-02 22:42:52] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:52] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:52] [INFO ] Deduced a trap composed of 139 places in 203 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:52] [INFO ] Deduced a trap composed of 144 places in 179 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:53] [INFO ] Deduced a trap composed of 133 places in 195 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:53] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:55] [INFO ] Deduced a trap composed of 208 places in 200 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:42:59] [INFO ] Deduced a trap composed of 110 places in 173 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:43:07] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 10 ms to minimize.
SMT process timed out in 20535ms, After SMT, problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 20536ms
[2025-06-02 22:43:07] [INFO ] Flow matrix only has 692 transitions (discarded 12 similar events)
[2025-06-02 22:43:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:43:08] [INFO ] Implicit Places using invariants in 878 ms returned [288, 289, 290, 291, 292, 293]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 884 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 348/476 places, 704/824 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 342 transition count 698
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 342 transition count 698
Applied a total of 12 rules in 14 ms. Remains 342 /348 variables (removed 6) and now considering 698/704 (removed 6) transitions.
[2025-06-02 22:43:08] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
// Phase 1: matrix 686 rows 342 cols
[2025-06-02 22:43:08] [INFO ] Computed 38 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:43:09] [INFO ] Implicit Places using invariants in 862 ms returned []
[2025-06-02 22:43:09] [INFO ] Flow matrix only has 686 transitions (discarded 12 similar events)
[2025-06-02 22:43:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:43:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:43:12] [INFO ] Implicit Places using invariants and state equation in 3516 ms returned []
Implicit Place search using SMT with State Equation took 4380 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 342/476 places, 698/824 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 25844 ms. Remains : 342/476 places, 698/824 transitions.
[2025-06-02 22:43:13] [INFO ] Flatten gal took : 29 ms
[2025-06-02 22:43:13] [INFO ] Flatten gal took : 24 ms
[2025-06-02 22:43:13] [INFO ] Input system was already deterministic with 698 transitions.
[2025-06-02 22:43:13] [INFO ] Flatten gal took : 21 ms
[2025-06-02 22:43:13] [INFO ] Flatten gal took : 27 ms
[2025-06-02 22:43:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5012157169311510052.gal : 4 ms
[2025-06-02 22:43:13] [INFO ] Time to serialize properties into /tmp/CTLFireability9720088096011629526.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/CTLFireability5012157169311510052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9720088096011629526.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:43:43] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:43:43] [INFO ] Applying decomposition
[2025-06-02 22:43:43] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13979944222247542025.txt' '-o' '/tmp/graph13979944222247542025.bin' '-w' '/tmp/graph13979944222247542025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13979944222247542025.bin' '-l' '-1' '-v' '-w' '/tmp/graph13979944222247542025.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:43:43] [INFO ] Decomposing Gal with order
[2025-06-02 22:43:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:43:43] [INFO ] Removed a total of 518 redundant transitions.
[2025-06-02 22:43:43] [INFO ] Flatten gal took : 49 ms
[2025-06-02 22:43:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 4 ms.
[2025-06-02 22:43:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7327060875746233577.gal : 4 ms
[2025-06-02 22:43:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17290117983553246906.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/CTLFireability7327060875746233577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17290117983553246906.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 474 transition count 800
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 450 transition count 794
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 444 transition count 794
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 60 place count 444 transition count 776
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 96 place count 426 transition count 776
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 102 place count 420 transition count 770
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 420 transition count 770
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 156 place count 396 transition count 746
Applied a total of 156 rules in 50 ms. Remains 396 /476 variables (removed 80) and now considering 746/824 (removed 78) transitions.
Running 744 sub problems to find dead transitions.
[2025-06-02 22:44:13] [INFO ] Flow matrix only has 734 transitions (discarded 12 similar events)
// Phase 1: matrix 734 rows 396 cols
[2025-06-02 22:44:13] [INFO ] Computed 44 invariants in 8 ms
[2025-06-02 22:44:13] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:20] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:20] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:20] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:20] [INFO ] Deduced a trap composed of 52 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-02 22:44:20] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:20] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:20] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:21] [INFO ] Deduced a trap composed of 181 places in 221 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:21] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:22] [INFO ] Deduced a trap composed of 186 places in 219 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:22] [INFO ] Deduced a trap composed of 175 places in 206 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:22] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:31] [INFO ] Deduced a trap composed of 238 places in 215 ms of which 53 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1130 variables, and 55 constraints, problems are : Problem set: 0 solved, 744 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/396 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 744 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:45] [INFO ] Deduced a trap composed of 175 places in 226 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:44:50] [INFO ] Deduced a trap composed of 188 places in 202 ms of which 58 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1130 variables, and 57 constraints, problems are : Problem set: 0 solved, 744 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/396 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/744 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40565ms problems are : Problem set: 0 solved, 744 unsolved
Search for dead transitions found 0 dead transitions in 40567ms
[2025-06-02 22:44:54] [INFO ] Flow matrix only has 734 transitions (discarded 12 similar events)
[2025-06-02 22:44:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:44:54] [INFO ] Implicit Places using invariants in 795 ms returned [330, 331, 332, 333, 334, 335]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 798 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 390/476 places, 746/824 transitions.
Applied a total of 0 rules in 12 ms. Remains 390 /390 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41429 ms. Remains : 390/476 places, 746/824 transitions.
[2025-06-02 22:44:54] [INFO ] Flatten gal took : 20 ms
[2025-06-02 22:44:54] [INFO ] Flatten gal took : 21 ms
[2025-06-02 22:44:55] [INFO ] Input system was already deterministic with 746 transitions.
[2025-06-02 22:44:55] [INFO ] Flatten gal took : 21 ms
[2025-06-02 22:44:55] [INFO ] Flatten gal took : 22 ms
[2025-06-02 22:44:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9951970306135568591.gal : 10 ms
[2025-06-02 22:44:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3304733495887606691.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/CTLFireability9951970306135568591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3304733495887606691.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:45:25] [INFO ] Flatten gal took : 22 ms
[2025-06-02 22:45:25] [INFO ] Applying decomposition
[2025-06-02 22:45:25] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10272294599550408753.txt' '-o' '/tmp/graph10272294599550408753.bin' '-w' '/tmp/graph10272294599550408753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10272294599550408753.bin' '-l' '-1' '-v' '-w' '/tmp/graph10272294599550408753.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:45:25] [INFO ] Decomposing Gal with order
[2025-06-02 22:45:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:45:25] [INFO ] Removed a total of 582 redundant transitions.
[2025-06-02 22:45:25] [INFO ] Flatten gal took : 45 ms
[2025-06-02 22:45:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 5 ms.
[2025-06-02 22:45:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16701701332440749211.gal : 5 ms
[2025-06-02 22:45:25] [INFO ] Time to serialize properties into /tmp/CTLFireability968872100324051631.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/CTLFireability16701701332440749211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability968872100324051631.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 462 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 462 transition count 812
Applied a total of 26 rules in 18 ms. Remains 462 /476 variables (removed 14) and now considering 812/824 (removed 12) transitions.
Running 810 sub problems to find dead transitions.
[2025-06-02 22:45:55] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
// Phase 1: matrix 800 rows 462 cols
[2025-06-02 22:45:55] [INFO ] Computed 44 invariants in 15 ms
[2025-06-02 22:45:55] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:01] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:01] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:01] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:01] [INFO ] Deduced a trap composed of 63 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-02 22:46:01] [INFO ] Deduced a trap composed of 63 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-02 22:46:02] [INFO ] Deduced a trap composed of 217 places in 222 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:02] [INFO ] Deduced a trap composed of 121 places in 195 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:02] [INFO ] Deduced a trap composed of 242 places in 213 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:03] [INFO ] Deduced a trap composed of 222 places in 213 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:05] [INFO ] Deduced a trap composed of 63 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-02 22:46:06] [INFO ] Deduced a trap composed of 205 places in 237 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:07] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:09] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/1262 variables, and 55 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 810/810 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 810 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/460 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:25] [INFO ] Deduced a trap composed of 298 places in 257 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:46:31] [INFO ] Deduced a trap composed of 242 places in 252 ms of which 79 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 810 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/1262 variables, and 57 constraints, problems are : Problem set: 0 solved, 810 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/462 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/810 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40375ms problems are : Problem set: 0 solved, 810 unsolved
Search for dead transitions found 0 dead transitions in 40376ms
[2025-06-02 22:46:35] [INFO ] Flow matrix only has 800 transitions (discarded 12 similar events)
[2025-06-02 22:46:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:46:36] [INFO ] Implicit Places using invariants in 389 ms returned [366, 367, 368, 369, 370, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 393 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/476 places, 812/824 transitions.
Applied a total of 0 rules in 4 ms. Remains 456 /456 variables (removed 0) and now considering 812/812 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40794 ms. Remains : 456/476 places, 812/824 transitions.
[2025-06-02 22:46:36] [INFO ] Flatten gal took : 21 ms
[2025-06-02 22:46:36] [INFO ] Flatten gal took : 22 ms
[2025-06-02 22:46:36] [INFO ] Input system was already deterministic with 812 transitions.
[2025-06-02 22:46:36] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:46:36] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:46:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7895831214027328459.gal : 3 ms
[2025-06-02 22:46:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17201733679089086267.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/CTLFireability7895831214027328459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17201733679089086267.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:47:06] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:47:06] [INFO ] Applying decomposition
[2025-06-02 22:47:06] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5784584327867913871.txt' '-o' '/tmp/graph5784584327867913871.bin' '-w' '/tmp/graph5784584327867913871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5784584327867913871.bin' '-l' '-1' '-v' '-w' '/tmp/graph5784584327867913871.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:47:06] [INFO ] Decomposing Gal with order
[2025-06-02 22:47:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:47:06] [INFO ] Removed a total of 655 redundant transitions.
[2025-06-02 22:47:06] [INFO ] Flatten gal took : 44 ms
[2025-06-02 22:47:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 6 ms.
[2025-06-02 22:47:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17079213081424035792.gal : 5 ms
[2025-06-02 22:47:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3416108973642210927.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/CTLFireability17079213081424035792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3416108973642210927.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 420 transition count 770
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 108 place count 420 transition count 734
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 180 place count 384 transition count 734
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 276 place count 336 transition count 686
Applied a total of 276 rules in 21 ms. Remains 336 /476 variables (removed 140) and now considering 686/824 (removed 138) transitions.
Running 684 sub problems to find dead transitions.
[2025-06-02 22:47:36] [INFO ] Flow matrix only has 674 transitions (discarded 12 similar events)
// Phase 1: matrix 674 rows 336 cols
[2025-06-02 22:47:36] [INFO ] Computed 44 invariants in 9 ms
[2025-06-02 22:47:36] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 684 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 684 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:41] [INFO ] Deduced a trap composed of 42 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-02 22:47:41] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:41] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:41] [INFO ] Deduced a trap composed of 42 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-02 22:47:41] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:41] [INFO ] Deduced a trap composed of 121 places in 177 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:41] [INFO ] Deduced a trap composed of 126 places in 195 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:42] [INFO ] Deduced a trap composed of 115 places in 177 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:42] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:42] [INFO ] Deduced a trap composed of 42 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-02 22:47:43] [INFO ] Deduced a trap composed of 178 places in 159 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:47] [INFO ] Deduced a trap composed of 120 places in 167 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:47:47] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 684 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 334/1010 variables, and 55 constraints, problems are : Problem set: 0 solved, 684 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/336 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 684/684 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 684 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 684 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/334 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 684 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 684 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 334/1010 variables, and 55 constraints, problems are : Problem set: 0 solved, 684 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 31/32 constraints, State Equation: 0/336 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/684 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40399ms problems are : Problem set: 0 solved, 684 unsolved
Search for dead transitions found 0 dead transitions in 40400ms
[2025-06-02 22:48:17] [INFO ] Flow matrix only has 674 transitions (discarded 12 similar events)
[2025-06-02 22:48:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:48:17] [INFO ] Implicit Places using invariants in 820 ms returned [300, 301, 302, 303, 304, 305]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 822 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 330/476 places, 686/824 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 324 transition count 680
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 324 transition count 680
Applied a total of 12 rules in 13 ms. Remains 324 /330 variables (removed 6) and now considering 680/686 (removed 6) transitions.
[2025-06-02 22:48:17] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
// Phase 1: matrix 668 rows 324 cols
[2025-06-02 22:48:17] [INFO ] Computed 38 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:48:18] [INFO ] Implicit Places using invariants in 872 ms returned []
[2025-06-02 22:48:18] [INFO ] Flow matrix only has 668 transitions (discarded 12 similar events)
[2025-06-02 22:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:48:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:48:22] [INFO ] Implicit Places using invariants and state equation in 3397 ms returned []
Implicit Place search using SMT with State Equation took 4271 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 324/476 places, 680/824 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 45533 ms. Remains : 324/476 places, 680/824 transitions.
[2025-06-02 22:48:22] [INFO ] Flatten gal took : 21 ms
[2025-06-02 22:48:22] [INFO ] Flatten gal took : 21 ms
[2025-06-02 22:48:22] [INFO ] Input system was already deterministic with 680 transitions.
[2025-06-02 22:48:22] [INFO ] Flatten gal took : 35 ms
[2025-06-02 22:48:22] [INFO ] Flatten gal took : 24 ms
[2025-06-02 22:48:22] [INFO ] Time to serialize gal into /tmp/CTLFireability5353841878052495530.gal : 3 ms
[2025-06-02 22:48:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5338894130011177862.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/CTLFireability5353841878052495530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5338894130011177862.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:48:52] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:48:52] [INFO ] Applying decomposition
[2025-06-02 22:48:52] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3496763743585633450.txt' '-o' '/tmp/graph3496763743585633450.bin' '-w' '/tmp/graph3496763743585633450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3496763743585633450.bin' '-l' '-1' '-v' '-w' '/tmp/graph3496763743585633450.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:48:52] [INFO ] Decomposing Gal with order
[2025-06-02 22:48:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:48:52] [INFO ] Removed a total of 548 redundant transitions.
[2025-06-02 22:48:52] [INFO ] Flatten gal took : 43 ms
[2025-06-02 22:48:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 5 ms.
[2025-06-02 22:48:52] [INFO ] Time to serialize gal into /tmp/CTLFireability13438953925675520164.gal : 5 ms
[2025-06-02 22:48:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16859551269987075367.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/CTLFireability13438953925675520164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16859551269987075367.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Applied a total of 14 rules in 16 ms. Remains 468 /476 variables (removed 8) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2025-06-02 22:49:22] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 468 cols
[2025-06-02 22:49:22] [INFO ] Computed 44 invariants in 13 ms
[2025-06-02 22:49:22] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:30] [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-02 22:49:31] [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-02 22:49:31] [INFO ] Deduced a trap composed of 64 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-02 22:49:31] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:32] [INFO ] Deduced a trap composed of 64 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-02 22:49:33] [INFO ] Deduced a trap composed of 64 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-02 22:49:34] [INFO ] Deduced a trap composed of 205 places in 224 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:34] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:36] [INFO ] Deduced a trap composed of 223 places in 211 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:37] [INFO ] Deduced a trap composed of 223 places in 241 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:37] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:38] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:38] [INFO ] Deduced a trap composed of 235 places in 249 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:39] [INFO ] Deduced a trap composed of 127 places in 253 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:41] [INFO ] Deduced a trap composed of 194 places in 232 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:42] [INFO ] Deduced a trap composed of 228 places in 227 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:42] [INFO ] Deduced a trap composed of 282 places in 225 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:43] [INFO ] Deduced a trap composed of 288 places in 246 ms of which 86 ms to minimize.
SMT process timed out in 20470ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 20471ms
[2025-06-02 22:49:43] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:49:43] [INFO ] Implicit Places using invariants in 352 ms returned []
[2025-06-02 22:49:43] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:49:43] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:49:47] [INFO ] Implicit Places using invariants and state equation in 4302 ms returned []
Implicit Place search using SMT with State Equation took 4655 ms to find 0 implicit places.
Running 816 sub problems to find dead transitions.
[2025-06-02 22:49:47] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:49:47] [INFO ] Invariant cache hit.
[2025-06-02 22:49:47] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:54] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:54] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:55] [INFO ] Deduced a trap composed of 64 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-02 22:49:55] [INFO ] Deduced a trap composed of 64 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-02 22:49:55] [INFO ] Deduced a trap composed of 64 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-02 22:49:55] [INFO ] Deduced a trap composed of 127 places in 209 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:56] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:49:56] [INFO ] Deduced a trap composed of 64 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-02 22:50:00] [INFO ] Deduced a trap composed of 205 places in 242 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:00] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:02] [INFO ] Deduced a trap composed of 223 places in 225 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:03] [INFO ] Deduced a trap composed of 224 places in 238 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:03] [INFO ] Deduced a trap composed of 224 places in 233 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:03] [INFO ] Deduced a trap composed of 223 places in 254 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:04] [INFO ] Deduced a trap composed of 235 places in 231 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:07] [INFO ] Deduced a trap composed of 194 places in 236 ms of which 62 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:08] [INFO ] Deduced a trap composed of 217 places in 256 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:16] [INFO ] Deduced a trap composed of 248 places in 232 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1274 variables, and 60 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:33] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:35] [INFO ] Deduced a trap composed of 92 places in 240 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:50:35] [INFO ] Deduced a trap composed of 228 places in 171 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 7)
(s1 3)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 2)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 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 9)
(s123 1)
(s124 0)
(s125 1)
(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 1)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1274 variables, and 63 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60383ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Starting structural reductions in LTL mode, iteration 1 : 468/476 places, 818/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85538 ms. Remains : 468/476 places, 818/824 transitions.
[2025-06-02 22:50:48] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:50:48] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:50:48] [INFO ] Input system was already deterministic with 818 transitions.
[2025-06-02 22:50:48] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:50:48] [INFO ] Flatten gal took : 28 ms
[2025-06-02 22:50:48] [INFO ] Time to serialize gal into /tmp/CTLFireability3633001057537942881.gal : 4 ms
[2025-06-02 22:50:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15942689061455095478.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/CTLFireability3633001057537942881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15942689061455095478.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:51:18] [INFO ] Flatten gal took : 24 ms
[2025-06-02 22:51:18] [INFO ] Applying decomposition
[2025-06-02 22:51:18] [INFO ] Flatten gal took : 24 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/graph14010286474098625423.txt' '-o' '/tmp/graph14010286474098625423.bin' '-w' '/tmp/graph14010286474098625423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14010286474098625423.bin' '-l' '-1' '-v' '-w' '/tmp/graph14010286474098625423.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:51:18] [INFO ] Decomposing Gal with order
[2025-06-02 22:51:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:51:18] [INFO ] Removed a total of 477 redundant transitions.
[2025-06-02 22:51:18] [INFO ] Flatten gal took : 44 ms
[2025-06-02 22:51:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 8 ms.
[2025-06-02 22:51:18] [INFO ] Time to serialize gal into /tmp/CTLFireability16853948228084721498.gal : 6 ms
[2025-06-02 22:51:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17699428252234353560.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/CTLFireability16853948228084721498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17699428252234353560.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 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 468 transition count 818
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 468 transition count 818
Applied a total of 14 rules in 12 ms. Remains 468 /476 variables (removed 8) and now considering 818/824 (removed 6) transitions.
Running 816 sub problems to find dead transitions.
[2025-06-02 22:51:48] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:51:48] [INFO ] Invariant cache hit.
[2025-06-02 22:51:48] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:55] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:55] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:55] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:56] [INFO ] Deduced a trap composed of 64 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-02 22:51:56] [INFO ] Deduced a trap composed of 64 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-02 22:51:56] [INFO ] Deduced a trap composed of 127 places in 203 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:57] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:51:57] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:01] [INFO ] Deduced a trap composed of 205 places in 233 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:01] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:03] [INFO ] Deduced a trap composed of 223 places in 231 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:03] [INFO ] Deduced a trap composed of 224 places in 234 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:04] [INFO ] Deduced a trap composed of 224 places in 246 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:04] [INFO ] Deduced a trap composed of 223 places in 262 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:05] [INFO ] Deduced a trap composed of 235 places in 250 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:07] [INFO ] Deduced a trap composed of 194 places in 247 ms of which 61 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:09] [INFO ] Deduced a trap composed of 217 places in 264 ms of which 91 ms to minimize.
SMT process timed out in 20492ms, After SMT, problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 20506ms
[2025-06-02 22:52:09] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:52:09] [INFO ] Implicit Places using invariants in 357 ms returned []
[2025-06-02 22:52:09] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:52:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 22:52:14] [INFO ] Implicit Places using invariants and state equation in 4404 ms returned []
Implicit Place search using SMT with State Equation took 4764 ms to find 0 implicit places.
Running 816 sub problems to find dead transitions.
[2025-06-02 22:52:14] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2025-06-02 22:52:14] [INFO ] Invariant cache hit.
[2025-06-02 22:52:14] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:21] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:21] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:21] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:21] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:21] [INFO ] Deduced a trap composed of 64 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-02 22:52:21] [INFO ] Deduced a trap composed of 127 places in 268 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:22] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:23] [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-02 22:52:26] [INFO ] Deduced a trap composed of 205 places in 218 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:26] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:29] [INFO ] Deduced a trap composed of 223 places in 225 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:29] [INFO ] Deduced a trap composed of 224 places in 245 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:29] [INFO ] Deduced a trap composed of 224 places in 225 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:30] [INFO ] Deduced a trap composed of 223 places in 266 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:30] [INFO ] Deduced a trap composed of 235 places in 250 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:33] [INFO ] Deduced a trap composed of 194 places in 231 ms of which 62 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:34] [INFO ] Deduced a trap composed of 217 places in 277 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:43] [INFO ] Deduced a trap composed of 248 places in 242 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/1274 variables, and 60 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:52:59] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:01] [INFO ] Deduced a trap composed of 92 places in 243 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:53:01] [INFO ] Deduced a trap composed of 228 places in 160 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/1274 variables, and 63 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/468 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60374ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 60376ms
Starting structural reductions in LTL mode, iteration 1 : 468/476 places, 818/824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85664 ms. Remains : 468/476 places, 818/824 transitions.
[2025-06-02 22:53:14] [INFO ] Flatten gal took : 22 ms
[2025-06-02 22:53:14] [INFO ] Flatten gal took : 23 ms
[2025-06-02 22:53:14] [INFO ] Input system was already deterministic with 818 transitions.
[2025-06-02 22:53:14] [INFO ] Flatten gal took : 24 ms
[2025-06-02 22:53:14] [INFO ] Flatten gal took : 31 ms
[2025-06-02 22:53:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17290098121502494168.gal : 4 ms
[2025-06-02 22:53:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7173660434932923507.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/CTLFireability17290098121502494168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7173660434932923507.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 22:53:44] [INFO ] Flatten gal took : 24 ms
[2025-06-02 22:53:44] [INFO ] Applying decomposition
[2025-06-02 22:53:44] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16370233248962406452.txt' '-o' '/tmp/graph16370233248962406452.bin' '-w' '/tmp/graph16370233248962406452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16370233248962406452.bin' '-l' '-1' '-v' '-w' '/tmp/graph16370233248962406452.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:53:44] [INFO ] Decomposing Gal with order
[2025-06-02 22:53:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:53:44] [INFO ] Removed a total of 535 redundant transitions.
[2025-06-02 22:53:44] [INFO ] Flatten gal took : 43 ms
[2025-06-02 22:53:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 8 ms.
[2025-06-02 22:53:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5714367047694517545.gal : 5 ms
[2025-06-02 22:53:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13386848927449452388.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/CTLFireability5714367047694517545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13386848927449452388.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.
[2025-06-02 22:54:14] [INFO ] Flatten gal took : 53 ms
[2025-06-02 22:54:15] [INFO ] Flatten gal took : 32 ms
[2025-06-02 22:54:15] [INFO ] Applying decomposition
[2025-06-02 22:54:15] [INFO ] Flatten gal took : 31 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/graph5483566053294065023.txt' '-o' '/tmp/graph5483566053294065023.bin' '-w' '/tmp/graph5483566053294065023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5483566053294065023.bin' '-l' '-1' '-v' '-w' '/tmp/graph5483566053294065023.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:54:15] [INFO ] Decomposing Gal with order
[2025-06-02 22:54:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:54:15] [INFO ] Removed a total of 584 redundant transitions.
[2025-06-02 22:54:15] [INFO ] Flatten gal took : 56 ms
[2025-06-02 22:54:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 7 ms.
[2025-06-02 22:54:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10808716127784240738.gal : 6 ms
[2025-06-02 22:54:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15274471883688989655.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/CTLFireability10808716127784240738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15274471883688989655.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 12 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40755e+08,205.667,2773628,15157,50048,2.22808e+06,2.85507e+06,2043,6.40953e+06,881,1.71208e+07,0
Converting to forward existential form...Done !
original formula: EF(EX(((AX(((((i12.i0.u42.Insert_Source_E_4>=1)||(i13.i1.u35.Insert_Source_E_5>=1))||((i10.i0.u40.Insert_Source_E_0>=1)||(i6.u41.Insert_S...3295
=> equivalent forward existential formula: [(((EY(FwdU(Init,TRUE)) * ((((((i4.u36.Insert_Source_B_0>=1)||(i4.u3.Insert_Source_B_1>=1))||((i3.i1.u37.Insert_...3359
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t11, t18, t19, t20, t21, t23, t24, t25, t27, t28, t29, t46, t330, t603, t604...1418
(forward)formula 0,0,241.841,2773628,1,0,2.22808e+06,2.91932e+06,10457,6.40953e+06,8275,1.72647e+07,6643448
FORMULA PolyORBLF-COL-S02J04T06-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EF(((((((A((((AG((((((((i5.i0.u30.PollingAbort>=1)&&(i5.i0.u30.BlockedTasks>=1))&&(i3.i0.u7.DisablePollingB_6>=1))||(((i5.i0.u30.Polling...9587
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U ((((((!((E(!(EG((((((i13.i1.u35.EnablePollingB_5>=1)&&(i5.i0.u30.cPollingAbort>=1))||(...10812
(forward)formula 1,1,258.153,2782004,1,0,2.22808e+06,3.85347e+06,11571,6.40953e+06,8379,1.88686e+07,7115378
FORMULA PolyORBLF-COL-S02J04T06-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A((!((!(((EX((((((((i8.u51.CanInjectEvent>=1)&&(i5.i0.u30.Check_Sources_B_0>=1))&&(i8.u51.ModifiedSrc_1>=1))||(((i8.u51.CanInjectEvent>=1...15660
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((!(!(EX(!((((((i5.i0.u2.cBlockedTasks>=1)&&(i5.i0.u30.ScheduleTaskE_Check_5>=1))||((i5.i...48478
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-06-02 22:59:19] [INFO ] Applying decomposition
[2025-06-02 22:59:19] [INFO ] Flatten gal took : 31 ms
[2025-06-02 22:59:19] [INFO ] Decomposing Gal with order
[2025-06-02 22:59:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:59:19] [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],[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],[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],
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-02 22:59:19] [INFO ] Flatten gal took : 57 ms
[2025-06-02 22:59:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14442898240447599648.gal : 4 ms
[2025-06-02 22:59:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8675114542403670194.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14442898240447599648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8675114542403670194.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 10 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 23:28:00] [INFO ] Flatten gal took : 200 ms
[2025-06-02 23:28:01] [INFO ] Input system was already deterministic with 824 transitions.
[2025-06-02 23:28:01] [INFO ] Transformed 476 places.
[2025-06-02 23:28:01] [INFO ] Transformed 824 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
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-S02J04T06"
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-S02J04T06, 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-174881253700266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;