About the Execution of ITS-Tools for MedleyA-PT-17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9486.731 | 3600000.00 | 3869658.00 | 768.90 | ?F??F???????TTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000225.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyA-PT-17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000225
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 175K Mar 3 18:30 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 MedleyA-PT-17-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-17-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779700687144
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 09:18:08] [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]
[2026-05-25 09:18:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:18:08] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2026-05-25 09:18:08] [INFO ] Transformed 248 places.
[2026-05-25 09:18:08] [INFO ] Transformed 591 transitions.
[2026-05-25 09:18:08] [INFO ] Found NUPN structural information;
[2026-05-25 09:18:08] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-17-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 98 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 223 transition count 546
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 223 transition count 546
Applied a total of 50 rules in 27 ms. Remains 223 /248 variables (removed 25) and now considering 546/589 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5269892906619736897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16919460807887393497.kers'
[2026-05-25 09:18:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5269892906619736897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16919460807887393497.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 546 rows 223 cols 2674 entries
Finished phase 1 with 215 SingleSign rule and 1 generalized
[2026-05-25 09:18:08] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16919460807887393497.kers
Total runtime 3 ms.
[2026-05-25 09:18:09] [INFO ] Implicit Places using invariants in 329 ms returned []
[2026-05-25 09:18:09] [INFO ] Invariant cache hit.
[2026-05-25 09:18:09] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 545 sub problems to find dead transitions.
[2026-05-25 09:18:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 223/769 variables, and 65 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/223 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 58/65 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 545 unsolved
(s58 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/769 variables, and 85 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/223 constraints, PredecessorRefiner: 0/545 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60535ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60549ms
Starting structural reductions in LTL mode, iteration 1 : 223/248 places, 546/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61384 ms. Remains : 223/248 places, 546/589 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Applied a total of 0 rules in 4 ms. Remains 223 /223 variables (removed 0) and now considering 546/546 (removed 0) transitions.
[2026-05-25 09:19:10] [INFO ] Invariant cache hit.
[2026-05-25 09:19:10] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-25 09:19:10] [INFO ] Invariant cache hit.
[2026-05-25 09:19:10] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 223/223 places, 546/546 transitions.
Support contains 98 out of 223 places after structural reductions.
[2026-05-25 09:19:11] [INFO ] Flatten gal took : 83 ms
[2026-05-25 09:19:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-17-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:19:11] [INFO ] Flatten gal took : 48 ms
[2026-05-25 09:19:11] [INFO ] Input system was already deterministic with 546 transitions.
Support contains 83 out of 223 places (down from 98) after GAL structural reductions.
RANDOM walk for 40000 steps (1376 resets) in 2215 ms. (18 steps per ms) remains 46/52 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (28 resets) in 47 ms. (83 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (27 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (26 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (27 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (28 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (28 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 43 ms. (90 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (29 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (29 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (29 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (29 resets) in 21 ms. (182 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (27 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (29 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (29 resets) in 27 ms. (142 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (29 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (29 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (27 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
[2026-05-25 09:19:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 151/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 546/769 variables, 223/232 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/769 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 232 constraints, problems are : Problem set: 0 solved, 45 unsolved in 3193 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 151/223 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/29 constraints. Problems are: Problem set: 1 solved, 44 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 223/769 variables, and 35 constraints, problems are : Problem set: 1 solved, 44 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/223 constraints, PredecessorRefiner: 0/45 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8215ms problems are : Problem set: 1 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 546/546 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 223 transition count 532
Reduce places removed 14 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 18 rules applied. Total rules applied 32 place count 209 transition count 528
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 205 transition count 528
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 36 place count 205 transition count 525
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 202 transition count 525
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 45 place count 199 transition count 520
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 199 transition count 520
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 90 place count 178 transition count 499
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 178 transition count 498
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 117 place count 165 transition count 528
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 147 place count 165 transition count 498
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 164 transition count 497
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 164 transition count 497
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 155 place count 161 transition count 494
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 177 place count 161 transition count 472
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 199 place count 139 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 203 place count 139 transition count 468
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 139 transition count 468
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 139 transition count 468
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 138 transition count 467
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 138 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 137 transition count 466
Applied a total of 208 rules in 195 ms. Remains 137 /223 variables (removed 86) and now considering 466/546 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 137/223 places, 466/546 transitions.
RANDOM walk for 40000 steps (7201 resets) in 556 ms. (71 steps per ms) remains 31/44 properties
BEST_FIRST walk for 4002 steps (259 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (247 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (229 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (63 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (241 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (204 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (222 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (233 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (252 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (245 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (251 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (213 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (240 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (240 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (245 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (250 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (255 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (231 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (231 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (332 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (234 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (228 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (246 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (256 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (222 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (252 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (240 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (66 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (215 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (239 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (236 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
[2026-05-25 09:19:21] [INFO ] Flow matrix only has 461 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14246723501848113557.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8714092744328930482.kers'
[2026-05-25 09:19:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14246723501848113557.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8714092744328930482.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 461 rows 137 cols 2236 entries
Finished phase 1 with 129 SingleSign rule and 1 generalized
[2026-05-25 09:19:21] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8714092744328930482.kers
Total runtime 2 ms.
[2026-05-25 09:19:21] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 92/137 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 461/598 variables, 137/144 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 30/174 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/598 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 174 constraints, problems are : Problem set: 0 solved, 31 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 92/137 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 461/598 variables, 137/156 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 30/186 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 31/217 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/598 variables, and 222 constraints, problems are : Problem set: 0 solved, 31 unsolved in 45036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45994ms problems are : Problem set: 0 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 466/466 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 136 transition count 465
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 136 transition count 460
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 131 transition count 460
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 131 transition count 459
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 16 place count 128 transition count 455
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 128 transition count 455
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 35 place count 128 transition count 439
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 45 place count 123 transition count 434
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 53 place count 119 transition count 440
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 54 place count 119 transition count 439
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 55 place count 118 transition count 432
Iterating global reduction 5 with 1 rules applied. Total rules applied 56 place count 118 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 61 place count 118 transition count 427
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 66 place count 118 transition count 422
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 71 place count 113 transition count 422
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 72 place count 113 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 73 place count 113 transition count 421
Applied a total of 73 rules in 143 ms. Remains 113 /137 variables (removed 24) and now considering 421/466 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 113/137 places, 421/466 transitions.
RANDOM walk for 40000 steps (6254 resets) in 528 ms. (75 steps per ms) remains 14/31 properties
BEST_FIRST walk for 40004 steps (1943 resets) in 187 ms. (212 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (1945 resets) in 249 ms. (160 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40001 steps (1955 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1965 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1994 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1946 resets) in 74 ms. (533 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40001 steps (2021 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1986 resets) in 46 ms. (851 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2033 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (2039 resets) in 48 ms. (816 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40002 steps (13 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
[2026-05-25 09:20:07] [INFO ] Flow matrix only has 415 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2901963184774589375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12015477604061986158.kers'
[2026-05-25 09:20:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2901963184774589375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12015477604061986158.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 415 rows 113 cols 2046 entries
Finished phase 1 with 105 SingleSign rule and 1 generalized
[2026-05-25 09:20:07] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12015477604061986158.kers
Total runtime 2 ms.
[2026-05-25 09:20:07] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 92/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 404/508 variables, 104/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 19/527 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 25/148 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/528 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/528 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 150 constraints, problems are : Problem set: 0 solved, 7 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 92/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 404/508 variables, 104/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 19/527 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 25/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/528 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/528 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/528 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 167 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2881 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3368ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 2930 ms.
Support contains 12 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 421/421 transitions.
Graph (trivial) has 84 edges and 113 vertex of which 5 / 113 are part of one of the 2 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 110 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 106 transition count 412
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 9 place count 106 transition count 406
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 21 place count 100 transition count 406
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 100 transition count 404
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 30 place count 93 transition count 375
Iterating global reduction 3 with 7 rules applied. Total rules applied 37 place count 93 transition count 375
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 53 place count 85 transition count 367
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 85 transition count 365
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 75 place count 75 transition count 409
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 75 transition count 407
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 78 place count 74 transition count 400
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 74 transition count 400
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 83 place count 74 transition count 396
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 85 place count 74 transition count 394
Free-agglomeration rule applied 10 times with reduction of 2 identical transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 95 place count 74 transition count 382
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 117 place count 64 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 130 place count 64 transition count 357
Applied a total of 130 rules in 45 ms. Remains 64 /113 variables (removed 49) and now considering 357/421 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 64/113 places, 357/421 transitions.
RANDOM walk for 40000 steps (9 resets) in 1004 ms. (39 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (10 resets) in 770 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (17 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (11 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (15 resets) in 121 ms. (327 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (11 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (12 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
[2026-05-25 09:20:14] [INFO ] Flow matrix only has 296 transitions (discarded 61 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11599981900176653392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10506944755737084381.kers'
[2026-05-25 09:20:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11599981900176653392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10506944755737084381.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 296 rows 64 cols 1578 entries
Finished phase 1 with 56 SingleSign rule and 1 generalized
[2026-05-25 09:20:14] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10506944755737084381.kers
Total runtime 2 ms.
[2026-05-25 09:20:14] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 280/330 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 30/360 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 28/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/360 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 106 constraints, problems are : Problem set: 0 solved, 6 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 64/64 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 280/330 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 30/360 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/360 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 120 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 64/64 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1530ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 357/357 transitions.
Graph (trivial) has 21 edges and 64 vertex of which 2 / 64 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 62 transition count 353
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 62 transition count 353
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 62 transition count 352
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 61 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 61 transition count 344
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 61 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 60 transition count 358
Applied a total of 15 rules in 43 ms. Remains 60 /64 variables (removed 4) and now considering 358/357 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 60/64 places, 358/357 transitions.
RANDOM walk for 7865 steps (693 resets) in 55 ms. (140 steps per ms) remains 0/6 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2026-05-25 09:20:16] [INFO ] Flatten gal took : 48 ms
[2026-05-25 09:20:16] [INFO ] Flatten gal took : 56 ms
[2026-05-25 09:20:16] [INFO ] Input system was already deterministic with 546 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 198 transition count 507
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 198 transition count 507
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 68 place count 198 transition count 489
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 194 transition count 481
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 194 transition count 481
Applied a total of 76 rules in 7 ms. Remains 194 /223 variables (removed 29) and now considering 481/546 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17978276595578216950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1398401428164017448.kers'
[2026-05-25 09:20:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17978276595578216950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1398401428164017448.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 481 rows 194 cols 2440 entries
Finished phase 1 with 186 SingleSign rule and 1 generalized
[2026-05-25 09:20:16] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1398401428164017448.kers
Total runtime 3 ms.
[2026-05-25 09:20:16] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 09:20:16] [INFO ] Invariant cache hit.
[2026-05-25 09:20:17] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2026-05-25 09:20:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 480 unsolved
SMT process timed out in 30159ms, After SMT, problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 30162ms
Starting structural reductions in LTL mode, iteration 1 : 194/223 places, 481/546 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30541 ms. Remains : 194/223 places, 481/546 transitions.
[2026-05-25 09:20:47] [INFO ] Flatten gal took : 46 ms
[2026-05-25 09:20:47] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:20:47] [INFO ] Input system was already deterministic with 481 transitions.
[2026-05-25 09:20:47] [INFO ] Flatten gal took : 30 ms
[2026-05-25 09:20:47] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:20:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality5823967138974846490.gal : 31 ms
[2026-05-25 09:20:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality8757106584296354275.ctl : 9 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5823967138974846490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8757106584296354275.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 09:21:17] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:21:17] [INFO ] Applying decomposition
[2026-05-25 09:21:17] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9462606285661884604.txt' '-o' '/tmp/graph9462606285661884604.bin' '-w' '/tmp/graph9462606285661884604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9462606285661884604.bin' '-l' '-1' '-v' '-w' '/tmp/graph9462606285661884604.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:21:17] [INFO ] Decomposing Gal with order
[2026-05-25 09:21:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:21:17] [INFO ] Removed a total of 1121 redundant transitions.
[2026-05-25 09:21:18] [INFO ] Flatten gal took : 116 ms
[2026-05-25 09:21:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 20 ms.
[2026-05-25 09:21:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality15745629091756121750.gal : 9 ms
[2026-05-25 09:21:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality17492519384428438012.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15745629091756121750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17492519384428438012.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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 : 223/223 places, 546/546 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 202 transition count 513
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 202 transition count 513
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 60 place count 202 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 200 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 200 transition count 491
Applied a total of 64 rules in 23 ms. Remains 200 /223 variables (removed 23) and now considering 491/546 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5622253572392987813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15487624558639705253.kers'
[2026-05-25 09:21:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5622253572392987813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15487624558639705253.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 491 rows 200 cols 2468 entries
Finished phase 1 with 192 SingleSign rule and 1 generalized
[2026-05-25 09:21:48] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15487624558639705253.kers
Total runtime 6 ms.
[2026-05-25 09:21:48] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-25 09:21:48] [INFO ] Invariant cache hit.
[2026-05-25 09:21:48] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 490 sub problems to find dead transitions.
[2026-05-25 09:21:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 200/691 variables, and 62 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/200 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 55/62 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/691 variables, and 73 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/200 constraints, PredecessorRefiner: 0/490 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in LTL mode, iteration 1 : 200/223 places, 491/546 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60733 ms. Remains : 200/223 places, 491/546 transitions.
[2026-05-25 09:22:48] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:22:48] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:22:48] [INFO ] Input system was already deterministic with 491 transitions.
[2026-05-25 09:22:48] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:22:49] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:22:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality7141132317359206059.gal : 5 ms
[2026-05-25 09:22:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality4754223509719257663.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7141132317359206059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4754223509719257663.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 09:23:19] [INFO ] Flatten gal took : 41 ms
[2026-05-25 09:23:19] [INFO ] Applying decomposition
[2026-05-25 09:23:19] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1886519933695990377.txt' '-o' '/tmp/graph1886519933695990377.bin' '-w' '/tmp/graph1886519933695990377.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1886519933695990377.bin' '-l' '-1' '-v' '-w' '/tmp/graph1886519933695990377.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:23:19] [INFO ] Decomposing Gal with order
[2026-05-25 09:23:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:23:19] [INFO ] Removed a total of 1167 redundant transitions.
[2026-05-25 09:23:19] [INFO ] Flatten gal took : 32 ms
[2026-05-25 09:23:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 17 ms.
[2026-05-25 09:23:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality10132133754738629685.gal : 4 ms
[2026-05-25 09:23:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15124489093841822522.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10132133754738629685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15124489093841822522.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.47681e+07,25.5227,651872,6118,256,483947,6475,1177,6.62018e+06,136,50428,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Graph (trivial) has 230 edges and 223 vertex of which 9 / 223 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 216 transition count 512
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 189 transition count 510
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 187 transition count 509
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 60 place count 187 transition count 498
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 82 place count 176 transition count 498
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 105 place count 153 transition count 458
Iterating global reduction 3 with 23 rules applied. Total rules applied 128 place count 153 transition count 458
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 160 place count 153 transition count 426
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 160 place count 153 transition count 422
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 168 place count 149 transition count 422
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 171 place count 146 transition count 402
Iterating global reduction 4 with 3 rules applied. Total rules applied 174 place count 146 transition count 402
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 210 place count 128 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 128 transition count 383
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 212 place count 127 transition count 381
Iterating global reduction 5 with 1 rules applied. Total rules applied 213 place count 127 transition count 381
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 221 place count 127 transition count 373
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 5 with 8 rules applied. Total rules applied 229 place count 123 transition count 369
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 123 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 122 transition count 368
Applied a total of 231 rules in 93 ms. Remains 122 /223 variables (removed 101) and now considering 368/546 (removed 178) transitions.
[2026-05-25 09:23:49] [INFO ] Flow matrix only has 366 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8867815744897371657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12766708298270986125.kers'
[2026-05-25 09:23:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8867815744897371657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12766708298270986125.kers]
Normalized transition count is 365 out of 366 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 122 cols 1730 entries
Finished phase 1 with 114 SingleSign rule and 1 generalized
[2026-05-25 09:23:49] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12766708298270986125.kers
Total runtime 2 ms.
[2026-05-25 09:23:49] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 09:23:49] [INFO ] Flow matrix only has 366 transitions (discarded 2 similar events)
[2026-05-25 09:23:49] [INFO ] Invariant cache hit.
[2026-05-25 09:23:49] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 09:23:49] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2026-05-25 09:23:49] [INFO ] Redundant transitions in 16 ms returned []
Running 359 sub problems to find dead transitions.
[2026-05-25 09:23:49] [INFO ] Flow matrix only has 366 transitions (discarded 2 similar events)
[2026-05-25 09:23:49] [INFO ] Invariant cache hit.
[2026-05-25 09:23:49] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 365/487 variables, 122/146 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 64/210 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (OVERLAPS) 1/488 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 211 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 3 (OVERLAPS) 365/487 variables, 122/146 constraints. Problems are: Problem set: 42 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 64/210 constraints. Problems are: Problem set: 42 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 317/527 constraints. Problems are: Problem set: 42 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/488 variables, and 527 constraints, problems are : Problem set: 42 solved, 317 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 317/359 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 42 solved, 317 unsolved
Search for dead transitions found 42 dead transitions in 60204ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 122/223 places, 326/546 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 326/326 (removed 0) transitions.
[2026-05-25 09:24:50] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60628 ms. Remains : 122/223 places, 326/546 transitions.
[2026-05-25 09:24:50] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:24:50] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:24:50] [INFO ] Input system was already deterministic with 326 transitions.
[2026-05-25 09:24:50] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:24:50] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:24:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality7178903125695182865.gal : 2 ms
[2026-05-25 09:24:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality3258281701277158995.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7178903125695182865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3258281701277158995.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.61081e+06,25.1497,661620,2,56868,5,1.42173e+06,6,0,814,1.68803e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 09:25:20] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:25:20] [INFO ] Applying decomposition
[2026-05-25 09:25:20] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17570519317711936902.txt' '-o' '/tmp/graph17570519317711936902.bin' '-w' '/tmp/graph17570519317711936902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17570519317711936902.bin' '-l' '-1' '-v' '-w' '/tmp/graph17570519317711936902.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:25:20] [INFO ] Decomposing Gal with order
[2026-05-25 09:25:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:25:20] [INFO ] Removed a total of 394 redundant transitions.
[2026-05-25 09:25:20] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:25:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 6 ms.
[2026-05-25 09:25:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality9665988948569842355.gal : 3 ms
[2026-05-25 09:25:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality596670502630511806.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9665988948569842355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality596670502630511806.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.61081e+06,26.4052,712224,834,11797,48370,822622,515,745078,270,1.03952e+07,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 194 transition count 500
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 194 transition count 500
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 92 place count 194 transition count 466
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 190 transition count 458
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 190 transition count 458
Applied a total of 100 rules in 33 ms. Remains 190 /223 variables (removed 33) and now considering 458/546 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17054747467418491842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3604068687349388141.kers'
[2026-05-25 09:25:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17054747467418491842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3604068687349388141.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 458 rows 190 cols 2298 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:25:50] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3604068687349388141.kers
Total runtime 5 ms.
[2026-05-25 09:25:50] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-25 09:25:50] [INFO ] Invariant cache hit.
[2026-05-25 09:25:50] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2026-05-25 09:25:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/648 variables, and 47 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 5 (OVERLAPS) 458/648 variables, 190/238 constraints. Problems are: Problem set: 50 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 407/645 constraints. Problems are: Problem set: 50 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 645 constraints, problems are : Problem set: 50 solved, 407 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 407/457 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 50 solved, 407 unsolved
Search for dead transitions found 50 dead transitions in 60171ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/223 places, 408/546 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60651 ms. Remains : 190/223 places, 408/546 transitions.
[2026-05-25 09:26:50] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:26:50] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:26:51] [INFO ] Input system was already deterministic with 408 transitions.
[2026-05-25 09:26:51] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:26:51] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:26:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality3840232511317110656.gal : 16 ms
[2026-05-25 09:26:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality17430926116365893436.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3840232511317110656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17430926116365893436.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 09:27:21] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:27:21] [INFO ] Applying decomposition
[2026-05-25 09:27:21] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7919346365414345073.txt' '-o' '/tmp/graph7919346365414345073.bin' '-w' '/tmp/graph7919346365414345073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7919346365414345073.bin' '-l' '-1' '-v' '-w' '/tmp/graph7919346365414345073.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:27:21] [INFO ] Decomposing Gal with order
[2026-05-25 09:27:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:27:21] [INFO ] Removed a total of 939 redundant transitions.
[2026-05-25 09:27:21] [INFO ] Flatten gal took : 29 ms
[2026-05-25 09:27:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 9 ms.
[2026-05-25 09:27:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality13348155318516739492.gal : 3 ms
[2026-05-25 09:27:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9108899391404453015.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13348155318516739492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9108899391404453015.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.81198e+07,3.91042,146684,1974,41,246282,1111,863,939187,92,2953,0
Converting to forward existential form...Done !
original formula: AX(AG((i7.i0.u29.p121==0)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((i7.i0.u29.p121==0)))] = FALSE
(forward)formula 0,0,6.78694,159408,1,0,265813,1111,2180,1.03758e+06,159,2953,636501
FORMULA MedleyA-PT-17-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Graph (trivial) has 227 edges and 223 vertex of which 9 / 223 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 216 transition count 512
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 189 transition count 510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 188 transition count 510
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 58 place count 188 transition count 498
Deduced a syphon composed of 12 places in 13 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 82 place count 176 transition count 498
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 105 place count 153 transition count 459
Iterating global reduction 3 with 23 rules applied. Total rules applied 128 place count 153 transition count 459
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 160 place count 153 transition count 427
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 160 place count 153 transition count 422
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 170 place count 148 transition count 422
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 173 place count 145 transition count 402
Iterating global reduction 4 with 3 rules applied. Total rules applied 176 place count 145 transition count 402
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 210 place count 128 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 128 transition count 384
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 212 place count 127 transition count 372
Iterating global reduction 5 with 1 rules applied. Total rules applied 213 place count 127 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 220 place count 127 transition count 365
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 228 place count 123 transition count 361
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 229 place count 122 transition count 360
Applied a total of 229 rules in 97 ms. Remains 122 /223 variables (removed 101) and now considering 360/546 (removed 186) transitions.
[2026-05-25 09:27:28] [INFO ] Flow matrix only has 358 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5838470090463781129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5438954677614387543.kers'
[2026-05-25 09:27:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5838470090463781129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5438954677614387543.kers]
Normalized transition count is 357 out of 358 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 357 rows 122 cols 1618 entries
Finished phase 1 with 114 SingleSign rule and 1 generalized
[2026-05-25 09:27:28] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5438954677614387543.kers
Total runtime 2 ms.
[2026-05-25 09:27:28] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 09:27:28] [INFO ] Flow matrix only has 358 transitions (discarded 2 similar events)
[2026-05-25 09:27:28] [INFO ] Invariant cache hit.
[2026-05-25 09:27:28] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 09:27:28] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2026-05-25 09:27:28] [INFO ] Redundant transitions in 4 ms returned []
Running 351 sub problems to find dead transitions.
[2026-05-25 09:27:28] [INFO ] Flow matrix only has 358 transitions (discarded 2 similar events)
[2026-05-25 09:27:28] [INFO ] Invariant cache hit.
[2026-05-25 09:27:28] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (OVERLAPS) 357/479 variables, 122/147 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 64/211 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 8 (OVERLAPS) 1/480 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/480 variables, and 213 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 3 (OVERLAPS) 357/479 variables, 122/148 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 64/212 constraints. Problems are: Problem set: 36 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 315/527 constraints. Problems are: Problem set: 36 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/480 variables, and 527 constraints, problems are : Problem set: 36 solved, 315 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 315/351 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 36 solved, 315 unsolved
Search for dead transitions found 36 dead transitions in 60133ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 122/223 places, 324/546 transitions.
Applied a total of 0 rules in 18 ms. Remains 122 /122 variables (removed 0) and now considering 324/324 (removed 0) transitions.
[2026-05-25 09:28:28] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60556 ms. Remains : 122/223 places, 324/546 transitions.
[2026-05-25 09:28:28] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:28:28] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:28:28] [INFO ] Input system was already deterministic with 324 transitions.
[2026-05-25 09:28:28] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:28:28] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:28:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality7808062447878185377.gal : 2 ms
[2026-05-25 09:28:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality17841467972975831276.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7808062447878185377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17841467972975831276.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.02899e+06,10.906,246996,2,44344,5,595882,6,0,812,608804,0
Converting to forward existential form...Done !
original formula: AF(AG((((p134==0)&&(p15==0)) * (!(A(((p220==0)||(p164==1)) U ((p10==0)||(p61==1)))) + (p85==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p134==0)&&(p15==0)) * (!(!((E(!(((p10==0)||(p61==1))) U (!(((p220==0)||(p164==1))) ...242
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t8, t11, t13, t14, t15, t20, t21, t23, t25, t26, t32, t35, t37, t39, t43, t45, t47, t...687
Detected timeout of ITS tools.
[2026-05-25 09:28:58] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:28:58] [INFO ] Applying decomposition
[2026-05-25 09:28:58] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3105656711027817990.txt' '-o' '/tmp/graph3105656711027817990.bin' '-w' '/tmp/graph3105656711027817990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3105656711027817990.bin' '-l' '-1' '-v' '-w' '/tmp/graph3105656711027817990.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:28:58] [INFO ] Decomposing Gal with order
[2026-05-25 09:28:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:28:58] [INFO ] Removed a total of 386 redundant transitions.
[2026-05-25 09:28:58] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:28:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 6 ms.
[2026-05-25 09:28:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality16332042781089351236.gal : 3 ms
[2026-05-25 09:28:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality10847226767303495466.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16332042781089351236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10847226767303495466.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.02899e+06,2.95659,94800,719,3902,33500,150067,574,163165,278,855562,0
Converting to forward existential form...Done !
original formula: AF(AG((((i3.u13.p134==0)&&(i8.u28.p15==0)) * (!(A(((i6.u25.p220==0)||(i3.u17.p164==1)) U ((u0.p10==0)||(i7.u4.p61==1)))) + (i0.u8.p85==0)...159
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((i3.u13.p134==0)&&(i8.u28.p15==0)) * (!(!((E(!(((u0.p10==0)||(i7.u4.p61==1))) U (!((...303
Reverse transition relation is NOT exact ! Due to transitions t1, t32, t60, t70, t75, t92, t102, t104, t111, t116, t118, t120, t121, t122, t125, t126, t127...816
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 193 transition count 498
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 193 transition count 498
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 94 place count 193 transition count 464
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 189 transition count 456
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 189 transition count 456
Applied a total of 102 rules in 30 ms. Remains 189 /223 variables (removed 34) and now considering 456/546 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11420572981675113514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4468351051180624363.kers'
[2026-05-25 09:29:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11420572981675113514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4468351051180624363.kers]
Culled 0 columns in 8 ms.
// Phase 1: matrix 456 rows 189 cols 2294 entries
Finished phase 1 with 181 SingleSign rule and 1 generalized
[2026-05-25 09:29:29] [INFO ] Computed 7 invariants in 11 ms
Computed 7 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-4468351051180624363.kers
Total runtime 13 ms.
[2026-05-25 09:29:29] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-25 09:29:29] [INFO ] Invariant cache hit.
[2026-05-25 09:29:29] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2026-05-25 09:29:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/645 variables, and 42 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/241 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 405/646 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 646 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60240ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/223 places, 406/546 transitions.
Applied a total of 0 rules in 5 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60676 ms. Remains : 189/223 places, 406/546 transitions.
[2026-05-25 09:30:29] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:30:29] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:30:29] [INFO ] Input system was already deterministic with 406 transitions.
[2026-05-25 09:30:29] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:30:29] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:30:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality7962404404303289153.gal : 2 ms
[2026-05-25 09:30:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality3504520230927239972.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7962404404303289153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3504520230927239972.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 09:30:59] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:30:59] [INFO ] Applying decomposition
[2026-05-25 09:30:59] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph884024004665257512.txt' '-o' '/tmp/graph884024004665257512.bin' '-w' '/tmp/graph884024004665257512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph884024004665257512.bin' '-l' '-1' '-v' '-w' '/tmp/graph884024004665257512.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:30:59] [INFO ] Decomposing Gal with order
[2026-05-25 09:30:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:30:59] [INFO ] Removed a total of 942 redundant transitions.
[2026-05-25 09:30:59] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:30:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 5 ms.
[2026-05-25 09:30:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality2705017301582813949.gal : 3 ms
[2026-05-25 09:30:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7378023381470588851.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2705017301582813949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7378023381470588851.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,2.1327,91496,2384,36,136335,582,888,602422,84,1464,0
Converting to forward existential form...Done !
original formula: EG(EX(((AG((i10.u23.p100==1)) + (i6.i1.u41.p153==0)) + (i9.u57.p222==1))))
=> equivalent forward existential formula: [FwdG(Init,EX(((!(E(TRUE U !((i10.u23.p100==1)))) + (i6.i1.u41.p153==0)) + (i9.u57.p222==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t20, t37, t76, t93, t162, t168, t170, t178, t184, t186, t210, t212, t218, t220, t242, t244, t...914
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 195 transition count 502
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 195 transition count 502
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 90 place count 195 transition count 468
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 192 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 192 transition count 462
Applied a total of 96 rules in 5 ms. Remains 192 /223 variables (removed 31) and now considering 462/546 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13908041990552282787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1266719902524643292.kers'
[2026-05-25 09:31:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13908041990552282787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1266719902524643292.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 462 rows 192 cols 2310 entries
Finished phase 1 with 184 SingleSign rule and 1 generalized
[2026-05-25 09:31:30] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1266719902524643292.kers
Total runtime 6 ms.
[2026-05-25 09:31:30] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 09:31:30] [INFO ] Invariant cache hit.
[2026-05-25 09:31:30] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-25 09:31:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/654 variables, and 55 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 4 (OVERLAPS) 462/654 variables, 192/247 constraints. Problems are: Problem set: 50 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 411/658 constraints. Problems are: Problem set: 50 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/654 variables, and 658 constraints, problems are : Problem set: 50 solved, 411 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 411/461 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 50 solved, 411 unsolved
Search for dead transitions found 50 dead transitions in 60145ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 192/223 places, 412/546 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60661 ms. Remains : 192/223 places, 412/546 transitions.
[2026-05-25 09:32:30] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:32:30] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:32:30] [INFO ] Input system was already deterministic with 412 transitions.
[2026-05-25 09:32:30] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:32:30] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:32:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality4596307051082403679.gal : 2 ms
[2026-05-25 09:32:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality16660094881484029909.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4596307051082403679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16660094881484029909.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 09:33:00] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:33:00] [INFO ] Applying decomposition
[2026-05-25 09:33:00] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph890701928573917400.txt' '-o' '/tmp/graph890701928573917400.bin' '-w' '/tmp/graph890701928573917400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph890701928573917400.bin' '-l' '-1' '-v' '-w' '/tmp/graph890701928573917400.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:33:00] [INFO ] Decomposing Gal with order
[2026-05-25 09:33:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:33:00] [INFO ] Removed a total of 950 redundant transitions.
[2026-05-25 09:33:00] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:33:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2026-05-25 09:33:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality2129990023705961213.gal : 5 ms
[2026-05-25 09:33:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality18439371973735979991.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2129990023705961213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18439371973735979991.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.04139e+07,3.97316,142236,2151,49,201560,1240,823,1.0632e+06,96,3189,0
Converting to forward existential form...Done !
original formula: E(AF(AX(EX(EX((i4.i0.u37.p143==1))))) U A((i1.u8.p41==1) U AF(((i9.u5.p28==0)&&(i1.u9.p32==1)))))
=> equivalent forward existential formula: [((FwdU(Init,!(EG(!(!(EX(!(EX(EX((i4.i0.u37.p143==1)))))))))) * !(EG(!(!(EG(!(((i9.u5.p28==0)&&(i1.u9.p32==1))))...295
Reverse transition relation is NOT exact ! Due to transitions t54, t76, t164, t182, t188, t190, t214, t215, t222, t223, t246, t247, t254, t255, t261, t262,...1084
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 196 transition count 503
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 196 transition count 503
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 88 place count 196 transition count 469
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 192 transition count 461
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 192 transition count 461
Applied a total of 96 rules in 14 ms. Remains 192 /223 variables (removed 31) and now considering 461/546 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15691200998476842080.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16420248615584056980.kers'
[2026-05-25 09:33:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15691200998476842080.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16420248615584056980.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 461 rows 192 cols 2304 entries
Finished phase 1 with 184 SingleSign rule and 1 generalized
[2026-05-25 09:33:31] [INFO ] Computed 7 invariants in 9 ms
Computed 7 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-16420248615584056980.kers
Total runtime 10 ms.
[2026-05-25 09:33:31] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-25 09:33:31] [INFO ] Invariant cache hit.
[2026-05-25 09:33:31] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-25 09:33:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/653 variables, and 53 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/653 variables, and 67 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, PredecessorRefiner: 0/460 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 192/223 places, 461/546 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60677 ms. Remains : 192/223 places, 461/546 transitions.
[2026-05-25 09:34:31] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:34:31] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:34:31] [INFO ] Input system was already deterministic with 461 transitions.
[2026-05-25 09:34:31] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:34:31] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:34:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality10583289665024487618.gal : 2 ms
[2026-05-25 09:34:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3444496741941635705.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10583289665024487618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3444496741941635705.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 09:35:01] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:35:01] [INFO ] Applying decomposition
[2026-05-25 09:35:01] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15023387194635829421.txt' '-o' '/tmp/graph15023387194635829421.bin' '-w' '/tmp/graph15023387194635829421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15023387194635829421.bin' '-l' '-1' '-v' '-w' '/tmp/graph15023387194635829421.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:35:01] [INFO ] Decomposing Gal with order
[2026-05-25 09:35:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:35:01] [INFO ] Removed a total of 1050 redundant transitions.
[2026-05-25 09:35:01] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:35:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 7 ms.
[2026-05-25 09:35:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality17304637389859955224.gal : 3 ms
[2026-05-25 09:35:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality10472885016342039027.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17304637389859955224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10472885016342039027.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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 : 223/223 places, 546/546 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 193 transition count 498
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 193 transition count 498
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 94 place count 193 transition count 464
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 189 transition count 456
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 189 transition count 456
Applied a total of 102 rules in 11 ms. Remains 189 /223 variables (removed 34) and now considering 456/546 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11904298821346680098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-71202059827506585.kers'
[2026-05-25 09:35:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11904298821346680098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-71202059827506585.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 456 rows 189 cols 2294 entries
Finished phase 1 with 181 SingleSign rule and 1 generalized
[2026-05-25 09:35:32] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-71202059827506585.kers
Total runtime 5 ms.
[2026-05-25 09:35:32] [INFO ] Implicit Places using invariants in 183 ms returned []
[2026-05-25 09:35:32] [INFO ] Invariant cache hit.
[2026-05-25 09:35:32] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2026-05-25 09:35:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/231 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/645 variables, and 231 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/241 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 405/646 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 646 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60159ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/223 places, 406/546 transitions.
Applied a total of 0 rules in 1 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60624 ms. Remains : 189/223 places, 406/546 transitions.
[2026-05-25 09:36:32] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:36:32] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:36:32] [INFO ] Input system was already deterministic with 406 transitions.
[2026-05-25 09:36:32] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:36:32] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:36:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality10613048051033940658.gal : 2 ms
[2026-05-25 09:36:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality13453565362178852020.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10613048051033940658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13453565362178852020.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 09:37:02] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:37:02] [INFO ] Applying decomposition
[2026-05-25 09:37:02] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14758934620497144965.txt' '-o' '/tmp/graph14758934620497144965.bin' '-w' '/tmp/graph14758934620497144965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14758934620497144965.bin' '-l' '-1' '-v' '-w' '/tmp/graph14758934620497144965.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:37:02] [INFO ] Decomposing Gal with order
[2026-05-25 09:37:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:37:02] [INFO ] Removed a total of 939 redundant transitions.
[2026-05-25 09:37:02] [INFO ] Flatten gal took : 32 ms
[2026-05-25 09:37:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2026-05-25 09:37:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality14217129611758872483.gal : 14 ms
[2026-05-25 09:37:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality8077008372835553007.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14217129611758872483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8077008372835553007.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,0.917956,40980,2230,41,77714,653,840,156467,87,1556,0
Converting to forward existential form...Done !
original formula: EG(AF(((EX(AX(((i0.u15.p75==0)||(i4.u28.p124==1)))) * AF((i9.i0.i1.u59.p226==0))) * EX(((i2.u13.p65==0)&&(i7.u48.p185==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((EX(!(EX(!(((i0.u15.p75==0)||(i4.u28.p124==1)))))) * !(EG(!((i9.i0.i1.u59.p226==0))))) * EX((...205
Reverse transition relation is NOT exact ! Due to transitions t46, t54, t59, t82, t93, t162, t168, t170, t178, t184, t186, t209, t212, t217, t220, t241, t2...947
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 200 transition count 508
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 200 transition count 508
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 63 place count 200 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 198 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 198 transition count 487
Applied a total of 67 rules in 5 ms. Remains 198 /223 variables (removed 25) and now considering 487/546 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17983439507401453681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8332003083478403536.kers'
[2026-05-25 09:37:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17983439507401453681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8332003083478403536.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 487 rows 198 cols 2456 entries
Finished phase 1 with 190 SingleSign rule and 1 generalized
[2026-05-25 09:37:33] [INFO ] Computed 7 invariants in 6 ms
Computed 7 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8332003083478403536.kers
Total runtime 7 ms.
[2026-05-25 09:37:33] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-25 09:37:33] [INFO ] Invariant cache hit.
[2026-05-25 09:37:33] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 486 sub problems to find dead transitions.
[2026-05-25 09:37:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 486 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/685 variables, and 55 constraints, problems are : Problem set: 0 solved, 486 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/198 constraints, PredecessorRefiner: 486/486 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 486 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 486 unsolved
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 7 (OVERLAPS) 487/685 variables, 198/260 constraints. Problems are: Problem set: 50 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/685 variables, 436/696 constraints. Problems are: Problem set: 50 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 685/685 variables, and 696 constraints, problems are : Problem set: 50 solved, 436 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 436/486 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 50 solved, 436 unsolved
Search for dead transitions found 50 dead transitions in 60186ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 198/223 places, 437/546 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60674 ms. Remains : 198/223 places, 437/546 transitions.
[2026-05-25 09:38:33] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:38:33] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:38:33] [INFO ] Input system was already deterministic with 437 transitions.
[2026-05-25 09:38:33] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:38:33] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:38:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality5217989878187928002.gal : 2 ms
[2026-05-25 09:38:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality17328366625581620408.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5217989878187928002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17328366625581620408.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 09:39:03] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:39:03] [INFO ] Applying decomposition
[2026-05-25 09:39:03] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17093913244344710288.txt' '-o' '/tmp/graph17093913244344710288.bin' '-w' '/tmp/graph17093913244344710288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17093913244344710288.bin' '-l' '-1' '-v' '-w' '/tmp/graph17093913244344710288.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:39:03] [INFO ] Decomposing Gal with order
[2026-05-25 09:39:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:39:03] [INFO ] Removed a total of 589 redundant transitions.
[2026-05-25 09:39:03] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:39:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 4 ms.
[2026-05-25 09:39:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality8578455206500978719.gal : 3 ms
[2026-05-25 09:39:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality10930572518195389259.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8578455206500978719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10930572518195389259.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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 : 223/223 places, 546/546 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 196 transition count 503
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 196 transition count 503
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 87 place count 196 transition count 470
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 193 transition count 464
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 193 transition count 464
Applied a total of 93 rules in 6 ms. Remains 193 /223 variables (removed 30) and now considering 464/546 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7787312953933127742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16643347967426838849.kers'
[2026-05-25 09:39:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7787312953933127742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16643347967426838849.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 464 rows 193 cols 2310 entries
Finished phase 1 with 185 SingleSign rule and 1 generalized
[2026-05-25 09:39:34] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16643347967426838849.kers
Total runtime 4 ms.
[2026-05-25 09:39:34] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-25 09:39:34] [INFO ] Invariant cache hit.
[2026-05-25 09:39:34] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2026-05-25 09:39:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 193/657 variables, and 60 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/193 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 4 (OVERLAPS) 464/657 variables, 193/253 constraints. Problems are: Problem set: 50 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 413/666 constraints. Problems are: Problem set: 50 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/657 variables, and 666 constraints, problems are : Problem set: 50 solved, 413 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 413/463 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 50 solved, 413 unsolved
Search for dead transitions found 50 dead transitions in 60148ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 193/223 places, 414/546 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60593 ms. Remains : 193/223 places, 414/546 transitions.
[2026-05-25 09:40:34] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:40:34] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:40:34] [INFO ] Input system was already deterministic with 414 transitions.
[2026-05-25 09:40:34] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:40:34] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:40:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality8222275740720854239.gal : 2 ms
[2026-05-25 09:40:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality4746457898289784506.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8222275740720854239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4746457898289784506.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 09:41:04] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:41:04] [INFO ] Applying decomposition
[2026-05-25 09:41:04] [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.202604301425/bin/convert-linux64' '-i' '/tmp/graph683859005696455189.txt' '-o' '/tmp/graph683859005696455189.bin' '-w' '/tmp/graph683859005696455189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph683859005696455189.bin' '-l' '-1' '-v' '-w' '/tmp/graph683859005696455189.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:41:04] [INFO ] Decomposing Gal with order
[2026-05-25 09:41:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:41:04] [INFO ] Removed a total of 928 redundant transitions.
[2026-05-25 09:41:04] [INFO ] Flatten gal took : 24 ms
[2026-05-25 09:41:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 5 ms.
[2026-05-25 09:41:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality18234546517698054207.gal : 2 ms
[2026-05-25 09:41:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality10981350590900162255.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18234546517698054207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10981350590900162255.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.9843e+07,2.99632,129384,2751,50,311354,697,935,500968,98,1839,0
Converting to forward existential form...Done !
original formula: (AX(EF(EX(((i9.i0.u51.p198==0)||(i0.u12.p62==1))))) * E((i1.i2.u17.p80==1) U AF((i1.i2.u17.p78==1))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U EX(((i9.i0.u51.p198==0)||(i0.u12.p62==1))))))] = FALSE * [(Init * !(E((i1.i2.u17.p80==1...200
Reverse transition relation is NOT exact ! Due to transitions t39, t43, t86, t97, t170, t176, t178, t186, t192, t194, t217, t220, t225, t228, t249, t252, t...1159
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Graph (trivial) has 242 edges and 223 vertex of which 9 / 223 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 216 transition count 510
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 187 transition count 509
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 60 place count 187 transition count 496
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 86 place count 174 transition count 496
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 112 place count 148 transition count 451
Iterating global reduction 2 with 26 rules applied. Total rules applied 138 place count 148 transition count 451
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 170 place count 148 transition count 419
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 170 place count 148 transition count 414
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 180 place count 143 transition count 414
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 183 place count 140 transition count 394
Iterating global reduction 3 with 3 rules applied. Total rules applied 186 place count 140 transition count 394
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 220 place count 123 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 221 place count 123 transition count 376
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 223 place count 121 transition count 362
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 121 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 233 place count 121 transition count 354
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 4 with 8 rules applied. Total rules applied 241 place count 117 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 116 transition count 349
Applied a total of 242 rules in 78 ms. Remains 116 /223 variables (removed 107) and now considering 349/546 (removed 197) transitions.
[2026-05-25 09:41:35] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8968241586814951119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11493233181464123920.kers'
[2026-05-25 09:41:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8968241586814951119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11493233181464123920.kers]
Normalized transition count is 346 out of 347 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 346 rows 116 cols 1596 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-05-25 09:41:35] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11493233181464123920.kers
Total runtime 3 ms.
[2026-05-25 09:41:35] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 09:41:35] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2026-05-25 09:41:35] [INFO ] Invariant cache hit.
[2026-05-25 09:41:35] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 09:41:35] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2026-05-25 09:41:35] [INFO ] Redundant transitions in 5 ms returned []
Running 340 sub problems to find dead transitions.
[2026-05-25 09:41:35] [INFO ] Flow matrix only has 347 transitions (discarded 2 similar events)
[2026-05-25 09:41:35] [INFO ] Invariant cache hit.
[2026-05-25 09:41:35] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (OVERLAPS) 346/462 variables, 116/137 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 64/201 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 1/463 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 202 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 3 (OVERLAPS) 346/462 variables, 116/137 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 64/201 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 304/505 constraints. Problems are: Problem set: 36 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/506 constraints. Problems are: Problem set: 36 solved, 304 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/463 variables, and 506 constraints, problems are : Problem set: 36 solved, 304 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 304/340 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 36 solved, 304 unsolved
Search for dead transitions found 36 dead transitions in 60151ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 116/223 places, 313/546 transitions.
Applied a total of 0 rules in 7 ms. Remains 116 /116 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2026-05-25 09:42:35] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60561 ms. Remains : 116/223 places, 313/546 transitions.
[2026-05-25 09:42:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:42:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:42:35] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-25 09:42:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:42:35] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:42:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16506382148405019506.gal : 2 ms
[2026-05-25 09:42:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12736994424660938607.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16506382148405019506.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12736994424660938607.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (7406 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1409 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 361 steps, run visited all 1 properties in 11 ms. (steps per millisecond=32 )
Probabilistic random walk after 361 steps, saw 169 distinct states, run finished after 16 ms. (steps per millisecond=22 ) properties seen :1
FORMULA MedleyA-PT-17-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 193 transition count 498
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 193 transition count 498
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 94 place count 193 transition count 464
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 189 transition count 456
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 189 transition count 456
Applied a total of 102 rules in 5 ms. Remains 189 /223 variables (removed 34) and now considering 456/546 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6744671856262662128.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16669306823500515340.kers'
[2026-05-25 09:42:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6744671856262662128.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16669306823500515340.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 456 rows 189 cols 2294 entries
Finished phase 1 with 181 SingleSign rule and 1 generalized
[2026-05-25 09:42:35] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16669306823500515340.kers
Total runtime 3 ms.
[2026-05-25 09:42:35] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-05-25 09:42:35] [INFO ] Invariant cache hit.
[2026-05-25 09:42:36] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2026-05-25 09:42:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (OVERLAPS) 456/645 variables, 189/231 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/645 variables, and 232 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 8 (OVERLAPS) 456/645 variables, 189/243 constraints. Problems are: Problem set: 50 solved, 405 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 405/648 constraints. Problems are: Problem set: 50 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 648 constraints, problems are : Problem set: 50 solved, 405 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 405/455 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 50 solved, 405 unsolved
Search for dead transitions found 50 dead transitions in 60200ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/223 places, 406/546 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60594 ms. Remains : 189/223 places, 406/546 transitions.
[2026-05-25 09:43:36] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:43:36] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:43:36] [INFO ] Input system was already deterministic with 406 transitions.
[2026-05-25 09:43:36] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:43:36] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:43:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality13804330300845905217.gal : 2 ms
[2026-05-25 09:43:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality451008461869220844.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13804330300845905217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality451008461869220844.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 09:44:06] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:44:06] [INFO ] Applying decomposition
[2026-05-25 09:44:06] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7118390251646247892.txt' '-o' '/tmp/graph7118390251646247892.bin' '-w' '/tmp/graph7118390251646247892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7118390251646247892.bin' '-l' '-1' '-v' '-w' '/tmp/graph7118390251646247892.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:44:06] [INFO ] Decomposing Gal with order
[2026-05-25 09:44:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:44:06] [INFO ] Removed a total of 936 redundant transitions.
[2026-05-25 09:44:06] [INFO ] Flatten gal took : 33 ms
[2026-05-25 09:44:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 3 ms.
[2026-05-25 09:44:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality4748724023973133932.gal : 13 ms
[2026-05-25 09:44:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality2193224650105340132.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4748724023973133932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2193224650105340132.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77138e+07,6.81202,239376,2273,42,423435,2440,815,1.47306e+06,94,7172,0
Converting to forward existential form...Done !
original formula: AG(EX(EF(AG((i10.u6.p27==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U !(E(TRUE U !((i10.u6.p27==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t59, t76, t93, t162, t168, t170, t178, t184, t186, t210, t212, t218, t220, t242, t244, t250, ...990
(forward)formula 0,0,25.1729,836648,1,0,714206,2440,5763,8.4384e+06,444,7172,1424387
FORMULA MedleyA-PT-17-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 546/546 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 194 transition count 499
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 194 transition count 499
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 76 place count 194 transition count 481
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 190 transition count 473
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 190 transition count 473
Applied a total of 84 rules in 7 ms. Remains 190 /223 variables (removed 33) and now considering 473/546 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5901375078321434930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12400909608808722589.kers'
[2026-05-25 09:44:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5901375078321434930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12400909608808722589.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 473 rows 190 cols 2424 entries
Finished phase 1 with 182 SingleSign rule and 1 generalized
[2026-05-25 09:44:32] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12400909608808722589.kers
Total runtime 2 ms.
[2026-05-25 09:44:32] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-25 09:44:32] [INFO ] Invariant cache hit.
[2026-05-25 09:44:32] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-25 09:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/663 variables, and 51 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 6 (OVERLAPS) 473/663 variables, 190/244 constraints. Problems are: Problem set: 50 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 422/666 constraints. Problems are: Problem set: 50 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/663 variables, and 666 constraints, problems are : Problem set: 50 solved, 422 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 422/472 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60278ms problems are : Problem set: 50 solved, 422 unsolved
Search for dead transitions found 50 dead transitions in 60283ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/223 places, 423/546 transitions.
Applied a total of 0 rules in 5 ms. Remains 190 /190 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60714 ms. Remains : 190/223 places, 423/546 transitions.
[2026-05-25 09:45:32] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:45:32] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:45:32] [INFO ] Input system was already deterministic with 423 transitions.
[2026-05-25 09:45:32] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:45:32] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:45:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality7907452440503137855.gal : 3 ms
[2026-05-25 09:45:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality4685981462816202287.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7907452440503137855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4685981462816202287.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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.
[2026-05-25 09:46:02] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:46:02] [INFO ] Applying decomposition
[2026-05-25 09:46:02] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6772822607620904118.txt' '-o' '/tmp/graph6772822607620904118.bin' '-w' '/tmp/graph6772822607620904118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6772822607620904118.bin' '-l' '-1' '-v' '-w' '/tmp/graph6772822607620904118.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:46:03] [INFO ] Decomposing Gal with order
[2026-05-25 09:46:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:46:03] [INFO ] Removed a total of 960 redundant transitions.
[2026-05-25 09:46:03] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:46:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 5 ms.
[2026-05-25 09:46:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality5554499712480117649.gal : 2 ms
[2026-05-25 09:46:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality1754760877971275262.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5554499712480117649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1754760877971275262.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.87955e+07,0.97173,43520,2012,44,74391,572,785,201868,88,1517,0
Converting to forward existential form...Done !
original formula: EF((EX(EG(EF(((i8.i1.u48.p203==0)&&(i12.u39.p111==1))))) * ((i8.i1.u49.p206==0)||(u7.p38==1))))
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * ((i8.i1.u49.p206==0)||(u7.p38==1)))),E(TRUE U ((i8.i1.u48.p203==0)&&(i12.u39.p111==1...169
Reverse transition relation is NOT exact ! Due to transitions t12, t37, t41, t74, t97, t139, t156, t163, t169, t171, t179, t185, t187, t226, t229, t234, t2...968
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,21.8901,601964,1,0,707061,793,5683,5.01235e+06,474,2468,1473892
FORMULA MedleyA-PT-17-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 09:46:25] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:46:25] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:46:25] [INFO ] Applying decomposition
[2026-05-25 09:46:25] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11997130079012294607.txt' '-o' '/tmp/graph11997130079012294607.bin' '-w' '/tmp/graph11997130079012294607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11997130079012294607.bin' '-l' '-1' '-v' '-w' '/tmp/graph11997130079012294607.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:46:25] [INFO ] Decomposing Gal with order
[2026-05-25 09:46:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:46:25] [INFO ] Removed a total of 888 redundant transitions.
[2026-05-25 09:46:25] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:46:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 159 labels/synchronizations in 4 ms.
[2026-05-25 09:46:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality8873444813990242356.gal : 2 ms
[2026-05-25 09:46:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality16741987088705212582.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8873444813990242356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16741987088705212582.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.32051e+07,333.802,4034812,10103,8784,983078,1.8606e+06,980,1.57775e+07,304,4.49678e+07,0
Converting to forward existential form...Done !
original formula: (AF(E((AG(((i1.u54.p238==0)||(i4.u56.p87==1))) * A((i6.i2.u31.p154==1) U (((i4.u56.p90==0)||(i1.u13.p78==1))&&(i10.i1.u46.p216==1)))) U (...400
=> equivalent forward existential formula: ([FwdG(Init,!(E((!(E(TRUE U !(((i1.u54.p238==0)||(i4.u56.p87==1))))) * !((E(!((((i4.u56.p90==0)||(i1.u13.p78==1)...1069
Reverse transition relation is NOT exact ! Due to transitions t51, t80, t82, t88, t115, t125, t126, t162, t163, t165, t171, t194, t197, t200, t214, t218, t...1602
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
[2026-05-25 10:15:50] [INFO ] Applying decomposition
[2026-05-25 10:15:50] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:15:50] [INFO ] Decomposing Gal with order
[2026-05-25 10:15:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:15:50] [INFO ] Removed a total of 997 redundant transitions.
[2026-05-25 10:15:50] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:15:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 3 ms.
[2026-05-25 10:15:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality4759900153696911270.gal : 1 ms
[2026-05-25 10:15:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality16494085091723066161.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4759900153696911270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16494085091723066161.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.32051e+07,2.34637,81976,1388,2801,54387,70474,238,277419,548,748308,0
Converting to forward existential form...Done !
original formula: (AF(E((AG(((i0.i1.u11.p238==0)||(i0.i0.i1.u8.p87==1))) * A((i0.i1.u10.p154==1) U (((i0.i0.i1.u8.p90==0)||(i0.i0.i1.u7.p78==1))&&(i0.i1.u1...439
=> equivalent forward existential formula: ([FwdG(Init,!(E((!(E(TRUE U !(((i0.i1.u11.p238==0)||(i0.i0.i1.u8.p87==1))))) * !((E(!((((i0.i0.i1.u8.p90==0)||(i...1132
Reverse transition relation is NOT exact ! Due to transitions t244, t389, u12.t2, u12.t4, u12.t6, i0.t543, i0.t498, i0.i0.i0.u4.t219, i0.i0.i0.u4.t222, i0....2222
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-25 10:17:53] [INFO ] Flatten gal took : 30 ms
[2026-05-25 10:17:53] [INFO ] Input system was already deterministic with 546 transitions.
[2026-05-25 10:17:53] [INFO ] Transformed 223 places.
[2026-05-25 10:17:53] [INFO ] Transformed 546 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 10:17:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality4768857097018779560.gal : 7 ms
[2026-05-25 10:17:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality8452854727637524359.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4768857097018779560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8452854727637524359.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="MedleyA-PT-17"
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-5973"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-17, 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 r178-oct2-177969020000225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 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 ;
