About the Execution of ITS-Tools for PolyORBLF-COL-S02J04T08
| 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 | FFT??F?TTFFFT??? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700273.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-S02J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700273
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K 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-S02J04T08-CTLCardinality-2025-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-CTLCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748907175727
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-06-02 23:32:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 23:32:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 23:32:57] [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 23:32:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 23:32:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 633 ms
[2025-06-02 23:32:57] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2025-06-02 23:32:57] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 23:32:57] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (13 resets) in 1832 ms. (21 steps per ms) remains 66/79 properties
BEST_FIRST walk for 4000 steps (8 resets) in 72 ms. (54 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 84 ms. (47 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (9 resets) in 44 ms. (88 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (9 resets) in 35 ms. (111 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (9 resets) in 50 ms. (78 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (9 resets) in 46 ms. (85 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (9 resets) in 43 ms. (90 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (9 resets) in 41 ms. (95 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (9 resets) in 43 ms. (90 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (9 resets) in 45 ms. (86 steps per ms) remains 66/66 properties
[2025-06-02 23:32:59] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 23:32:59] [INFO ] Computed 26 invariants in 20 ms
[2025-06-02 23:32:59] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 59 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 2/6 constraints. Problems are: Problem set: 8 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 58 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 3 (OVERLAPS) 18/71 variables, 6/12 constraints. Problems are: Problem set: 40 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/13 constraints. Problems are: Problem set: 40 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 40 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 1/72 variables, 1/14 constraints. Problems are: Problem set: 40 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 40 solved, 26 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 8 (OVERLAPS) 9/81 variables, 12/26 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 62 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 62 solved, 4 unsolved in 725 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: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 62 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 4/4 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/49 variables, 4/8 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/50 variables, 1/9 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 62 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:00] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:00] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/78 variables, 3/26 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/79 variables, 1/27 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 64/143 variables, 79/106 constraints. Problems are: Problem set: 62 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 8/114 constraints. Problems are: Problem set: 62 solved, 4 unsolved
Problem AtomicPropp57 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 4/118 constraints. Problems are: Problem set: 63 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 0/118 constraints. Problems are: Problem set: 63 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/145 variables, 2/120 constraints. Problems are: Problem set: 63 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 1/121 constraints. Problems are: Problem set: 63 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 0/121 constraints. Problems are: Problem set: 63 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/145 variables, 0/121 constraints. Problems are: Problem set: 63 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 121 constraints, problems are : Problem set: 63 solved, 3 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/66 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1336ms problems are : Problem set: 63 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1619 ms.
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 31 place count 65 transition count 50
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 65 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 63 transition count 48
Applied a total of 35 rules in 29 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 23:33:02] [INFO ] Flow matrix only has 47 transitions (discarded 1 similar events)
// Phase 1: matrix 47 rows 63 cols
[2025-06-02 23:33:02] [INFO ] Computed 25 invariants in 4 ms
[2025-06-02 23:33:02] [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 23:33:02] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:02] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:02] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:02] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/29 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 23:33:02] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:02] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:02] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:03] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:03] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 5/34 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 23:33:03] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 1/35 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 23:33:03] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 1/36 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 47/110 variables, 63/99 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 8/107 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 23:33:03] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 1/108 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 13 (OVERLAPS) 0/110 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 108 constraints, problems are : Problem set: 2 solved, 45 unsolved in 2115 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: 12/12 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, 8/32 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 4/37 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 23:33:04] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:04] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 2/39 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 47/110 variables, 63/102 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 8/110 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 45/155 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 155 constraints, problems are : Problem set: 2 solved, 45 unsolved in 2579 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: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4715ms problems are : Problem set: 2 solved, 45 unsolved
Search for dead transitions found 2 dead transitions in 4716ms
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 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 59 transition count 42
Applied a total of 4 rules in 10 ms. Remains 59 /63 variables (removed 4) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4767 ms. Remains : 59/81 places, 42/65 transitions.
RANDOM walk for 40000 steps (34 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 37112 steps (8 resets) in 111 ms. (331 steps per ms) remains 0/3 properties
Successfully simplified 63 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 23:33:07] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2025-06-02 23:33:07] [INFO ] Flatten gal took : 29 ms
[2025-06-02 23:33:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 23:33:07] [INFO ] Flatten gal took : 7 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 23:33:07] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 30 ms.
[2025-06-02 23:33:07] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 155 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Applied a total of 2 rules in 35 ms. Remains 612 /614 variables (removed 2) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2025-06-02 23:33:07] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2025-06-02 23:33:07] [INFO ] Computed 48 invariants in 47 ms
[2025-06-02 23:33:07] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:19] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:19] [INFO ] Deduced a trap composed of 65 places in 147 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:19] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:20] [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 23:33:20] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33: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 23:33:20] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:21] [INFO ] Deduced a trap composed of 175 places in 335 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:22] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 55 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:31] [INFO ] Deduced a trap composed of 266 places in 364 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:39] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:43] [INFO ] Deduced a trap composed of 295 places in 331 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:44] [INFO ] Deduced a trap composed of 47 places in 281 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:45] [INFO ] Deduced a trap composed of 311 places in 319 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:33:47] [INFO ] Deduced a trap composed of 338 places in 331 ms of which 99 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 61 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40933ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 40939ms
[2025-06-02 23:33:48] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 23:33:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:33:48] [INFO ] Implicit Places using invariants in 571 ms returned []
[2025-06-02 23:33:48] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 23:33:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:33:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 23:33:59] [INFO ] Implicit Places using invariants and state equation in 11016 ms returned []
Implicit Place search using SMT with State Equation took 11596 ms to find 0 implicit places.
Running 1112 sub problems to find dead transitions.
[2025-06-02 23:33:59] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 23:33:59] [INFO ] Invariant cache hit.
[2025-06-02 23:33:59] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:13] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:15] [INFO ] Deduced a trap composed of 65 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 23:34:15] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:15] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:15] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:15] [INFO ] Deduced a trap composed of 65 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 23:34:15] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:17] [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 23:34:19] [INFO ] Deduced a trap composed of 285 places in 358 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:19] [INFO ] Deduced a trap composed of 293 places in 376 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:24] [INFO ] Deduced a trap composed of 54 places in 282 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:25] [INFO ] Deduced a trap composed of 311 places in 352 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:25] [INFO ] Deduced a trap composed of 269 places in 329 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:26] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:26] [INFO ] Deduced a trap composed of 295 places in 315 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:27] [INFO ] Deduced a trap composed of 175 places in 315 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:30] [INFO ] Deduced a trap composed of 380 places in 384 ms of which 147 ms to minimize.
SMT process timed out in 30849ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 30854ms
Starting structural reductions in LTL mode, iteration 1 : 612/614 places, 1114/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83442 ms. Remains : 612/614 places, 1114/1114 transitions.
Support contains 155 out of 612 places after structural reductions.
[2025-06-02 23:34:30] [INFO ] Flatten gal took : 86 ms
[2025-06-02 23:34:30] [INFO ] Flatten gal took : 72 ms
[2025-06-02 23:34:30] [INFO ] Input system was already deterministic with 1114 transitions.
RANDOM walk for 40000 steps (11 resets) in 641 ms. (62 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
[2025-06-02 23:34:31] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 23:34:31] [INFO ] Invariant cache hit.
[2025-06-02 23:34:31] [INFO ] State equation strengthened by 96 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/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 450/555 variables, 12/12 constraints. Problems are: Problem set: 10 solved, 5 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 3/15 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/556 variables, 1/16 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/16 constraints. Problems are: Problem set: 11 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 612/1710 variables, and 48 constraints, problems are : Problem set: 15 solved, 0 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 15 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 15 atomic propositions for a total of 6 simplifications.
[2025-06-02 23:34:31] [INFO ] Flatten gal took : 55 ms
[2025-06-02 23:34:31] [INFO ] Flatten gal took : 50 ms
[2025-06-02 23:34:31] [INFO ] Input system was already deterministic with 1114 transitions.
Support contains 49 out of 612 places (down from 60) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 46 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2025-06-02 23:34:31] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2025-06-02 23:34:31] [INFO ] Computed 48 invariants in 22 ms
[2025-06-02 23:34:32] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:44] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:44] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:44] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:44] [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 23:34:44] [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 23:34:44] [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 23:34:44] [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 23:34:45] [INFO ] Deduced a trap composed of 285 places in 287 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:45] [INFO ] Deduced a trap composed of 159 places in 282 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:45] [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 23:34:46] [INFO ] Deduced a trap composed of 292 places in 357 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:47] [INFO ] Deduced a trap composed of 269 places in 350 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:47] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:34:52] [INFO ] Deduced a trap composed of 269 places in 313 ms of which 87 ms to minimize.
SMT process timed out in 20596ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 20598ms
[2025-06-02 23:34:52] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 23:34:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:34:53] [INFO ] Implicit Places using invariants in 932 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 935 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 12 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21598 ms. Remains : 588/612 places, 1098/1114 transitions.
[2025-06-02 23:34:53] [INFO ] Flatten gal took : 39 ms
[2025-06-02 23:34:53] [INFO ] Flatten gal took : 40 ms
[2025-06-02 23:34:53] [INFO ] Input system was already deterministic with 1098 transitions.
[2025-06-02 23:34:53] [INFO ] Flatten gal took : 38 ms
[2025-06-02 23:34:53] [INFO ] Flatten gal took : 39 ms
[2025-06-02 23:34:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality13949519752950949597.gal : 25 ms
[2025-06-02 23:34:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality16575391129154531205.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/CTLCardinality13949519752950949597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16575391129154531205.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 23:35:23] [INFO ] Flatten gal took : 37 ms
[2025-06-02 23:35:23] [INFO ] Applying decomposition
[2025-06-02 23:35:23] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1194194165723088645.txt' '-o' '/tmp/graph1194194165723088645.bin' '-w' '/tmp/graph1194194165723088645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1194194165723088645.bin' '-l' '-1' '-v' '-w' '/tmp/graph1194194165723088645.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:35:24] [INFO ] Decomposing Gal with order
[2025-06-02 23:35:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:35:24] [INFO ] Removed a total of 702 redundant transitions.
[2025-06-02 23:35:24] [INFO ] Flatten gal took : 183 ms
[2025-06-02 23:35:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 35 ms.
[2025-06-02 23:35:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality13512471538451681262.gal : 16 ms
[2025-06-02 23:35:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality14721768926986169781.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/CTLCardinality13512471538451681262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14721768926986169781.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 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 37 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2025-06-02 23:35:54] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 23:35:54] [INFO ] Invariant cache hit.
[2025-06-02 23:35:54] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:06] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:06] [INFO ] Deduced a trap composed of 63 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 23:36:06] [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 23:36:06] [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 23:36:06] [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 23:36:06] [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 23:36:06] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:07] [INFO ] Deduced a trap composed of 159 places in 300 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:08] [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 23:36:14] [INFO ] Deduced a trap composed of 269 places in 334 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:15] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 57 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:20] [INFO ] Deduced a trap composed of 250 places in 300 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:27] [INFO ] Deduced a trap composed of 287 places in 353 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:27] [INFO ] Deduced a trap composed of 79 places in 297 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:36:27] [INFO ] Deduced a trap composed of 394 places in 325 ms of which 98 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40616ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 40619ms
[2025-06-02 23:36:35] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 23:36:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:36:36] [INFO ] Implicit Places using invariants in 937 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 940 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 9 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41608 ms. Remains : 588/612 places, 1098/1114 transitions.
[2025-06-02 23:36:36] [INFO ] Flatten gal took : 34 ms
[2025-06-02 23:36:36] [INFO ] Flatten gal took : 35 ms
[2025-06-02 23:36:36] [INFO ] Input system was already deterministic with 1098 transitions.
[2025-06-02 23:36:36] [INFO ] Flatten gal took : 34 ms
[2025-06-02 23:36:36] [INFO ] Flatten gal took : 33 ms
[2025-06-02 23:36:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality15701313597394630342.gal : 5 ms
[2025-06-02 23:36:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality1751653911973080349.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/CTLCardinality15701313597394630342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1751653911973080349.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 23:37:06] [INFO ] Flatten gal took : 36 ms
[2025-06-02 23:37:06] [INFO ] Applying decomposition
[2025-06-02 23:37:06] [INFO ] Flatten gal took : 64 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/graph17911247585844648145.txt' '-o' '/tmp/graph17911247585844648145.bin' '-w' '/tmp/graph17911247585844648145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17911247585844648145.bin' '-l' '-1' '-v' '-w' '/tmp/graph17911247585844648145.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:37:06] [INFO ] Decomposing Gal with order
[2025-06-02 23:37:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:37:06] [INFO ] Removed a total of 877 redundant transitions.
[2025-06-02 23:37:06] [INFO ] Flatten gal took : 99 ms
[2025-06-02 23:37:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 39 ms.
[2025-06-02 23:37:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality12511181902381190648.gal : 18 ms
[2025-06-02 23:37:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality2146124869177611255.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/CTLCardinality12511181902381190648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2146124869177611255.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 39 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2025-06-02 23:37:37] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 23:37:37] [INFO ] Invariant cache hit.
[2025-06-02 23:37:37] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:49] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:49] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:49] [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 23:37:49] [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 23:37:49] [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 23:37:49] [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 23:37:49] [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 23:37:50] [INFO ] Deduced a trap composed of 159 places in 309 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:37:51] [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 23:37:57] [INFO ] Deduced a trap composed of 269 places in 324 ms of which 80 ms to minimize.
SMT process timed out in 20607ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 20609ms
[2025-06-02 23:37:57] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 23:37:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:37:58] [INFO ] Implicit Places using invariants in 922 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 924 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 588/612 places, 1098/1114 transitions.
Applied a total of 0 rules in 9 ms. Remains 588 /588 variables (removed 0) and now considering 1098/1098 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21585 ms. Remains : 588/612 places, 1098/1114 transitions.
[2025-06-02 23:37:58] [INFO ] Flatten gal took : 32 ms
[2025-06-02 23:37:58] [INFO ] Flatten gal took : 33 ms
[2025-06-02 23:37:58] [INFO ] Input system was already deterministic with 1098 transitions.
[2025-06-02 23:37:58] [INFO ] Flatten gal took : 32 ms
[2025-06-02 23:37:58] [INFO ] Flatten gal took : 32 ms
[2025-06-02 23:37:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1913376290510922136.gal : 7 ms
[2025-06-02 23:37:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality15665727509202942088.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/CTLCardinality1913376290510922136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15665727509202942088.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 23:38:28] [INFO ] Flatten gal took : 33 ms
[2025-06-02 23:38:28] [INFO ] Applying decomposition
[2025-06-02 23:38:29] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4379441347988322497.txt' '-o' '/tmp/graph4379441347988322497.bin' '-w' '/tmp/graph4379441347988322497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4379441347988322497.bin' '-l' '-1' '-v' '-w' '/tmp/graph4379441347988322497.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:38:29] [INFO ] Decomposing Gal with order
[2025-06-02 23:38:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:38:29] [INFO ] Removed a total of 778 redundant transitions.
[2025-06-02 23:38:29] [INFO ] Flatten gal took : 84 ms
[2025-06-02 23:38:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 306 labels/synchronizations in 26 ms.
[2025-06-02 23:38:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality14937898876175153242.gal : 14 ms
[2025-06-02 23:38:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality571778376154194859.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/CTLCardinality14937898876175153242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality571778376154194859.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 : 612/612 places, 1114/1114 transitions.
Applied a total of 0 rules in 13 ms. Remains 612 /612 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2025-06-02 23:38:59] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2025-06-02 23:38:59] [INFO ] Computed 48 invariants in 27 ms
[2025-06-02 23:38:59] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:11] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:11] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:11] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:12] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:12] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:12] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:12] [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 23:39:13] [INFO ] Deduced a trap composed of 175 places in 309 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:14] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 55 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:22] [INFO ] Deduced a trap composed of 266 places in 353 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:31] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:35] [INFO ] Deduced a trap composed of 295 places in 311 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:36] [INFO ] Deduced a trap composed of 47 places in 295 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:36] [INFO ] Deduced a trap composed of 311 places in 334 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:39:39] [INFO ] Deduced a trap composed of 338 places in 332 ms of which 100 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 61 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40616ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 40619ms
[2025-06-02 23:39:40] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 23:39:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:39:40] [INFO ] Implicit Places using invariants in 865 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 869 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 604/612 places, 1114/1114 transitions.
Applied a total of 0 rules in 14 ms. Remains 604 /604 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41519 ms. Remains : 604/612 places, 1114/1114 transitions.
[2025-06-02 23:39:40] [INFO ] Flatten gal took : 28 ms
[2025-06-02 23:39:40] [INFO ] Flatten gal took : 29 ms
[2025-06-02 23:39:41] [INFO ] Input system was already deterministic with 1114 transitions.
[2025-06-02 23:39:41] [INFO ] Flatten gal took : 29 ms
[2025-06-02 23:39:41] [INFO ] Flatten gal took : 30 ms
[2025-06-02 23:39:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality5694255395056314622.gal : 7 ms
[2025-06-02 23:39:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality9166855428261338537.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/CTLCardinality5694255395056314622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9166855428261338537.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 23:40:11] [INFO ] Flatten gal took : 31 ms
[2025-06-02 23:40:11] [INFO ] Applying decomposition
[2025-06-02 23:40:11] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15110711000698836130.txt' '-o' '/tmp/graph15110711000698836130.bin' '-w' '/tmp/graph15110711000698836130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15110711000698836130.bin' '-l' '-1' '-v' '-w' '/tmp/graph15110711000698836130.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:40:11] [INFO ] Decomposing Gal with order
[2025-06-02 23:40:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:40:11] [INFO ] Removed a total of 1189 redundant transitions.
[2025-06-02 23:40:11] [INFO ] Flatten gal took : 86 ms
[2025-06-02 23:40:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 586 labels/synchronizations in 23 ms.
[2025-06-02 23:40:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality15786758519829921243.gal : 9 ms
[2025-06-02 23:40:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality407501055447351547.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/CTLCardinality15786758519829921243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality407501055447351547.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 612 transition count 1066
Reduce places removed 48 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 104 place count 564 transition count 1058
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 556 transition count 1058
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 112 place count 556 transition count 994
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 240 place count 492 transition count 994
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 368 place count 428 transition count 930
Applied a total of 368 rules in 114 ms. Remains 428 /612 variables (removed 184) and now considering 930/1114 (removed 184) transitions.
Running 928 sub problems to find dead transitions.
[2025-06-02 23:40:41] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
// Phase 1: matrix 914 rows 428 cols
[2025-06-02 23:40:41] [INFO ] Computed 48 invariants in 11 ms
[2025-06-02 23:40:41] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:50] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:50] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:50] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:50] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:50] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:50] [INFO ] Deduced a trap composed of 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 23:40:50] [INFO ] Deduced a trap composed of 42 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 23:40:51] [INFO ] Deduced a trap composed of 157 places in 242 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:51] [INFO ] Deduced a trap composed of 164 places in 247 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:51] [INFO ] Deduced a trap composed of 149 places in 233 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:51] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:52] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:52] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:52] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:52] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:53] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:53] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:40:54] [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 23:40:59] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1342 variables, and 65 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 34/35 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 928/928 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 928 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 928 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1342 variables, and 65 constraints, problems are : Problem set: 0 solved, 928 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 34/35 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/928 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40620ms problems are : Problem set: 0 solved, 928 unsolved
Search for dead transitions found 0 dead transitions in 40623ms
[2025-06-02 23:41:22] [INFO ] Flow matrix only has 914 transitions (discarded 16 similar events)
[2025-06-02 23:41:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:41:23] [INFO ] Implicit Places using invariants in 1268 ms returned [366, 367, 368, 369, 370, 371, 372, 373]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1271 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 420/612 places, 930/1114 transitions.
Applied a total of 0 rules in 24 ms. Remains 420 /420 variables (removed 0) and now considering 930/930 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 42034 ms. Remains : 420/612 places, 930/1114 transitions.
[2025-06-02 23:41:23] [INFO ] Flatten gal took : 43 ms
[2025-06-02 23:41:23] [INFO ] Flatten gal took : 49 ms
[2025-06-02 23:41:23] [INFO ] Input system was already deterministic with 930 transitions.
[2025-06-02 23:41:23] [INFO ] Flatten gal took : 46 ms
[2025-06-02 23:41:24] [INFO ] Flatten gal took : 39 ms
[2025-06-02 23:41:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality16961283150728217975.gal : 6 ms
[2025-06-02 23:41:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality3385936131080650619.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/CTLCardinality16961283150728217975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3385936131080650619.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 23:41:54] [INFO ] Flatten gal took : 33 ms
[2025-06-02 23:41:54] [INFO ] Applying decomposition
[2025-06-02 23:41:54] [INFO ] Flatten gal took : 32 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/graph16469098167887867446.txt' '-o' '/tmp/graph16469098167887867446.bin' '-w' '/tmp/graph16469098167887867446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16469098167887867446.bin' '-l' '-1' '-v' '-w' '/tmp/graph16469098167887867446.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:41:54] [INFO ] Decomposing Gal with order
[2025-06-02 23:41:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:41:54] [INFO ] Removed a total of 684 redundant transitions.
[2025-06-02 23:41:54] [INFO ] Flatten gal took : 78 ms
[2025-06-02 23:41:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 339 labels/synchronizations in 26 ms.
[2025-06-02 23:41:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6022598727424577765.gal : 9 ms
[2025-06-02 23:41:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11045514141617332221.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/CTLCardinality6022598727424577765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11045514141617332221.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.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 540 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 144 place count 540 transition count 978
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 272 place count 476 transition count 978
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 412 transition count 914
Applied a total of 400 rules in 48 ms. Remains 412 /612 variables (removed 200) and now considering 914/1114 (removed 200) transitions.
Running 912 sub problems to find dead transitions.
[2025-06-02 23:42:24] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
// Phase 1: matrix 898 rows 412 cols
[2025-06-02 23:42:24] [INFO ] Computed 48 invariants in 13 ms
[2025-06-02 23:42:24] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:32] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:32] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:32] [INFO ] Deduced a trap composed of 40 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 23:42:32] [INFO ] Deduced a trap composed of 40 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 23:42:33] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:33] [INFO ] Deduced a trap composed of 40 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 23:42:33] [INFO ] Deduced a trap composed of 40 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 23:42:33] [INFO ] Deduced a trap composed of 141 places in 248 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:33] [INFO ] Deduced a trap composed of 148 places in 232 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:34] [INFO ] Deduced a trap composed of 133 places in 223 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:34] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:34] [INFO ] Deduced a trap composed of 40 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 23:42:42] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:42] [INFO ] Deduced a trap composed of 106 places in 215 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:42:43] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1310 variables, and 61 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 912/912 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 912 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1310 variables, and 61 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/912 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40676ms problems are : Problem set: 0 solved, 912 unsolved
Search for dead transitions found 0 dead transitions in 40678ms
[2025-06-02 23:43:05] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
[2025-06-02 23:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:43:06] [INFO ] Implicit Places using invariants in 1394 ms returned [366, 367, 368, 369, 370, 371, 372, 373]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1396 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 404/612 places, 914/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 396 transition count 906
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 396 transition count 906
Applied a total of 16 rules in 32 ms. Remains 396 /404 variables (removed 8) and now considering 906/914 (removed 8) transitions.
[2025-06-02 23:43:06] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
// Phase 1: matrix 890 rows 396 cols
[2025-06-02 23:43:06] [INFO ] Computed 40 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:43:08] [INFO ] Implicit Places using invariants in 1359 ms returned []
[2025-06-02 23:43:08] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:43:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:43:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 23:43:13] [INFO ] Implicit Places using invariants and state equation in 5551 ms returned []
Implicit Place search using SMT with State Equation took 6914 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 396/612 places, 906/1114 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 49071 ms. Remains : 396/612 places, 906/1114 transitions.
[2025-06-02 23:43:13] [INFO ] Flatten gal took : 29 ms
[2025-06-02 23:43:13] [INFO ] Flatten gal took : 28 ms
[2025-06-02 23:43:13] [INFO ] Input system was already deterministic with 906 transitions.
[2025-06-02 23:43:13] [INFO ] Flatten gal took : 30 ms
[2025-06-02 23:43:13] [INFO ] Flatten gal took : 29 ms
[2025-06-02 23:43:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17846311494134084083.gal : 7 ms
[2025-06-02 23:43:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality7814475481305649147.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/CTLCardinality17846311494134084083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7814475481305649147.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 23:43:43] [INFO ] Flatten gal took : 28 ms
[2025-06-02 23:43:43] [INFO ] Applying decomposition
[2025-06-02 23:43:43] [INFO ] Flatten gal took : 27 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/graph10082256776770074502.txt' '-o' '/tmp/graph10082256776770074502.bin' '-w' '/tmp/graph10082256776770074502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10082256776770074502.bin' '-l' '-1' '-v' '-w' '/tmp/graph10082256776770074502.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:43:44] [INFO ] Decomposing Gal with order
[2025-06-02 23:43:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:43:44] [INFO ] Removed a total of 810 redundant transitions.
[2025-06-02 23:43:44] [INFO ] Flatten gal took : 69 ms
[2025-06-02 23:43:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 16 ms.
[2025-06-02 23:43:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality14367059373272314730.gal : 7 ms
[2025-06-02 23:43:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality11781676017458515284.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/CTLCardinality14367059373272314730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11781676017458515284.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 23:44:14] [INFO ] Flatten gal took : 31 ms
[2025-06-02 23:44:14] [INFO ] Flatten gal took : 44 ms
[2025-06-02 23:44:14] [INFO ] Applying decomposition
[2025-06-02 23:44:14] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8102337367281577007.txt' '-o' '/tmp/graph8102337367281577007.bin' '-w' '/tmp/graph8102337367281577007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8102337367281577007.bin' '-l' '-1' '-v' '-w' '/tmp/graph8102337367281577007.weights' '-q' '0' '-e' '0.001'
[2025-06-02 23:44:14] [INFO ] Decomposing Gal with order
[2025-06-02 23:44:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 23:44:14] [INFO ] Removed a total of 990 redundant transitions.
[2025-06-02 23:44:14] [INFO ] Flatten gal took : 69 ms
[2025-06-02 23:44:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 514 labels/synchronizations in 19 ms.
[2025-06-02 23:44:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality6971341172448225413.gal : 7 ms
[2025-06-02 23:44:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality12219302655001436177.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/CTLCardinality6971341172448225413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12219302655001436177.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 6 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 00:08:02] [INFO ] Applying decomposition
[2025-06-03 00:08:02] [INFO ] Flatten gal took : 206 ms
[2025-06-03 00:08:02] [INFO ] Decomposing Gal with order
[2025-06-03 00:08:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:08:03] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, Idle_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, Try_Check_Sources_E_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, Idle_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, Try_Check_Sources_E_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, Idle_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, Try_Check_Sources_E_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, Idle_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, Try_Check_Sources_E_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, Idle_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, Try_Check_Sources_E_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, Idle_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, Try_Check_Sources_E_5, P_1617_5, ScheduleTaskE_Idle_5],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, Idle_6, NotifyEventJobCompletedE_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, Try_Check_Sources_E_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, Idle_7, NotifyEventJobCompletedE_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, Try_Check_Sources_E_7, P_1617_7, ScheduleTaskE_Idle_7],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-03 00:08:03] [INFO ] Flatten gal took : 151 ms
[2025-06-03 00:08:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality5570824587201582981.gal : 42 ms
[2025-06-03 00:08:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality5950379434946685870.ctl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5570824587201582981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5950379434946685870.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 6 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 00:32:44] [INFO ] Flatten gal took : 203 ms
[2025-06-03 00:32:45] [INFO ] Input system was already deterministic with 1114 transitions.
[2025-06-03 00:32:46] [INFO ] Transformed 612 places.
[2025-06-03 00:32:46] [INFO ] Transformed 1114 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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-S02J04T08"
export BK_EXAMINATION="CTLCardinality"
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-S02J04T08, examination is CTLCardinality"
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-174881253700273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T08.tgz
mv PolyORBLF-COL-S02J04T08 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;