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-177969020000289.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 MedleyB-PT-B02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 359K 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 MedleyB-PT-B02-CTLCardinality-2024-00
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-01
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-02
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-03
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-04
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-05
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-06
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-07
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-08
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-09
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-10
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-11
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-12
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-13
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-14
FORMULA_NAME MedleyB-PT-B02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779704941391

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 10:29:03] [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 10:29:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:29:03] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2026-05-25 10:29:03] [INFO ] Transformed 1227 places.
[2026-05-25 10:29:03] [INFO ] Transformed 1472 transitions.
[2026-05-25 10:29:03] [INFO ] Found NUPN structural information;
[2026-05-25 10:29:03] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyB-PT-B02-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 102 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 89 place count 1138 transition count 1383
Iterating global reduction 0 with 89 rules applied. Total rules applied 178 place count 1138 transition count 1383
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 224 place count 1092 transition count 1337
Iterating global reduction 0 with 46 rules applied. Total rules applied 270 place count 1092 transition count 1337
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 294 place count 1068 transition count 1313
Iterating global reduction 0 with 24 rules applied. Total rules applied 318 place count 1068 transition count 1313
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 340 place count 1046 transition count 1291
Iterating global reduction 0 with 22 rules applied. Total rules applied 362 place count 1046 transition count 1291
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 381 place count 1027 transition count 1272
Iterating global reduction 0 with 19 rules applied. Total rules applied 400 place count 1027 transition count 1272
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 417 place count 1010 transition count 1255
Iterating global reduction 0 with 17 rules applied. Total rules applied 434 place count 1010 transition count 1255
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 450 place count 994 transition count 1239
Iterating global reduction 0 with 16 rules applied. Total rules applied 466 place count 994 transition count 1239
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 479 place count 981 transition count 1226
Iterating global reduction 0 with 13 rules applied. Total rules applied 492 place count 981 transition count 1226
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 502 place count 971 transition count 1216
Iterating global reduction 0 with 10 rules applied. Total rules applied 512 place count 971 transition count 1216
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 519 place count 964 transition count 1209
Iterating global reduction 0 with 7 rules applied. Total rules applied 526 place count 964 transition count 1209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 527 place count 964 transition count 1208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 530 place count 961 transition count 1205
Iterating global reduction 1 with 3 rules applied. Total rules applied 533 place count 961 transition count 1205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 536 place count 958 transition count 1202
Iterating global reduction 1 with 3 rules applied. Total rules applied 539 place count 958 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 540 place count 957 transition count 1201
Iterating global reduction 1 with 1 rules applied. Total rules applied 541 place count 957 transition count 1201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 542 place count 956 transition count 1200
Iterating global reduction 1 with 1 rules applied. Total rules applied 543 place count 956 transition count 1200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 544 place count 955 transition count 1199
Iterating global reduction 1 with 1 rules applied. Total rules applied 545 place count 955 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 546 place count 954 transition count 1198
Iterating global reduction 1 with 1 rules applied. Total rules applied 547 place count 954 transition count 1198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 548 place count 953 transition count 1197
Iterating global reduction 1 with 1 rules applied. Total rules applied 549 place count 953 transition count 1197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 550 place count 952 transition count 1196
Iterating global reduction 1 with 1 rules applied. Total rules applied 551 place count 952 transition count 1196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 552 place count 951 transition count 1195
Iterating global reduction 1 with 1 rules applied. Total rules applied 553 place count 951 transition count 1195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 554 place count 950 transition count 1194
Iterating global reduction 1 with 1 rules applied. Total rules applied 555 place count 950 transition count 1194
Applied a total of 555 rules in 1050 ms. Remains 950 /1227 variables (removed 277) and now considering 1194/1472 (removed 278) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5276367733826043057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3258853586730218191.kers'
[2026-05-25 10:29:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5276367733826043057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3258853586730218191.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1194 rows 950 cols 3594 entries
Finished phase 1 with 945 SingleSign rule and 0 generalized
[2026-05-25 10:29:04] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3258853586730218191.kers
Total runtime 7 ms.
[2026-05-25 10:29:05] [INFO ] Implicit Places using invariants in 1211 ms returned []
[2026-05-25 10:29:05] [INFO ] Invariant cache hit.
[2026-05-25 10:29:07] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2800 ms to find 0 implicit places.
Running 1193 sub problems to find dead transitions.
[2026-05-25 10:29:07] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 949/2144 variables, and 0 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 1193/1193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1193 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 949/2144 variables, and 0 constraints, problems are : Problem set: 0 solved, 1193 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 0/1193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60699ms problems are : Problem set: 0 solved, 1193 unsolved
Search for dead transitions found 0 dead transitions in 60763ms
Starting structural reductions in LTL mode, iteration 1 : 950/1227 places, 1194/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64675 ms. Remains : 950/1227 places, 1194/1472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 1194/1194 transitions.
Applied a total of 0 rules in 30 ms. Remains 950 /950 variables (removed 0) and now considering 1194/1194 (removed 0) transitions.
[2026-05-25 10:30:08] [INFO ] Invariant cache hit.
[2026-05-25 10:30:08] [INFO ] Implicit Places using invariants in 517 ms returned []
[2026-05-25 10:30:08] [INFO ] Invariant cache hit.
[2026-05-25 10:30:09] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1625 ms. Remains : 950/950 places, 1194/1194 transitions.
Support contains 102 out of 950 places after structural reductions.
[2026-05-25 10:30:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 10:30:10] [INFO ] Flatten gal took : 100 ms
FORMULA MedleyB-PT-B02-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 10:30:10] [INFO ] Flatten gal took : 47 ms
[2026-05-25 10:30:10] [INFO ] Input system was already deterministic with 1194 transitions.
Support contains 84 out of 950 places (down from 102) after GAL structural reductions.
RANDOM walk for 40000 steps (511 resets) in 2688 ms. (14 steps per ms) remains 27/48 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (11 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 42 ms. (93 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (9 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (11 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (11 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (9 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (9 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (12 resets) in 61 ms. (64 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (11 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (10 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (12 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (9 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
[2026-05-25 10:30:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 898/950 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/950 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 1194/2144 variables, 950/956 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2144 variables, 0/956 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 956 constraints, problems are : Problem set: 1 solved, 26 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 950/950 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 901/950 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/950 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 950/2144 variables, and 14 constraints, problems are : Problem set: 1 solved, 26 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/950 constraints, PredecessorRefiner: 0/27 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10049ms problems are : Problem set: 1 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 1194/1194 transitions.
Graph (trivial) has 844 edges and 950 vertex of which 59 / 950 are part of one of the 11 SCC in 9 ms
Free SCC test removed 48 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 1379 edges and 902 vertex of which 898 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 582 transitions
Trivial Post-agglo rules discarded 582 transitions
Performed 582 trivial Post agglomeration. Transition count delta: 582
Iterating post reduction 0 with 586 rules applied. Total rules applied 588 place count 898 transition count 542
Reduce places removed 582 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 592 rules applied. Total rules applied 1180 place count 316 transition count 532
Reduce places removed 5 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 32 rules applied. Total rules applied 1212 place count 311 transition count 505
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 1239 place count 284 transition count 505
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1239 place count 284 transition count 456
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1337 place count 235 transition count 456
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1342 place count 230 transition count 451
Iterating global reduction 4 with 5 rules applied. Total rules applied 1347 place count 230 transition count 451
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1347 place count 230 transition count 450
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1349 place count 229 transition count 450
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1409 place count 199 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1411 place count 199 transition count 418
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1430 place count 180 transition count 277
Iterating global reduction 5 with 19 rules applied. Total rules applied 1449 place count 180 transition count 277
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1453 place count 180 transition count 273
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1458 place count 175 transition count 268
Iterating global reduction 6 with 5 rules applied. Total rules applied 1463 place count 175 transition count 268
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1468 place count 170 transition count 263
Iterating global reduction 6 with 5 rules applied. Total rules applied 1473 place count 170 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1475 place count 170 transition count 261
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1479 place count 168 transition count 259
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1493 place count 161 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1496 place count 161 transition count 273
Free-agglomeration rule applied 32 times.
Iterating global reduction 7 with 32 rules applied. Total rules applied 1528 place count 161 transition count 241
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 1560 place count 129 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 8 with 20 rules applied. Total rules applied 1580 place count 129 transition count 221
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1584 place count 129 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1586 place count 129 transition count 219
Applied a total of 1586 rules in 152 ms. Remains 129 /950 variables (removed 821) and now considering 219/1194 (removed 975) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 129/950 places, 219/1194 transitions.
RANDOM walk for 40000 steps (3190 resets) in 581 ms. (68 steps per ms) remains 19/26 properties
BEST_FIRST walk for 4003 steps (51 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (52 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (49 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (52 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (54 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (53 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (53 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (50 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (45 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (52 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (51 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (48 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (70 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (52 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (47 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (46 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (50 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (48 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (53 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-320175363571954727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4311142681482400626.kers'
[2026-05-25 10:30:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-320175363571954727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4311142681482400626.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 129 cols 726 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-25 10:30:21] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4311142681482400626.kers
Total runtime 1 ms.
[2026-05-25 10:30:21] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 92/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 219/348 variables, 129/134 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 198 constraints, problems are : Problem set: 0 solved, 19 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 129/129 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 92/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 219/348 variables, 129/145 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 64/209 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 19/228 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/348 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 235 constraints, problems are : Problem set: 0 solved, 19 unsolved in 4805 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 129/129 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5422ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 11 properties in 1452 ms.
Support contains 14 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 219/219 transitions.
Graph (trivial) has 74 edges and 129 vertex of which 4 / 129 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 126 transition count 180
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 91 transition count 178
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 73 place count 91 transition count 175
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 88 transition count 175
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 85 place count 82 transition count 169
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 82 transition count 169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 79 transition count 163
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 79 transition count 163
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 106 place count 79 transition count 154
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 120 place count 72 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 126 place count 72 transition count 141
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 132 place count 66 transition count 132
Iterating global reduction 4 with 6 rules applied. Total rules applied 138 place count 66 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 64 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 64 transition count 130
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 152 place count 64 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 64 transition count 118
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 165 place count 64 transition count 107
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 185 place count 53 transition count 98
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 189 place count 49 transition count 94
Iterating global reduction 6 with 4 rules applied. Total rules applied 193 place count 49 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 196 place count 49 transition count 91
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 199 place count 49 transition count 91
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 201 place count 49 transition count 89
Applied a total of 201 rules in 28 ms. Remains 49 /129 variables (removed 80) and now considering 89/219 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 49/129 places, 89/219 transitions.
RANDOM walk for 28154 steps (5 resets) in 110 ms. (253 steps per ms) remains 0/8 properties
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2026-05-25 10:30:28] [INFO ] Flatten gal took : 34 ms
[2026-05-25 10:30:28] [INFO ] Flatten gal took : 38 ms
[2026-05-25 10:30:28] [INFO ] Input system was already deterministic with 1194 transitions.
Support contains 71 out of 950 places (down from 81) after GAL structural reductions.
FORMULA MedleyB-PT-B02-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 165 stabilizing places and 173 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 950/950 places, 1194/1194 transitions.
Graph (trivial) has 937 edges and 950 vertex of which 66 / 950 are part of one of the 12 SCC in 2 ms
Free SCC test removed 54 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 672 transitions
Trivial Post-agglo rules discarded 672 transitions
Performed 672 trivial Post agglomeration. Transition count delta: 672
Iterating post reduction 0 with 672 rules applied. Total rules applied 673 place count 895 transition count 459
Reduce places removed 672 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 682 rules applied. Total rules applied 1355 place count 223 transition count 449
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 1362 place count 218 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1364 place count 216 transition count 447
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1364 place count 216 transition count 402
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1454 place count 171 transition count 402
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1466 place count 159 transition count 390
Iterating global reduction 4 with 12 rules applied. Total rules applied 1478 place count 159 transition count 390
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1478 place count 159 transition count 389
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1480 place count 158 transition count 389
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1487 place count 151 transition count 375
Iterating global reduction 4 with 7 rules applied. Total rules applied 1494 place count 151 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1496 place count 151 transition count 373
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1498 place count 149 transition count 371
Iterating global reduction 5 with 2 rules applied. Total rules applied 1500 place count 149 transition count 371
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1502 place count 147 transition count 369
Iterating global reduction 5 with 2 rules applied. Total rules applied 1504 place count 147 transition count 369
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 1556 place count 121 transition count 343
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1562 place count 121 transition count 337
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 1585 place count 98 transition count 188
Iterating global reduction 6 with 23 rules applied. Total rules applied 1608 place count 98 transition count 188
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1617 place count 98 transition count 179
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1630 place count 85 transition count 162
Iterating global reduction 7 with 13 rules applied. Total rules applied 1643 place count 85 transition count 162
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1656 place count 72 transition count 149
Iterating global reduction 7 with 13 rules applied. Total rules applied 1669 place count 72 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1675 place count 72 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1677 place count 71 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1681 place count 71 transition count 138
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 8 with 8 rules applied. Total rules applied 1689 place count 67 transition count 134
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1693 place count 67 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1694 place count 66 transition count 133
Applied a total of 1694 rules in 69 ms. Remains 66 /950 variables (removed 884) and now considering 133/1194 (removed 1061) transitions.
[2026-05-25 10:30:29] [INFO ] Flow matrix only has 128 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-12819227185664742015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9944914282271772356.kers'
[2026-05-25 10:30:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12819227185664742015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9944914282271772356.kers]
Normalized transition count is 127 out of 128 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 127 rows 65 cols 483 entries
Finished phase 1 with 64 SingleSign rule and 0 generalized
[2026-05-25 10:30:29] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9944914282271772356.kers
Total runtime 2 ms.
[2026-05-25 10:30:29] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 10:30:29] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
[2026-05-25 10:30:29] [INFO ] Invariant cache hit.
[2026-05-25 10:30:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 10:30:29] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2026-05-25 10:30:29] [INFO ] Redundant transitions in 2 ms returned []
Running 124 sub problems to find dead transitions.
[2026-05-25 10:30:29] [INFO ] Flow matrix only has 128 transitions (discarded 5 similar events)
[2026-05-25 10:30:29] [INFO ] Invariant cache hit.
[2026-05-25 10:30:29] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 127/193 variables, 66/81 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 1/194 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 97 constraints, problems are : Problem set: 0 solved, 124 unsolved in 9059 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 127/193 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 124/220 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 1/194 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (OVERLAPS) 0/194 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (OVERLAPS) 0/194 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 16 (OVERLAPS) 0/194 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 225 constraints, problems are : Problem set: 0 solved, 124 unsolved in 24583 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33678ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 33680ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/950 places, 133/1194 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33937 ms. Remains : 66/950 places, 133/1194 transitions.
[2026-05-25 10:31:02] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:31:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:31:02] [INFO ] Input system was already deterministic with 133 transitions.
[2026-05-25 10:31:02] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:31:02] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:31:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality12293074204062393528.gal : 5 ms
[2026-05-25 10:31:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality12098165641925735659.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12293074204062393528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12098165641925735659.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.
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,83866,0.189661,11548,2,2581,5,28197,6,0,389,25675,0


Converting to forward existential form...Done !
original formula: AG(AF(((AG((p203==0)) * (p441==1)) * ((p513==0)||(p157==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(E(TRUE U !((p203==0)))) * (p441==1)) * ((p513==0)||(p157==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t11, t12, t13, t21, t22, t23, t34, t46, t47, t54, t55, t56, t57, t59, t60, t61, t...343
(forward)formula 0,0,5.78317,139732,1,0,292,777520,290,133,3428,457982,320
FORMULA MedleyB-PT-B02-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 1194/1194 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 925 transition count 1169
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 925 transition count 1169
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 71 place count 904 transition count 1148
Iterating global reduction 0 with 21 rules applied. Total rules applied 92 place count 904 transition count 1148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 904 transition count 1147
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 108 place count 889 transition count 1132
Iterating global reduction 1 with 15 rules applied. Total rules applied 123 place count 889 transition count 1132
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 137 place count 875 transition count 1118
Iterating global reduction 1 with 14 rules applied. Total rules applied 151 place count 875 transition count 1118
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 163 place count 863 transition count 1106
Iterating global reduction 1 with 12 rules applied. Total rules applied 175 place count 863 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 176 place count 863 transition count 1105
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 185 place count 854 transition count 1096
Iterating global reduction 2 with 9 rules applied. Total rules applied 194 place count 854 transition count 1096
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 854 transition count 1095
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 203 place count 846 transition count 1087
Iterating global reduction 3 with 8 rules applied. Total rules applied 211 place count 846 transition count 1087
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 218 place count 839 transition count 1080
Iterating global reduction 3 with 7 rules applied. Total rules applied 225 place count 839 transition count 1080
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 232 place count 832 transition count 1073
Iterating global reduction 3 with 7 rules applied. Total rules applied 239 place count 832 transition count 1073
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 245 place count 826 transition count 1067
Iterating global reduction 3 with 6 rules applied. Total rules applied 251 place count 826 transition count 1067
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 252 place count 826 transition count 1066
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 256 place count 822 transition count 1062
Iterating global reduction 4 with 4 rules applied. Total rules applied 260 place count 822 transition count 1062
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 263 place count 819 transition count 1059
Iterating global reduction 4 with 3 rules applied. Total rules applied 266 place count 819 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 269 place count 816 transition count 1056
Iterating global reduction 4 with 3 rules applied. Total rules applied 272 place count 816 transition count 1056
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 275 place count 813 transition count 1053
Iterating global reduction 4 with 3 rules applied. Total rules applied 278 place count 813 transition count 1053
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 281 place count 810 transition count 1050
Iterating global reduction 4 with 3 rules applied. Total rules applied 284 place count 810 transition count 1050
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 285 place count 810 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 287 place count 808 transition count 1047
Iterating global reduction 5 with 2 rules applied. Total rules applied 289 place count 808 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 291 place count 806 transition count 1045
Iterating global reduction 5 with 2 rules applied. Total rules applied 293 place count 806 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 295 place count 804 transition count 1043
Iterating global reduction 5 with 2 rules applied. Total rules applied 297 place count 804 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 299 place count 802 transition count 1041
Iterating global reduction 5 with 2 rules applied. Total rules applied 301 place count 802 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 303 place count 800 transition count 1039
Iterating global reduction 5 with 2 rules applied. Total rules applied 305 place count 800 transition count 1039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 306 place count 800 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 307 place count 799 transition count 1037
Iterating global reduction 6 with 1 rules applied. Total rules applied 308 place count 799 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 309 place count 799 transition count 1036
Applied a total of 309 rules in 721 ms. Remains 799 /950 variables (removed 151) and now considering 1036/1194 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7487782817533542535.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11182937972062523668.kers'
[2026-05-25 10:31:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7487782817533542535.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11182937972062523668.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1036 rows 799 cols 3256 entries
Finished phase 1 with 794 SingleSign rule and 0 generalized
[2026-05-25 10:31:09] [INFO ] Computed 5 invariants in 6 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11182937972062523668.kers
Total runtime 7 ms.
[2026-05-25 10:31:10] [INFO ] Implicit Places using invariants in 466 ms returned []
[2026-05-25 10:31:10] [INFO ] Invariant cache hit.
[2026-05-25 10:31:11] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1540 ms to find 0 implicit places.
Running 1035 sub problems to find dead transitions.
[2026-05-25 10:31:11] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 798/1835 variables, and 0 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/799 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 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 798/1835 variables, and 0 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/799 constraints, PredecessorRefiner: 0/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 60375ms
Starting structural reductions in LTL mode, iteration 1 : 799/950 places, 1036/1194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62652 ms. Remains : 799/950 places, 1036/1194 transitions.
[2026-05-25 10:32:11] [INFO ] Flatten gal took : 37 ms
[2026-05-25 10:32:11] [INFO ] Flatten gal took : 27 ms
[2026-05-25 10:32:11] [INFO ] Input system was already deterministic with 1036 transitions.
[2026-05-25 10:32:11] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:32:11] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:32:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality8862741043739388116.gal : 14 ms
[2026-05-25 10:32:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality2488237118005790102.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/CTLCardinality8862741043739388116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2488237118005790102.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,9.757e+09,20.9369,462384,2,25297,5,1.39454e+06,6,0,4234,2.05652e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:32:41] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:32:41] [INFO ] Applying decomposition
[2026-05-25 10:32:41] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7595574334771673036.txt' '-o' '/tmp/graph7595574334771673036.bin' '-w' '/tmp/graph7595574334771673036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7595574334771673036.bin' '-l' '-1' '-v' '-w' '/tmp/graph7595574334771673036.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:32:42] [INFO ] Decomposing Gal with order
[2026-05-25 10:32:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:32:42] [INFO ] Removed a total of 853 redundant transitions.
[2026-05-25 10:32:42] [INFO ] Flatten gal took : 121 ms
[2026-05-25 10:32:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2026-05-25 10:32:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14333367222678408055.gal : 13 ms
[2026-05-25 10:32:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality2000414782941352287.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/CTLCardinality14333367222678408055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2000414782941352287.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,9.757e+09,15.8175,378912,2263,15,630709,916,1279,2.13303e+06,46,3222,0


Converting to forward existential form...Done !
original formula: E((AX(((i0.u8.p29==0) + EG((((i4.u42.p119==0)||(i8.i0.i0.u70.p283==1))||((i18.u150.p599==0)||(i25.i0.i0.u215.p754==1)))))) * (i19.u162.p6...205
=> equivalent forward existential formula: [(FwdU(Init,(!(EX(!(((i0.u8.p29==0) + EG((((i4.u42.p119==0)||(i8.i0.i0.u70.p283==1))||((i18.u150.p599==0)||(i25....269
Reverse transition relation is NOT exact ! Due to transitions t77, t159, t215, t249, t276, t339, t340, t396, t431, t513, t569, t602, t629, t684, t740, t760...585
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 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
Fast SCC detection found a local SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
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 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an 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 an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 1194/1194 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 924 transition count 1168
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 924 transition count 1168
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 73 place count 903 transition count 1147
Iterating global reduction 0 with 21 rules applied. Total rules applied 94 place count 903 transition count 1147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 903 transition count 1146
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 110 place count 888 transition count 1131
Iterating global reduction 1 with 15 rules applied. Total rules applied 125 place count 888 transition count 1131
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 140 place count 873 transition count 1116
Iterating global reduction 1 with 15 rules applied. Total rules applied 155 place count 873 transition count 1116
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 168 place count 860 transition count 1103
Iterating global reduction 1 with 13 rules applied. Total rules applied 181 place count 860 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 182 place count 860 transition count 1102
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 850 transition count 1092
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 850 transition count 1092
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 203 place count 850 transition count 1091
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 212 place count 841 transition count 1082
Iterating global reduction 3 with 9 rules applied. Total rules applied 221 place count 841 transition count 1082
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 229 place count 833 transition count 1074
Iterating global reduction 3 with 8 rules applied. Total rules applied 237 place count 833 transition count 1074
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 245 place count 825 transition count 1066
Iterating global reduction 3 with 8 rules applied. Total rules applied 253 place count 825 transition count 1066
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 259 place count 819 transition count 1060
Iterating global reduction 3 with 6 rules applied. Total rules applied 265 place count 819 transition count 1060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 819 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 270 place count 815 transition count 1055
Iterating global reduction 4 with 4 rules applied. Total rules applied 274 place count 815 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 277 place count 812 transition count 1052
Iterating global reduction 4 with 3 rules applied. Total rules applied 280 place count 812 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 283 place count 809 transition count 1049
Iterating global reduction 4 with 3 rules applied. Total rules applied 286 place count 809 transition count 1049
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 289 place count 806 transition count 1046
Iterating global reduction 4 with 3 rules applied. Total rules applied 292 place count 806 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 295 place count 803 transition count 1043
Iterating global reduction 4 with 3 rules applied. Total rules applied 298 place count 803 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 803 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 301 place count 801 transition count 1040
Iterating global reduction 5 with 2 rules applied. Total rules applied 303 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 305 place count 799 transition count 1038
Iterating global reduction 5 with 2 rules applied. Total rules applied 307 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 309 place count 797 transition count 1036
Iterating global reduction 5 with 2 rules applied. Total rules applied 311 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 313 place count 795 transition count 1034
Iterating global reduction 5 with 2 rules applied. Total rules applied 315 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 317 place count 793 transition count 1032
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 793 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 321 place count 792 transition count 1030
Iterating global reduction 6 with 1 rules applied. Total rules applied 322 place count 792 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 323 place count 792 transition count 1029
Applied a total of 323 rules in 578 ms. Remains 792 /950 variables (removed 158) and now considering 1029/1194 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8181830242807417661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15288730563650147239.kers'
[2026-05-25 10:33:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8181830242807417661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15288730563650147239.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1029 rows 792 cols 3242 entries
Finished phase 1 with 787 SingleSign rule and 0 generalized
[2026-05-25 10:33:13] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15288730563650147239.kers
Total runtime 7 ms.
[2026-05-25 10:33:13] [INFO ] Implicit Places using invariants in 654 ms returned []
[2026-05-25 10:33:13] [INFO ] Invariant cache hit.
[2026-05-25 10:33:14] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
Running 1028 sub problems to find dead transitions.
[2026-05-25 10:33:14] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 791/1821 variables, and 0 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/792 constraints, PredecessorRefiner: 1028/1028 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1028 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/1821 variables, and 0 constraints, problems are : Problem set: 0 solved, 1028 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/792 constraints, PredecessorRefiner: 0/1028 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60382ms problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Starting structural reductions in LTL mode, iteration 1 : 792/950 places, 1029/1194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62573 ms. Remains : 792/950 places, 1029/1194 transitions.
[2026-05-25 10:34:15] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:34:15] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:34:15] [INFO ] Input system was already deterministic with 1029 transitions.
[2026-05-25 10:34:15] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:34:15] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:34:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality5241361487570487930.gal : 5 ms
[2026-05-25 10:34:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality11704866403872005039.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/CTLCardinality5241361487570487930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11704866403872005039.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,9.49791e+09,21.8235,492344,2,30902,5,1.56373e+06,6,0,4199,2.11613e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:34:45] [INFO ] Flatten gal took : 44 ms
[2026-05-25 10:34:45] [INFO ] Applying decomposition
[2026-05-25 10:34:45] [INFO ] Flatten gal took : 28 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/graph15757441034985440499.txt' '-o' '/tmp/graph15757441034985440499.bin' '-w' '/tmp/graph15757441034985440499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15757441034985440499.bin' '-l' '-1' '-v' '-w' '/tmp/graph15757441034985440499.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:34:45] [INFO ] Decomposing Gal with order
[2026-05-25 10:34:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:34:45] [INFO ] Removed a total of 858 redundant transitions.
[2026-05-25 10:34:45] [INFO ] Flatten gal took : 36 ms
[2026-05-25 10:34:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 15 ms.
[2026-05-25 10:34:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17265099085524456914.gal : 7 ms
[2026-05-25 10:34:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality12948722714060362419.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/CTLCardinality17265099085524456914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12948722714060362419.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,9.49791e+09,8.97965,304996,2204,17,473820,813,1276,1.85523e+06,49,2477,0


Converting to forward existential form...Done !
original formula: A(!((AG(((EG((i4.i0.i0.u34.p96==0)) + (i30.i1.i1.u265.p968==1)) + EG((i26.u216.p769==0)))) + !(A((i20.u162.p627==0) U AF(((i24.u194.p700=...311
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(E(((i3.u28.p77==0)||(i11.u92.p336==1)) U (i36.u312.p1190==1)) U EX(TRUE)) * !(EG(!(((i10.u...799
Reverse transition relation is NOT exact ! Due to transitions t76, t158, t214, t248, t331, t421, t503, t504, t561, t594, t678, t733, t735, t755, t756, t759...588
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 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local 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 an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 1194/1194 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 923 transition count 1167
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 923 transition count 1167
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 76 place count 901 transition count 1145
Iterating global reduction 0 with 22 rules applied. Total rules applied 98 place count 901 transition count 1145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 901 transition count 1144
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 113 place count 887 transition count 1130
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 887 transition count 1130
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 140 place count 874 transition count 1117
Iterating global reduction 1 with 13 rules applied. Total rules applied 153 place count 874 transition count 1117
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 164 place count 863 transition count 1106
Iterating global reduction 1 with 11 rules applied. Total rules applied 175 place count 863 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 176 place count 863 transition count 1105
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 185 place count 854 transition count 1096
Iterating global reduction 2 with 9 rules applied. Total rules applied 194 place count 854 transition count 1096
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 854 transition count 1095
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 203 place count 846 transition count 1087
Iterating global reduction 3 with 8 rules applied. Total rules applied 211 place count 846 transition count 1087
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 218 place count 839 transition count 1080
Iterating global reduction 3 with 7 rules applied. Total rules applied 225 place count 839 transition count 1080
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 232 place count 832 transition count 1073
Iterating global reduction 3 with 7 rules applied. Total rules applied 239 place count 832 transition count 1073
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 246 place count 825 transition count 1066
Iterating global reduction 3 with 7 rules applied. Total rules applied 253 place count 825 transition count 1066
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 257 place count 821 transition count 1062
Iterating global reduction 3 with 4 rules applied. Total rules applied 261 place count 821 transition count 1062
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 264 place count 818 transition count 1059
Iterating global reduction 3 with 3 rules applied. Total rules applied 267 place count 818 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 270 place count 815 transition count 1056
Iterating global reduction 3 with 3 rules applied. Total rules applied 273 place count 815 transition count 1056
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 276 place count 812 transition count 1053
Iterating global reduction 3 with 3 rules applied. Total rules applied 279 place count 812 transition count 1053
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 282 place count 809 transition count 1050
Iterating global reduction 3 with 3 rules applied. Total rules applied 285 place count 809 transition count 1050
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 286 place count 809 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 288 place count 807 transition count 1047
Iterating global reduction 4 with 2 rules applied. Total rules applied 290 place count 807 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 292 place count 805 transition count 1045
Iterating global reduction 4 with 2 rules applied. Total rules applied 294 place count 805 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 296 place count 803 transition count 1043
Iterating global reduction 4 with 2 rules applied. Total rules applied 298 place count 803 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 300 place count 801 transition count 1041
Iterating global reduction 4 with 2 rules applied. Total rules applied 302 place count 801 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 304 place count 799 transition count 1039
Iterating global reduction 4 with 2 rules applied. Total rules applied 306 place count 799 transition count 1039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 307 place count 799 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 308 place count 798 transition count 1037
Iterating global reduction 5 with 1 rules applied. Total rules applied 309 place count 798 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 310 place count 798 transition count 1036
Applied a total of 310 rules in 626 ms. Remains 798 /950 variables (removed 152) and now considering 1036/1194 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17846812077664008639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14773997555515800424.kers'
[2026-05-25 10:35:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17846812077664008639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14773997555515800424.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1036 rows 798 cols 3258 entries
Finished phase 1 with 793 SingleSign rule and 0 generalized
[2026-05-25 10:35:16] [INFO ] Computed 5 invariants in 9 ms
Computed 5 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14773997555515800424.kers
Total runtime 10 ms.
[2026-05-25 10:35:16] [INFO ] Implicit Places using invariants in 446 ms returned []
[2026-05-25 10:35:16] [INFO ] Invariant cache hit.
[2026-05-25 10:35:17] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Running 1035 sub problems to find dead transitions.
[2026-05-25 10:35:17] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/1834 variables, and 0 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/798 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/1834 variables, and 0 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/798 constraints, PredecessorRefiner: 0/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60326ms problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 60328ms
Starting structural reductions in LTL mode, iteration 1 : 798/950 places, 1036/1194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62435 ms. Remains : 798/950 places, 1036/1194 transitions.
[2026-05-25 10:36:18] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:36:18] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:36:18] [INFO ] Input system was already deterministic with 1036 transitions.
[2026-05-25 10:36:18] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:36:18] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:36:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality8369513679737489903.gal : 4 ms
[2026-05-25 10:36:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality13833974278411833640.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/CTLCardinality8369513679737489903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13833974278411833640.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,9.76557e+09,20.9565,452060,2,25267,5,1.36286e+06,6,0,4230,1.96499e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:36:48] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:36:48] [INFO ] Applying decomposition
[2026-05-25 10:36:48] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16142002200444017981.txt' '-o' '/tmp/graph16142002200444017981.bin' '-w' '/tmp/graph16142002200444017981.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16142002200444017981.bin' '-l' '-1' '-v' '-w' '/tmp/graph16142002200444017981.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:36:48] [INFO ] Decomposing Gal with order
[2026-05-25 10:36:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:36:48] [INFO ] Removed a total of 862 redundant transitions.
[2026-05-25 10:36:48] [INFO ] Flatten gal took : 32 ms
[2026-05-25 10:36:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 12 ms.
[2026-05-25 10:36:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5472125643567425925.gal : 10 ms
[2026-05-25 10:36:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality17048213318956199044.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/CTLCardinality5472125643567425925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17048213318956199044.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,9.76557e+09,10.9405,362460,2457,17,596021,956,1350,2.08401e+06,48,3032,0


Converting to forward existential form...Done !
original formula: (A((!((!(((i12.i0.i0.u114.p397==0)||(i32.i0.i1.u310.p1145==1))) * EX((i24.u232.p865==1)))) * (i3.i0.i1.u44.p125==0)) U AF(!(((i19.i0.i1.u...225
=> equivalent forward existential formula: [FwdG(EY(EY((Init * !(!((E(!(!(EG(!(!(((i19.i0.i1.u174.p637==0)||(i16.u154.p589==1))))))) U (!((!((!(((i12.i0.i0...426
Reverse transition relation is NOT exact ! Due to transitions t76, t165, t218, t221, t255, t340, t393, t396, t430, t457, t512, t601, t683, t739, t759, t760...638
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 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an 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 an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 1194/1194 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 924 transition count 1168
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 924 transition count 1168
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 73 place count 903 transition count 1147
Iterating global reduction 0 with 21 rules applied. Total rules applied 94 place count 903 transition count 1147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 903 transition count 1146
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 110 place count 888 transition count 1131
Iterating global reduction 1 with 15 rules applied. Total rules applied 125 place count 888 transition count 1131
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 139 place count 874 transition count 1117
Iterating global reduction 1 with 14 rules applied. Total rules applied 153 place count 874 transition count 1117
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 165 place count 862 transition count 1105
Iterating global reduction 1 with 12 rules applied. Total rules applied 177 place count 862 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 178 place count 862 transition count 1104
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 187 place count 853 transition count 1095
Iterating global reduction 2 with 9 rules applied. Total rules applied 196 place count 853 transition count 1095
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 197 place count 853 transition count 1094
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 205 place count 845 transition count 1086
Iterating global reduction 3 with 8 rules applied. Total rules applied 213 place count 845 transition count 1086
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 220 place count 838 transition count 1079
Iterating global reduction 3 with 7 rules applied. Total rules applied 227 place count 838 transition count 1079
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 234 place count 831 transition count 1072
Iterating global reduction 3 with 7 rules applied. Total rules applied 241 place count 831 transition count 1072
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 247 place count 825 transition count 1066
Iterating global reduction 3 with 6 rules applied. Total rules applied 253 place count 825 transition count 1066
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 254 place count 825 transition count 1065
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 257 place count 822 transition count 1062
Iterating global reduction 4 with 3 rules applied. Total rules applied 260 place count 822 transition count 1062
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 263 place count 819 transition count 1059
Iterating global reduction 4 with 3 rules applied. Total rules applied 266 place count 819 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 269 place count 816 transition count 1056
Iterating global reduction 4 with 3 rules applied. Total rules applied 272 place count 816 transition count 1056
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 275 place count 813 transition count 1053
Iterating global reduction 4 with 3 rules applied. Total rules applied 278 place count 813 transition count 1053
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 281 place count 810 transition count 1050
Iterating global reduction 4 with 3 rules applied. Total rules applied 284 place count 810 transition count 1050
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 285 place count 810 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 287 place count 808 transition count 1047
Iterating global reduction 5 with 2 rules applied. Total rules applied 289 place count 808 transition count 1047
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 291 place count 806 transition count 1045
Iterating global reduction 5 with 2 rules applied. Total rules applied 293 place count 806 transition count 1045
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 295 place count 804 transition count 1043
Iterating global reduction 5 with 2 rules applied. Total rules applied 297 place count 804 transition count 1043
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 299 place count 802 transition count 1041
Iterating global reduction 5 with 2 rules applied. Total rules applied 301 place count 802 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 303 place count 800 transition count 1039
Iterating global reduction 5 with 2 rules applied. Total rules applied 305 place count 800 transition count 1039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 306 place count 800 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 307 place count 799 transition count 1037
Iterating global reduction 6 with 1 rules applied. Total rules applied 308 place count 799 transition count 1037
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 309 place count 799 transition count 1036
Applied a total of 309 rules in 657 ms. Remains 799 /950 variables (removed 151) and now considering 1036/1194 (removed 158) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18403974571716705006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18134913647797635674.kers'
[2026-05-25 10:37:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18403974571716705006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18134913647797635674.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1036 rows 799 cols 3258 entries
Finished phase 1 with 794 SingleSign rule and 0 generalized
[2026-05-25 10:37:19] [INFO ] Computed 5 invariants in 14 ms
Computed 5 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-18134913647797635674.kers
Total runtime 29 ms.
[2026-05-25 10:37:19] [INFO ] Implicit Places using invariants in 609 ms returned []
[2026-05-25 10:37:19] [INFO ] Invariant cache hit.
[2026-05-25 10:37:20] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
Running 1035 sub problems to find dead transitions.
[2026-05-25 10:37:20] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s3 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 798/1835 variables, and 0 constraints, problems are : Problem set: 0 solved, 1035 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/799 constraints, PredecessorRefiner: 1035/1035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1035 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/798 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1035 unsolved
SMT process timed out in 60270ms, After SMT, problems are : Problem set: 0 solved, 1035 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Starting structural reductions in LTL mode, iteration 1 : 799/950 places, 1036/1194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62525 ms. Remains : 799/950 places, 1036/1194 transitions.
[2026-05-25 10:38:21] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:38:21] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:38:21] [INFO ] Input system was already deterministic with 1036 transitions.
[2026-05-25 10:38:21] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:38:21] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:38:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality17350804395207593363.gal : 4 ms
[2026-05-25 10:38:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality8773885021501917451.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/CTLCardinality17350804395207593363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8773885021501917451.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,9.76264e+09,22.2933,503520,2,27701,5,1.51945e+06,6,0,4234,2.21008e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:38:51] [INFO ] Flatten gal took : 54 ms
[2026-05-25 10:38:51] [INFO ] Applying decomposition
[2026-05-25 10:38:51] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17719526963176156986.txt' '-o' '/tmp/graph17719526963176156986.bin' '-w' '/tmp/graph17719526963176156986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17719526963176156986.bin' '-l' '-1' '-v' '-w' '/tmp/graph17719526963176156986.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:38:51] [INFO ] Decomposing Gal with order
[2026-05-25 10:38:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:38:51] [INFO ] Removed a total of 855 redundant transitions.
[2026-05-25 10:38:51] [INFO ] Flatten gal took : 38 ms
[2026-05-25 10:38:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 16 ms.
[2026-05-25 10:38:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality3550485132131787936.gal : 6 ms
[2026-05-25 10:38:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality6822352943263831778.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/CTLCardinality3550485132131787936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6822352943263831778.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,9.76264e+09,10.6989,263836,2356,13,490916,848,1232,1.28604e+06,44,2626,0


Converting to forward existential form...Done !
original formula: E(!(AG(EX(((i10.i1.i0.u100.p341==1)||(!((i4.u47.p124==0)||(i28.u249.p915==1))))))) U (i6.u61.p172==1))
=> equivalent forward existential formula: [(FwdU(Init,!(!(E(TRUE U !(EX(((i10.i1.i0.u100.p341==1)||(!((i4.u47.p124==0)||(i28.u249.p915==1)))))))))) * (i6....178
Reverse transition relation is NOT exact ! Due to transitions t8, t77, t159, t251, t333, t389, t423, t505, t561, t594, t683, t759, t760, t763, t766, t769, ...600
(forward)formula 0,1,19.7451,407552,1,0,755268,860,11474,1.87068e+06,220,3600,2620825
FORMULA MedleyB-PT-B02-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 1194/1194 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 924 transition count 1168
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 924 transition count 1168
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 73 place count 903 transition count 1147
Iterating global reduction 0 with 21 rules applied. Total rules applied 94 place count 903 transition count 1147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 903 transition count 1146
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 109 place count 889 transition count 1132
Iterating global reduction 1 with 14 rules applied. Total rules applied 123 place count 889 transition count 1132
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 135 place count 877 transition count 1120
Iterating global reduction 1 with 12 rules applied. Total rules applied 147 place count 877 transition count 1120
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 157 place count 867 transition count 1110
Iterating global reduction 1 with 10 rules applied. Total rules applied 167 place count 867 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 168 place count 867 transition count 1109
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 176 place count 859 transition count 1101
Iterating global reduction 2 with 8 rules applied. Total rules applied 184 place count 859 transition count 1101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 185 place count 859 transition count 1100
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 192 place count 852 transition count 1093
Iterating global reduction 3 with 7 rules applied. Total rules applied 199 place count 852 transition count 1093
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 205 place count 846 transition count 1087
Iterating global reduction 3 with 6 rules applied. Total rules applied 211 place count 846 transition count 1087
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 217 place count 840 transition count 1081
Iterating global reduction 3 with 6 rules applied. Total rules applied 223 place count 840 transition count 1081
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 228 place count 835 transition count 1076
Iterating global reduction 3 with 5 rules applied. Total rules applied 233 place count 835 transition count 1076
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 237 place count 831 transition count 1072
Iterating global reduction 3 with 4 rules applied. Total rules applied 241 place count 831 transition count 1072
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 243 place count 829 transition count 1070
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 829 transition count 1070
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 247 place count 827 transition count 1068
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 827 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 251 place count 825 transition count 1066
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 825 transition count 1066
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 255 place count 823 transition count 1064
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 823 transition count 1064
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 823 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 259 place count 822 transition count 1062
Iterating global reduction 4 with 1 rules applied. Total rules applied 260 place count 822 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 261 place count 821 transition count 1061
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 821 transition count 1061
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 263 place count 820 transition count 1060
Iterating global reduction 4 with 1 rules applied. Total rules applied 264 place count 820 transition count 1060
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 265 place count 819 transition count 1059
Iterating global reduction 4 with 1 rules applied. Total rules applied 266 place count 819 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 267 place count 818 transition count 1058
Iterating global reduction 4 with 1 rules applied. Total rules applied 268 place count 818 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 269 place count 818 transition count 1057
Applied a total of 269 rules in 640 ms. Remains 818 /950 variables (removed 132) and now considering 1057/1194 (removed 137) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9259934436719037958.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16012703803903019551.kers'
[2026-05-25 10:39:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9259934436719037958.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16012703803903019551.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1057 rows 818 cols 3302 entries
Finished phase 1 with 813 SingleSign rule and 0 generalized
[2026-05-25 10:39:12] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16012703803903019551.kers
Total runtime 5 ms.
[2026-05-25 10:39:12] [INFO ] Implicit Places using invariants in 608 ms returned []
[2026-05-25 10:39:12] [INFO ] Invariant cache hit.
[2026-05-25 10:39:13] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
Running 1056 sub problems to find dead transitions.
[2026-05-25 10:39:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 30278ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 30288ms
Starting structural reductions in LTL mode, iteration 1 : 818/950 places, 1057/1194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32576 ms. Remains : 818/950 places, 1057/1194 transitions.
[2026-05-25 10:39:43] [INFO ] Flatten gal took : 39 ms
[2026-05-25 10:39:43] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:39:44] [INFO ] Input system was already deterministic with 1057 transitions.
[2026-05-25 10:39:44] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:39:44] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:39:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality7418638825497136740.gal : 4 ms
[2026-05-25 10:39:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality10318908913696160425.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/CTLCardinality7418638825497136740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10318908913696160425.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,1.04399e+10,25.1103,458240,2,26205,5,1.3748e+06,6,0,4331,1.99746e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:40:14] [INFO ] Flatten gal took : 33 ms
[2026-05-25 10:40:14] [INFO ] Applying decomposition
[2026-05-25 10:40:14] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph266188092172876666.txt' '-o' '/tmp/graph266188092172876666.bin' '-w' '/tmp/graph266188092172876666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph266188092172876666.bin' '-l' '-1' '-v' '-w' '/tmp/graph266188092172876666.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:40:14] [INFO ] Decomposing Gal with order
[2026-05-25 10:40:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:40:14] [INFO ] Removed a total of 858 redundant transitions.
[2026-05-25 10:40:14] [INFO ] Flatten gal took : 39 ms
[2026-05-25 10:40:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 11 ms.
[2026-05-25 10:40:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality11151888833207294436.gal : 6 ms
[2026-05-25 10:40:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11071714759715860770.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/CTLCardinality11151888833207294436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11071714759715860770.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,1.04399e+10,7.08629,195752,2374,14,333762,927,1308,1.07013e+06,47,2827,0


Converting to forward existential form...Done !
original formula: EF((AX((i15.i0.i0.u136.p459==1)) * ((((i12.i0.i0.u114.p398==0)&&(i33.u311.p1110==1))||((i26.u222.p771==0)&&(i26.u226.p797==1)))||(((i0.u4...243
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((((i12.i0.i0.u114.p398==0)&&(i33.u311.p1110==1))||((i26.u222.p771==0)&&(i26.u226.p797==1))...301
Reverse transition relation is NOT exact ! Due to transitions t78, t89, t113, t168, t258, t346, t348, t401, t404, t438, t441, t464, t527, t616, t643, t698,...567
(forward)formula 0,1,9.88086,195752,1,0,333762,927,8617,1.07013e+06,195,2827,1292569
FORMULA MedleyB-PT-B02-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 950/950 places, 1194/1194 transitions.
Graph (trivial) has 943 edges and 950 vertex of which 66 / 950 are part of one of the 12 SCC in 4 ms
Free SCC test removed 54 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 679 transitions
Trivial Post-agglo rules discarded 679 transitions
Performed 679 trivial Post agglomeration. Transition count delta: 679
Iterating post reduction 0 with 679 rules applied. Total rules applied 680 place count 895 transition count 452
Reduce places removed 679 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 690 rules applied. Total rules applied 1370 place count 216 transition count 441
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1376 place count 211 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1377 place count 210 transition count 440
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1377 place count 210 transition count 395
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1467 place count 165 transition count 395
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1479 place count 153 transition count 383
Iterating global reduction 4 with 12 rules applied. Total rules applied 1491 place count 153 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1491 place count 153 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1493 place count 152 transition count 382
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1500 place count 145 transition count 368
Iterating global reduction 4 with 7 rules applied. Total rules applied 1507 place count 145 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1509 place count 145 transition count 366
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1511 place count 143 transition count 364
Iterating global reduction 5 with 2 rules applied. Total rules applied 1513 place count 143 transition count 364
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1515 place count 141 transition count 362
Iterating global reduction 5 with 2 rules applied. Total rules applied 1517 place count 141 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1518 place count 141 transition count 361
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 1570 place count 115 transition count 335
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1576 place count 115 transition count 329
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 1599 place count 92 transition count 180
Iterating global reduction 7 with 23 rules applied. Total rules applied 1622 place count 92 transition count 180
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1633 place count 92 transition count 169
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1646 place count 79 transition count 152
Iterating global reduction 8 with 13 rules applied. Total rules applied 1659 place count 79 transition count 152
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1672 place count 66 transition count 139
Iterating global reduction 8 with 13 rules applied. Total rules applied 1685 place count 66 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1691 place count 66 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1693 place count 65 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1697 place count 65 transition count 128
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 9 with 8 rules applied. Total rules applied 1705 place count 61 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1706 place count 60 transition count 123
Applied a total of 1706 rules in 91 ms. Remains 60 /950 variables (removed 890) and now considering 123/1194 (removed 1071) transitions.
[2026-05-25 10:40:24] [INFO ] Flow matrix only has 118 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-2833010539174327570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3863409963092018042.kers'
[2026-05-25 10:40:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2833010539174327570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3863409963092018042.kers]
Normalized transition count is 117 out of 118 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 117 rows 59 cols 463 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-25 10:40:24] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3863409963092018042.kers
Total runtime 1 ms.
[2026-05-25 10:40:24] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 10:40:24] [INFO ] Flow matrix only has 118 transitions (discarded 5 similar events)
[2026-05-25 10:40:24] [INFO ] Invariant cache hit.
[2026-05-25 10:40:24] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 10:40:24] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2026-05-25 10:40:24] [INFO ] Redundant transitions in 1 ms returned []
Running 114 sub problems to find dead transitions.
[2026-05-25 10:40:24] [INFO ] Flow matrix only has 118 transitions (discarded 5 similar events)
[2026-05-25 10:40:24] [INFO ] Invariant cache hit.
[2026-05-25 10:40:24] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 117/177 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 1/178 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/178 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/178 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 87 constraints, problems are : Problem set: 0 solved, 114 unsolved in 8836 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 4/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 117/177 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 114/204 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 1/178 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 0/178 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 205 constraints, problems are : Problem set: 0 solved, 114 unsolved in 11306 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20190ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 20191ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/950 places, 123/1194 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20744 ms. Remains : 60/950 places, 123/1194 transitions.
[2026-05-25 10:40:45] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:40:45] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:40:45] [INFO ] Input system was already deterministic with 123 transitions.
[2026-05-25 10:40:45] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:40:45] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:40:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5023463716624828784.gal : 1 ms
[2026-05-25 10:40:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17866844777572673073.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5023463716624828784.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17866844777572673073.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 507 steps (52 resets) in 9 ms. (50 steps per ms) remains 0/1 properties
FORMULA MedleyB-PT-B02-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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 : 950/950 places, 1194/1194 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 922 transition count 1166
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 922 transition count 1166
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 79 place count 899 transition count 1143
Iterating global reduction 0 with 23 rules applied. Total rules applied 102 place count 899 transition count 1143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 899 transition count 1142
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 119 place count 883 transition count 1126
Iterating global reduction 1 with 16 rules applied. Total rules applied 135 place count 883 transition count 1126
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 150 place count 868 transition count 1111
Iterating global reduction 1 with 15 rules applied. Total rules applied 165 place count 868 transition count 1111
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 177 place count 856 transition count 1099
Iterating global reduction 1 with 12 rules applied. Total rules applied 189 place count 856 transition count 1099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 190 place count 856 transition count 1098
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 199 place count 847 transition count 1089
Iterating global reduction 2 with 9 rules applied. Total rules applied 208 place count 847 transition count 1089
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 209 place count 847 transition count 1088
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 217 place count 839 transition count 1080
Iterating global reduction 3 with 8 rules applied. Total rules applied 225 place count 839 transition count 1080
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 232 place count 832 transition count 1073
Iterating global reduction 3 with 7 rules applied. Total rules applied 239 place count 832 transition count 1073
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 246 place count 825 transition count 1066
Iterating global reduction 3 with 7 rules applied. Total rules applied 253 place count 825 transition count 1066
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 259 place count 819 transition count 1060
Iterating global reduction 3 with 6 rules applied. Total rules applied 265 place count 819 transition count 1060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 819 transition count 1059
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 270 place count 815 transition count 1055
Iterating global reduction 4 with 4 rules applied. Total rules applied 274 place count 815 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 277 place count 812 transition count 1052
Iterating global reduction 4 with 3 rules applied. Total rules applied 280 place count 812 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 283 place count 809 transition count 1049
Iterating global reduction 4 with 3 rules applied. Total rules applied 286 place count 809 transition count 1049
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 289 place count 806 transition count 1046
Iterating global reduction 4 with 3 rules applied. Total rules applied 292 place count 806 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 295 place count 803 transition count 1043
Iterating global reduction 4 with 3 rules applied. Total rules applied 298 place count 803 transition count 1043
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 803 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 301 place count 801 transition count 1040
Iterating global reduction 5 with 2 rules applied. Total rules applied 303 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 305 place count 799 transition count 1038
Iterating global reduction 5 with 2 rules applied. Total rules applied 307 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 309 place count 797 transition count 1036
Iterating global reduction 5 with 2 rules applied. Total rules applied 311 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 313 place count 795 transition count 1034
Iterating global reduction 5 with 2 rules applied. Total rules applied 315 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 317 place count 793 transition count 1032
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 793 transition count 1032
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 793 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 321 place count 792 transition count 1030
Iterating global reduction 6 with 1 rules applied. Total rules applied 322 place count 792 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 323 place count 792 transition count 1029
Applied a total of 323 rules in 630 ms. Remains 792 /950 variables (removed 158) and now considering 1029/1194 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15652648263584459373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9448707851326566034.kers'
[2026-05-25 10:40:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15652648263584459373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9448707851326566034.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1029 rows 792 cols 3242 entries
Finished phase 1 with 787 SingleSign rule and 0 generalized
[2026-05-25 10:40:45] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9448707851326566034.kers
Total runtime 5 ms.
[2026-05-25 10:40:46] [INFO ] Implicit Places using invariants in 420 ms returned []
[2026-05-25 10:40:46] [INFO ] Invariant cache hit.
[2026-05-25 10:40:47] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
Running 1028 sub problems to find dead transitions.
[2026-05-25 10:40:47] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 0 (INCLUDED_ONLY) 0/791 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1028 unsolved
SMT process timed out in 30244ms, After SMT, problems are : Problem set: 0 solved, 1028 unsolved
Search for dead transitions found 0 dead transitions in 30245ms
Starting structural reductions in LTL mode, iteration 1 : 792/950 places, 1029/1194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32163 ms. Remains : 792/950 places, 1029/1194 transitions.
[2026-05-25 10:41:17] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:41:17] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:41:17] [INFO ] Input system was already deterministic with 1029 transitions.
[2026-05-25 10:41:17] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:41:17] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:41:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality12992169826115756611.gal : 4 ms
[2026-05-25 10:41:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality1369541127423918256.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/CTLCardinality12992169826115756611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1369541127423918256.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,9.5771e+09,20.0952,487764,2,30842,5,1.55725e+06,6,0,4199,2.11149e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:41:47] [INFO ] Flatten gal took : 31 ms
[2026-05-25 10:41:47] [INFO ] Applying decomposition
[2026-05-25 10:41:47] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16020549191100293224.txt' '-o' '/tmp/graph16020549191100293224.bin' '-w' '/tmp/graph16020549191100293224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16020549191100293224.bin' '-l' '-1' '-v' '-w' '/tmp/graph16020549191100293224.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:41:47] [INFO ] Decomposing Gal with order
[2026-05-25 10:41:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:41:47] [INFO ] Removed a total of 856 redundant transitions.
[2026-05-25 10:41:47] [INFO ] Flatten gal took : 43 ms
[2026-05-25 10:41:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 10:41:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality119089967809040100.gal : 6 ms
[2026-05-25 10:41:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality6764319360173492930.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/CTLCardinality119089967809040100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6764319360173492930.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,9.5771e+09,14.0053,328720,2431,15,547632,904,1293,1.86757e+06,49,3084,0


Converting to forward existential form...Done !
original formula: A(EX((!(AG((i29.u268.p971==0))) + !((AX((i9.u76.p295==1)) * AX((i36.u229.p860==0)))))) U !(A(EX(!(((i24.i0.i1.u218.p764==1)||(i17.u158.p6...197
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(EX((i11.i0.i1.u98.p357==0))) U (!(EX(!(((i24.i0.i1.u218.p764==1)||(i17.u158.p601==0)))...725
Reverse transition relation is NOT exact ! Due to transitions t76, t157, t158, t214, t248, t334, t335, t391, t425, t507, t563, t596, t678, t734, t754, t755...617
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 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an 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 an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 950/950 places, 1194/1194 transitions.
Graph (trivial) has 934 edges and 950 vertex of which 66 / 950 are part of one of the 12 SCC in 3 ms
Free SCC test removed 54 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 668 transitions
Trivial Post-agglo rules discarded 668 transitions
Performed 668 trivial Post agglomeration. Transition count delta: 668
Iterating post reduction 0 with 668 rules applied. Total rules applied 669 place count 895 transition count 463
Reduce places removed 668 places and 0 transitions.
Ensure Unique test 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 1 with 677 rules applied. Total rules applied 1346 place count 227 transition count 454
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 1353 place count 223 transition count 451
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1356 place count 220 transition count 451
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1356 place count 220 transition count 406
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1446 place count 175 transition count 406
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1458 place count 163 transition count 394
Iterating global reduction 4 with 12 rules applied. Total rules applied 1470 place count 163 transition count 394
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1470 place count 163 transition count 393
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1472 place count 162 transition count 393
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1478 place count 156 transition count 387
Iterating global reduction 4 with 6 rules applied. Total rules applied 1484 place count 156 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1485 place count 156 transition count 386
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1487 place count 154 transition count 384
Iterating global reduction 5 with 2 rules applied. Total rules applied 1489 place count 154 transition count 384
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1491 place count 152 transition count 382
Iterating global reduction 5 with 2 rules applied. Total rules applied 1493 place count 152 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1494 place count 152 transition count 381
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 1546 place count 126 transition count 355
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1552 place count 126 transition count 349
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 1575 place count 103 transition count 200
Iterating global reduction 7 with 23 rules applied. Total rules applied 1598 place count 103 transition count 200
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1608 place count 103 transition count 190
Discarding 13 places :
Symmetric choice reduction at 8 with 13 rule applications. Total rules 1621 place count 90 transition count 173
Iterating global reduction 8 with 13 rules applied. Total rules applied 1634 place count 90 transition count 173
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1646 place count 78 transition count 158
Iterating global reduction 8 with 12 rules applied. Total rules applied 1658 place count 78 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1664 place count 78 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1666 place count 77 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1670 place count 77 transition count 147
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 9 with 8 rules applied. Total rules applied 1678 place count 73 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1679 place count 72 transition count 142
Applied a total of 1679 rules in 74 ms. Remains 72 /950 variables (removed 878) and now considering 142/1194 (removed 1052) transitions.
[2026-05-25 10:42:17] [INFO ] Flow matrix only has 137 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-10828570491052343053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6239722158438427738.kers'
[2026-05-25 10:42:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10828570491052343053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6239722158438427738.kers]
Normalized transition count is 136 out of 137 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 72 cols 518 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-25 10:42:17] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6239722158438427738.kers
Total runtime 2 ms.
[2026-05-25 10:42:17] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 10:42:18] [INFO ] Flow matrix only has 137 transitions (discarded 5 similar events)
[2026-05-25 10:42:18] [INFO ] Invariant cache hit.
[2026-05-25 10:42:18] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 10:42:18] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2026-05-25 10:42:18] [INFO ] Redundant transitions in 1 ms returned []
Running 134 sub problems to find dead transitions.
[2026-05-25 10:42:18] [INFO ] Flow matrix only has 137 transitions (discarded 5 similar events)
[2026-05-25 10:42:18] [INFO ] Invariant cache hit.
[2026-05-25 10:42:18] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 136/208 variables, 72/91 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 14/105 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 1/209 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/209 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 107 constraints, problems are : Problem set: 0 solved, 134 unsolved in 11907 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 4/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 136/208 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 134/240 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 1/209 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 0/209 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 245 constraints, problems are : Problem set: 0 solved, 134 unsolved in 20321 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32246ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 32246ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/950 places, 142/1194 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32573 ms. Remains : 72/950 places, 142/1194 transitions.
[2026-05-25 10:42:50] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:42:50] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:42:50] [INFO ] Input system was already deterministic with 142 transitions.
[2026-05-25 10:42:50] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:42:50] [INFO ] Flatten gal took : 2 ms
[2026-05-25 10:42:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality1367995741051251791.gal : 1 ms
[2026-05-25 10:42:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality13962330597626335937.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/CTLCardinality1367995741051251791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13962330597626335937.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,169268,0.171699,11484,2,2701,5,24462,6,0,422,26265,0


Converting to forward existential form...Done !
original formula: EF((EF((((p908==1)&&(p41==0))&&(p1218==1))) * !(A((p1058==1) U EG(((p1203==0)||(p299==1)))))))
=> equivalent forward existential formula: ([((FwdU((FwdU(Init,TRUE) * E(TRUE U (((p908==1)&&(p41==0))&&(p1218==1)))),!(EG(((p1203==0)||(p299==1))))) * !((...327
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t8, t16, t17, t18, t25, t26, t27, t33, t35, t36, t37, t52, t61, t62, t66, t67, t6...330
(forward)formula 0,1,9.9062,244700,1,0,539,1.39012e+06,312,249,3641,1.05547e+06,612
FORMULA MedleyB-PT-B02-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 950/950 places, 1194/1194 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 926 transition count 1170
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 926 transition count 1170
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 67 place count 907 transition count 1151
Iterating global reduction 0 with 19 rules applied. Total rules applied 86 place count 907 transition count 1151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 87 place count 907 transition count 1150
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 99 place count 895 transition count 1138
Iterating global reduction 1 with 12 rules applied. Total rules applied 111 place count 895 transition count 1138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 121 place count 885 transition count 1128
Iterating global reduction 1 with 10 rules applied. Total rules applied 131 place count 885 transition count 1128
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 140 place count 876 transition count 1119
Iterating global reduction 1 with 9 rules applied. Total rules applied 149 place count 876 transition count 1119
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 157 place count 868 transition count 1111
Iterating global reduction 1 with 8 rules applied. Total rules applied 165 place count 868 transition count 1111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 166 place count 868 transition count 1110
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 173 place count 861 transition count 1103
Iterating global reduction 2 with 7 rules applied. Total rules applied 180 place count 861 transition count 1103
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 185 place count 856 transition count 1098
Iterating global reduction 2 with 5 rules applied. Total rules applied 190 place count 856 transition count 1098
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 195 place count 851 transition count 1093
Iterating global reduction 2 with 5 rules applied. Total rules applied 200 place count 851 transition count 1093
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 205 place count 846 transition count 1088
Iterating global reduction 2 with 5 rules applied. Total rules applied 210 place count 846 transition count 1088
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 212 place count 844 transition count 1086
Iterating global reduction 2 with 2 rules applied. Total rules applied 214 place count 844 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 215 place count 843 transition count 1085
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 843 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 217 place count 842 transition count 1084
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 842 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 219 place count 841 transition count 1083
Iterating global reduction 2 with 1 rules applied. Total rules applied 220 place count 841 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 221 place count 840 transition count 1082
Iterating global reduction 2 with 1 rules applied. Total rules applied 222 place count 840 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 840 transition count 1081
Applied a total of 223 rules in 502 ms. Remains 840 /950 variables (removed 110) and now considering 1081/1194 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15929936908740950246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3017666047707265372.kers'
[2026-05-25 10:43:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15929936908740950246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3017666047707265372.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1081 rows 840 cols 3358 entries
Finished phase 1 with 835 SingleSign rule and 0 generalized
[2026-05-25 10:43:00] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3017666047707265372.kers
Total runtime 7 ms.
[2026-05-25 10:43:01] [INFO ] Implicit Places using invariants in 692 ms returned []
[2026-05-25 10:43:01] [INFO ] Invariant cache hit.
[2026-05-25 10:43:02] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2026-05-25 10:43:02] [INFO ] Invariant cache hit.
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 839/1921 variables, and 0 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/840 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 839/1921 variables, and 0 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/840 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Starting structural reductions in LTL mode, iteration 1 : 840/950 places, 1081/1194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62628 ms. Remains : 840/950 places, 1081/1194 transitions.
[2026-05-25 10:44:03] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:44:03] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:44:03] [INFO ] Input system was already deterministic with 1081 transitions.
[2026-05-25 10:44:03] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:44:03] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:44:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality8777148698614053977.gal : 4 ms
[2026-05-25 10:44:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality15593964763143584167.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/CTLCardinality8777148698614053977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15593964763143584167.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,1.12352e+10,23.8058,522144,2,28141,5,1.5835e+06,6,0,4443,2.29348e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 10:44:33] [INFO ] Flatten gal took : 34 ms
[2026-05-25 10:44:33] [INFO ] Applying decomposition
[2026-05-25 10:44:33] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18373397513697495334.txt' '-o' '/tmp/graph18373397513697495334.bin' '-w' '/tmp/graph18373397513697495334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18373397513697495334.bin' '-l' '-1' '-v' '-w' '/tmp/graph18373397513697495334.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:44:33] [INFO ] Decomposing Gal with order
[2026-05-25 10:44:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:44:33] [INFO ] Removed a total of 862 redundant transitions.
[2026-05-25 10:44:33] [INFO ] Flatten gal took : 45 ms
[2026-05-25 10:44:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2026-05-25 10:44:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6106486506368541853.gal : 8 ms
[2026-05-25 10:44:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality7389228830735642549.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/CTLCardinality6106486506368541853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7389228830735642549.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,1.12352e+10,5.99188,192172,2358,18,325244,1017,1301,1.05335e+06,53,3062,0


Converting to forward existential form...Done !
original formula: EG(((EX((AG((i26.u236.p820==1)) * ((i6.u64.p219==0)||(i0.i0.i0.u10.p31==1)))) + AF(((EG(((i2.u5.p16==0)||(i3.i1.i0.u38.p108==1))) + (i3.i...438
=> equivalent forward existential formula: [FwdG(Init,((EX((!(E(TRUE U !((i26.u236.p820==1)))) * ((i6.u64.p219==0)||(i0.i0.i0.u10.p31==1)))) + !(EG(!(((EG(...556
Reverse transition relation is NOT exact ! Due to transitions t24, t77, t218, t252, t348, t349, t405, t439, t582, t615, t714, t790, t791, t794, t797, t800,...631
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 7
Fast SCC detection found a local 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 an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Detected timeout of ITS tools.
[2026-05-25 10:45:03] [INFO ] Flatten gal took : 36 ms
[2026-05-25 10:45:03] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:45:03] [INFO ] Applying decomposition
[2026-05-25 10:45:03] [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/graph1137574949657146212.txt' '-o' '/tmp/graph1137574949657146212.bin' '-w' '/tmp/graph1137574949657146212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1137574949657146212.bin' '-l' '-1' '-v' '-w' '/tmp/graph1137574949657146212.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:45:03] [INFO ] Decomposing Gal with order
[2026-05-25 10:45:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:45:03] [INFO ] Removed a total of 880 redundant transitions.
[2026-05-25 10:45:03] [INFO ] Flatten gal took : 46 ms
[2026-05-25 10:45:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2026-05-25 10:45:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality17730994890746512654.gal : 6 ms
[2026-05-25 10:45:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality2591651094710046160.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/CTLCardinality17730994890746512654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2591651094710046160.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.69931e+10,16.7183,532420,3454,18,791285,1200,1391,3.58397e+06,53,3998,0


Converting to forward existential form...Done !
original formula: E((AX(((i1.u10.p29==0) + EG((((i5.i0.i0.u46.p119==0)||(i12.u93.p283==1))||((i24.u184.p599==0)||(i30.u247.p754==1)))))) * (i25.u196.p610==...195
=> equivalent forward existential formula: [(FwdU(Init,(!(EX(!(((i1.u10.p29==0) + EG((((i5.i0.i0.u46.p119==0)||(i12.u93.p283==1))||((i24.u184.p599==0)||(i3...259
Reverse transition relation is NOT exact ! Due to transitions t8, t27, t37, t84, t104, t186, t187, t244, t246, t280, t324, t388, t389, t446, t481, t526, t5...646
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 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found a local SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
(forward)formula 0,0,428.525,2987512,1,0,3.09338e+06,1200,3485,2.82648e+07,111,4588,834148
FORMULA MedleyB-PT-B02-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: A(!((AG(((EG((i4.u38.p96==0)) + (i38.i1.i1.u316.p968==1)) + EG((i31.u254.p769==0)))) + !(A((i25.u200.p627==0) U AF(((i28.i0.i0.u228.p700=...313
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(E(((i3.u30.p77==0)||(i14.u111.p336==1)) U (i44.u373.p1190==1)) U EX(TRUE)) * !(EG(!(((i13....817
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 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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
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 6
Fast SCC detection found a local SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Detected timeout of ITS tools.
[2026-05-25 11:10:24] [INFO ] Applying decomposition
[2026-05-25 11:10:24] [INFO ] Flatten gal took : 14 ms
[2026-05-25 11:10:24] [INFO ] Decomposing Gal with order
[2026-05-25 11:10:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:10:24] [INFO ] Removed a total of 752 redundant transitions.
[2026-05-25 11:10:24] [INFO ] Flatten gal took : 52 ms
[2026-05-25 11:10:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 270 labels/synchronizations in 5 ms.
[2026-05-25 11:10:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality3273640778232702147.gal : 3 ms
[2026-05-25 11:10:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality17240461588919948016.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/CTLCardinality3273640778232702147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17240461588919948016.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 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.69931e+10,2.82002,92512,199,10823,9638,196895,140,34339,1897,1.25418e+06,0


Converting to forward existential form...Done !
original formula: A(!((AG(((EG((i0.i0.i0.u4.p96==0)) + (i0.u7.p968==1)) + EG((i0.i0.u6.p769==0)))) + !(A((i0.i0.u6.p627==0) U AF(((i0.i0.u6.p700==0)||(i0.i...316
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(E(((i0.i0.i0.u4.p77==0)||(i0.i0.i0.u5.p336==1)) U (i0.u7.p1190==1)) U EX(TRUE)) * !(EG(!((...834
Reverse transition relation is NOT exact ! Due to transitions t918, u8.t39, u8.t46, i0.u7.t37, i0.u7.t84, i0.u7.t104, i0.u7.t119, i0.u7.t129, i0.u7.t186, i...967
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

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="MedleyB-PT-B02"
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 MedleyB-PT-B02, 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-177969020000289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B02.tgz
mv MedleyB-PT-B02 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;