Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700410.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is CO4-PT-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.3K Mar 6 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 6 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 248K 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 CO4-PT-17-CTLFireability-2024-00
FORMULA_NAME CO4-PT-17-CTLFireability-2024-01
FORMULA_NAME CO4-PT-17-CTLFireability-2024-02
FORMULA_NAME CO4-PT-17-CTLFireability-2024-03
FORMULA_NAME CO4-PT-17-CTLFireability-2024-04
FORMULA_NAME CO4-PT-17-CTLFireability-2024-05
FORMULA_NAME CO4-PT-17-CTLFireability-2024-06
FORMULA_NAME CO4-PT-17-CTLFireability-2024-07
FORMULA_NAME CO4-PT-17-CTLFireability-2024-08
FORMULA_NAME CO4-PT-17-CTLFireability-2024-09
FORMULA_NAME CO4-PT-17-CTLFireability-2024-10
FORMULA_NAME CO4-PT-17-CTLFireability-2024-11
FORMULA_NAME CO4-PT-17-CTLFireability-2024-12
FORMULA_NAME CO4-PT-17-CTLFireability-2024-13
FORMULA_NAME CO4-PT-17-CTLFireability-2024-14
FORMULA_NAME CO4-PT-17-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779524407885

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 08:20:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 08:20:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:20:09] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-05-23 08:20:09] [INFO ] Transformed 967 places.
[2026-05-23 08:20:09] [INFO ] Transformed 1150 transitions.
[2026-05-23 08:20:09] [INFO ] Found NUPN structural information;
[2026-05-23 08:20:09] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 198 places in 12 ms
Reduce places removed 198 places and 238 transitions.
FORMULA CO4-PT-17-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 750 transition count 911
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 170 place count 600 transition count 761
Iterating global reduction 1 with 150 rules applied. Total rules applied 320 place count 600 transition count 761
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 327 place count 600 transition count 754
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 396 place count 531 transition count 685
Iterating global reduction 2 with 69 rules applied. Total rules applied 465 place count 531 transition count 685
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 474 place count 522 transition count 676
Iterating global reduction 2 with 9 rules applied. Total rules applied 483 place count 522 transition count 676
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 485 place count 522 transition count 674
Applied a total of 485 rules in 164 ms. Remains 522 /769 variables (removed 247) and now considering 674/912 (removed 238) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3169429498319526919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9680266959742213194.kers'
[2026-05-23 08:20:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3169429498319526919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9680266959742213194.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 674 rows 522 cols 1534 entries
Finished phase 1 with 517 SingleSign rule and 0 generalized
[2026-05-23 08:20:09] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9680266959742213194.kers
Total runtime 5 ms.
[2026-05-23 08:20:09] [INFO ] Implicit Places using invariants in 323 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 354 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 521/769 places, 674/912 transitions.
Applied a total of 0 rules in 16 ms. Remains 521 /521 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 547 ms. Remains : 521/769 places, 674/912 transitions.
Starting structural reductions in LTL mode, iteration 0 : 521/521 places, 674/674 transitions.
Applied a total of 0 rules in 21 ms. Remains 521 /521 variables (removed 0) and now considering 674/674 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9714791266219408475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16054615364146193479.kers'
[2026-05-23 08:20:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9714791266219408475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16054615364146193479.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 674 rows 521 cols 1532 entries
Finished phase 1 with 517 SingleSign rule and 0 generalized
[2026-05-23 08:20:10] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16054615364146193479.kers
Total runtime 4 ms.
[2026-05-23 08:20:10] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-23 08:20:10] [INFO ] Invariant cache hit.
[2026-05-23 08:20:10] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 673 sub problems to find dead transitions.
[2026-05-23 08:20:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/521 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 673 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 674/1195 variables, 521/525 constraints. Problems are: Problem set: 0 solved, 673 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1195/1195 variables, and 525 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 521/521 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 673 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/521 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 3 (OVERLAPS) 674/1195 variables, 521/525 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1195 variables, 673/1198 constraints. Problems are: Problem set: 0 solved, 673 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1195/1195 variables, and 1198 constraints, problems are : Problem set: 0 solved, 673 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 521/521 constraints, PredecessorRefiner: 673/673 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60262ms problems are : Problem set: 0 solved, 673 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Finished structural reductions in LTL mode , in 1 iterations and 60775 ms. Remains : 521/521 places, 674/674 transitions.
Support contains 78 out of 521 places after structural reductions.
[2026-05-23 08:21:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 08:21:11] [INFO ] Flatten gal took : 98 ms
FORMULA CO4-PT-17-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 08:21:11] [INFO ] Flatten gal took : 30 ms
[2026-05-23 08:21:11] [INFO ] Input system was already deterministic with 674 transitions.
Support contains 65 out of 521 places (down from 78) after GAL structural reductions.
FORMULA CO4-PT-17-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (25 resets) in 1234 ms. (32 steps per ms) remains 43/49 properties
BEST_FIRST walk for 4002 steps (19 resets) in 27 ms. (142 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (19 resets) in 36 ms. (108 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (15 resets) in 25 ms. (153 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (14 resets) in 42 ms. (93 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4002 steps (15 resets) in 15 ms. (250 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (19 resets) in 11 ms. (333 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4002 steps (13 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (19 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (12 resets) in 8 ms. (444 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (11 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (18 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (17 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (18 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4002 steps (14 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (15 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (18 resets) in 78 ms. (50 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4002 steps (21 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (17 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (17 resets) in 9 ms. (400 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4001 steps (14 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (21 resets) in 19 ms. (200 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (18 resets) in 8 ms. (444 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4002 steps (10 resets) in 7 ms. (500 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (17 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (18 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (21 resets) in 8 ms. (444 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (18 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
[2026-05-23 08:21:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 165/207 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 495/702 variables, 196/238 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 8/710 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 16/726 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 368/1094 variables, 216/458 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1094 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 85/1179 variables, 56/514 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1179 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 13 (OVERLAPS) 16/1195 variables, 11/525 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1195 variables, 0/525 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 15 (OVERLAPS) 0/1195 variables, 0/525 constraints. Problems are: Problem set: 1 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1195/1195 variables, and 525 constraints, problems are : Problem set: 1 solved, 31 unsolved in 4226 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 521/521 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 161/201 variables, 40/40 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 4/44 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 497/698 variables, 195/239 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 27/266 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 8/706 variables, 1/267 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/706 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 16/722 variables, 3/270 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/722 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 372/1094 variables, 219/489 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1094 variables, 0/489 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 85/1179 variables, 56/545 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1179 variables, 0/545 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 15 (OVERLAPS) 16/1195 variables, 11/556 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1195/1195 variables, and 556 constraints, problems are : Problem set: 1 solved, 31 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 521/521 constraints, PredecessorRefiner: 31/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9256ms problems are : Problem set: 1 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 674/674 transitions.
Graph (trivial) has 487 edges and 521 vertex of which 2 / 521 are part of one of the 1 SCC in 15 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 863 edges and 520 vertex of which 500 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 500 transition count 485
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 158 rules applied. Total rules applied 331 place count 344 transition count 483
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 343 place count 343 transition count 472
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 354 place count 332 transition count 472
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 354 place count 332 transition count 423
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 452 place count 283 transition count 423
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 457 place count 278 transition count 418
Iterating global reduction 4 with 5 rules applied. Total rules applied 462 place count 278 transition count 418
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 464 place count 276 transition count 416
Iterating global reduction 4 with 2 rules applied. Total rules applied 466 place count 276 transition count 416
Performed 72 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 610 place count 204 transition count 330
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 617 place count 204 transition count 323
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 622 place count 199 transition count 318
Iterating global reduction 5 with 5 rules applied. Total rules applied 627 place count 199 transition count 318
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 5 with 2 rules applied. Total rules applied 629 place count 198 transition count 317
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 715 place count 155 transition count 320
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 737 place count 155 transition count 298
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 765 place count 127 transition count 242
Iterating global reduction 6 with 28 rules applied. Total rules applied 793 place count 127 transition count 242
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 811 place count 127 transition count 224
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 813 place count 125 transition count 219
Iterating global reduction 7 with 2 rules applied. Total rules applied 815 place count 125 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 823 place count 125 transition count 211
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 834 place count 125 transition count 200
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 846 place count 114 transition count 199
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 848 place count 114 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 857 place count 114 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 858 place count 114 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 859 place count 113 transition count 195
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 4 rules applied. Total rules applied 863 place count 110 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 864 place count 109 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 868 place count 107 transition count 192
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 869 place count 106 transition count 190
Iterating global reduction 11 with 1 rules applied. Total rules applied 870 place count 106 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 872 place count 105 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 879 place count 105 transition count 183
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 880 place count 104 transition count 182
Iterating global reduction 11 with 1 rules applied. Total rules applied 881 place count 104 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 882 place count 104 transition count 181
Free-agglomeration rule applied 9 times.
Iterating global reduction 12 with 9 rules applied. Total rules applied 891 place count 104 transition count 172
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 11 rules applied. Total rules applied 902 place count 95 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 904 place count 95 transition count 168
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 907 place count 95 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 909 place count 95 transition count 166
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 910 place count 95 transition count 165
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 912 place count 94 transition count 164
Applied a total of 912 rules in 177 ms. Remains 94 /521 variables (removed 427) and now considering 164/674 (removed 510) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 94/521 places, 164/674 transitions.
RANDOM walk for 40000 steps (2328 resets) in 465 ms. (85 steps per ms) remains 3/31 properties
BEST_FIRST walk for 40004 steps (180 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (345 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (356 resets) in 40 ms. (975 steps per ms) remains 2/3 properties
[2026-05-23 08:21:21] [INFO ] Flow matrix only has 157 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2776956618209270824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-987491909906437665.kers'
[2026-05-23 08:21:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2776956618209270824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-987491909906437665.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 94 cols 413 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-23 08:21:21] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-987491909906437665.kers
Total runtime 1 ms.
[2026-05-23 08:21:21] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/61 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 105/166 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 68/234 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/250 variables, 12/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/251 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 95 constraints, problems are : Problem set: 0 solved, 2 unsolved in 167 ms.
Refiners :[State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/61 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 105/166 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 7 (OVERLAPS) 68/234 variables, 36/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/250 variables, 12/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/251 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/251 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 97 constraints, problems are : Problem set: 1 solved, 1 unsolved in 162 ms.
Refiners :[State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 354ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA CO4-PT-17-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 08:21:22] [INFO ] Flatten gal took : 24 ms
[2026-05-23 08:21:22] [INFO ] Flatten gal took : 23 ms
[2026-05-23 08:21:22] [INFO ] Input system was already deterministic with 674 transitions.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 865 edges and 521 vertex of which 513 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 521/521 places, 674/674 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 498 transition count 651
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 498 transition count 651
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 498 transition count 649
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 61 place count 485 transition count 635
Iterating global reduction 1 with 13 rules applied. Total rules applied 74 place count 485 transition count 635
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 482 transition count 631
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 482 transition count 631
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 481 transition count 630
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 481 transition count 630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 480 transition count 629
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 480 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 480 transition count 628
Applied a total of 85 rules in 78 ms. Remains 480 /521 variables (removed 41) and now considering 628/674 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11518327266268581158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1329244408685897742.kers'
[2026-05-23 08:21:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11518327266268581158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1329244408685897742.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 628 rows 480 cols 1432 entries
Finished phase 1 with 476 SingleSign rule and 0 generalized
[2026-05-23 08:21:22] [INFO ] Computed 4 invariants in 6 ms
Computed 4 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1329244408685897742.kers
Total runtime 7 ms.
[2026-05-23 08:21:22] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-23 08:21:22] [INFO ] Invariant cache hit.
[2026-05-23 08:21:22] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 627 sub problems to find dead transitions.
[2026-05-23 08:21:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 3 (OVERLAPS) 628/1108 variables, 480/484 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1108/1108 variables, and 486 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 4 (OVERLAPS) 628/1108 variables, 480/486 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1108 variables, 627/1113 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1108/1108 variables, and 1113 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 480/521 places, 628/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60533 ms. Remains : 480/521 places, 628/674 transitions.
[2026-05-23 08:22:22] [INFO ] Flatten gal took : 19 ms
[2026-05-23 08:22:23] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:22:23] [INFO ] Input system was already deterministic with 628 transitions.
[2026-05-23 08:22:23] [INFO ] Flatten gal took : 16 ms
[2026-05-23 08:22:23] [INFO ] Flatten gal took : 15 ms
[2026-05-23 08:22:23] [INFO ] Time to serialize gal into /tmp/CTLFireability15079253787999489042.gal : 22 ms
[2026-05-23 08:22:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5820105504437071009.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15079253787999489042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5820105504437071009.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,2.28833e+10,1.20606,46584,2,8598,5,157918,6,0,2544,205170,0


Converting to forward existential form...Done !
original formula: EF(EG(E(((p189==1) + ((p922==1) * E((p732==1) U (p893==1)))) U AX((p395!=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),E(((p189==1) + ((p922==1) * E((p732==1) U (p893==1)))) U !(EX(!((p395!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t39, t43, t44, t47, t131, t16...498
(forward)formula 0,1,22.6342,652776,1,0,873,2.84778e+06,1289,554,14155,2.76388e+06,1347
FORMULA CO4-PT-17-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 521/521 places, 674/674 transitions.
Graph (trivial) has 544 edges and 521 vertex of which 2 / 521 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 864 edges and 520 vertex of which 516 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 189 rules applied. Total rules applied 191 place count 515 transition count 479
Reduce places removed 188 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 190 rules applied. Total rules applied 381 place count 327 transition count 477
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 385 place count 326 transition count 474
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 388 place count 323 transition count 474
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 388 place count 323 transition count 418
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 500 place count 267 transition count 418
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 508 place count 259 transition count 409
Iterating global reduction 4 with 8 rules applied. Total rules applied 516 place count 259 transition count 409
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 517 place count 259 transition count 408
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 517 place count 259 transition count 407
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 519 place count 258 transition count 407
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 522 place count 255 transition count 404
Iterating global reduction 5 with 3 rules applied. Total rules applied 525 place count 255 transition count 404
Performed 25 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 575 place count 230 transition count 377
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 579 place count 230 transition count 373
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 581 place count 229 transition count 372
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 587 place count 223 transition count 366
Iterating global reduction 7 with 6 rules applied. Total rules applied 593 place count 223 transition count 366
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 7 with 2 rules applied. Total rules applied 595 place count 222 transition count 365
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 596 place count 221 transition count 364
Iterating global reduction 7 with 1 rules applied. Total rules applied 597 place count 221 transition count 364
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 598 place count 220 transition count 362
Iterating global reduction 7 with 1 rules applied. Total rules applied 599 place count 220 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 600 place count 220 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 616 place count 220 transition count 345
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 8 with 10 rules applied. Total rules applied 626 place count 220 transition count 335
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 636 place count 210 transition count 335
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 636 place count 210 transition count 334
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 638 place count 209 transition count 334
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 640 place count 208 transition count 333
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 649 place count 208 transition count 333
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 651 place count 206 transition count 331
Applied a total of 651 rules in 154 ms. Remains 206 /521 variables (removed 315) and now considering 331/674 (removed 343) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16392597660761496342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17202266601309201444.kers'
[2026-05-23 08:22:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16392597660761496342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17202266601309201444.kers]
Normalized transition count is 330 out of 331 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 330 rows 206 cols 802 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-23 08:22:46] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17202266601309201444.kers
Total runtime 2 ms.
[2026-05-23 08:22:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-23 08:22:46] [INFO ] Invariant cache hit.
[2026-05-23 08:22:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:22:46] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2026-05-23 08:22:46] [INFO ] Redundant transitions in 17 ms returned []
Running 318 sub problems to find dead transitions.
[2026-05-23 08:22:46] [INFO ] Invariant cache hit.
[2026-05-23 08:22:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 330/535 variables, 205/209 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 1/536 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (OVERLAPS) 1/537 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 0/537 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 211 constraints, problems are : Problem set: 0 solved, 318 unsolved in 27842 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (OVERLAPS) 330/535 variables, 205/209 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/535 variables, 244/453 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (OVERLAPS) 1/536 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 74/528 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/537 variables, and 528 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 206/206 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57905ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 57906ms
Starting structural reductions in SI_CTL mode, iteration 1 : 206/521 places, 331/674 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58287 ms. Remains : 206/521 places, 331/674 transitions.
[2026-05-23 08:23:44] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:23:44] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:23:44] [INFO ] Input system was already deterministic with 331 transitions.
[2026-05-23 08:23:44] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:23:44] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:23:44] [INFO ] Time to serialize gal into /tmp/CTLFireability7751121728763412125.gal : 4 ms
[2026-05-23 08:23:44] [INFO ] Time to serialize properties into /tmp/CTLFireability4212571246978135850.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/CTLFireability7751121728763412125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4212571246978135850.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,1.56387e+08,0.211611,11692,2,1325,5,30524,6,0,1142,29769,0


Converting to forward existential form...Done !
original formula: E(A(E(AG((p470==1)) U (p158==1)) U EF(!(A((p813==1) U ((p97==1)&&(p878==1)))))) U (!((AF(((p463!=1)&&((p687==1)||(p575==1)))) + EF((p814=...175
=> equivalent forward existential formula: [FwdG(((FwdU(Init,!((E(!(E(TRUE U !(!((E(!(((p97==1)&&(p878==1))) U (!((p813==1)) * !(((p97==1)&&(p878==1))))) +...586
Reverse transition relation is NOT exact ! Due to transitions t8, t71, t74, t80, t85, t105, t114, t120, t195, t323, t329, Intersection with reachable at e...222
Hit Full ! (commute/partial/dont) 324/0/7
(forward)formula 0,1,12.0593,371460,1,0,635,2.30483e+06,712,341,7887,2.04856e+06,989
FORMULA CO4-PT-17-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 521/521 places, 674/674 transitions.
Graph (trivial) has 566 edges and 521 vertex of which 2 / 521 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 864 edges and 520 vertex of which 512 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 198 rules applied. Total rules applied 200 place count 511 transition count 465
Reduce places removed 197 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 314 transition count 461
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 405 place count 312 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 406 place count 311 transition count 459
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 406 place count 311 transition count 403
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 518 place count 255 transition count 403
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 525 place count 248 transition count 394
Iterating global reduction 4 with 7 rules applied. Total rules applied 532 place count 248 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 534 place count 248 transition count 392
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 534 place count 248 transition count 391
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 536 place count 247 transition count 391
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 539 place count 244 transition count 388
Iterating global reduction 5 with 3 rules applied. Total rules applied 542 place count 244 transition count 388
Performed 27 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 596 place count 217 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 599 place count 217 transition count 355
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 601 place count 216 transition count 354
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 608 place count 209 transition count 347
Iterating global reduction 7 with 7 rules applied. Total rules applied 615 place count 209 transition count 347
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 616 place count 208 transition count 345
Iterating global reduction 7 with 1 rules applied. Total rules applied 617 place count 208 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 618 place count 208 transition count 344
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 620 place count 207 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 633 place count 207 transition count 330
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 8 with 8 rules applied. Total rules applied 641 place count 207 transition count 322
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 649 place count 199 transition count 322
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 10 with 2 rules applied. Total rules applied 651 place count 198 transition count 321
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 653 place count 198 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 654 place count 198 transition count 320
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 656 place count 196 transition count 318
Applied a total of 656 rules in 121 ms. Remains 196 /521 variables (removed 325) and now considering 318/674 (removed 356) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4355782151024365909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15409409319641288974.kers'
[2026-05-23 08:23:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4355782151024365909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15409409319641288974.kers]
Normalized transition count is 317 out of 318 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 196 cols 723 entries
Finished phase 1 with 192 SingleSign rule and 0 generalized
[2026-05-23 08:23:56] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15409409319641288974.kers
Total runtime 1 ms.
[2026-05-23 08:23:56] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-23 08:23:56] [INFO ] Invariant cache hit.
[2026-05-23 08:23:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:23:57] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2026-05-23 08:23:57] [INFO ] Redundant transitions in 4 ms returned []
Running 305 sub problems to find dead transitions.
[2026-05-23 08:23:57] [INFO ] Invariant cache hit.
[2026-05-23 08:23:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 317/513 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 0/514 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 201 constraints, problems are : Problem set: 0 solved, 305 unsolved in 21483 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 317/513 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 305/505 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 506 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51529ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 51530ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/521 places, 318/674 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51995 ms. Remains : 196/521 places, 318/674 transitions.
[2026-05-23 08:24:48] [INFO ] Flatten gal took : 23 ms
[2026-05-23 08:24:48] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:24:48] [INFO ] Input system was already deterministic with 318 transitions.
[2026-05-23 08:24:48] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:24:48] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:24:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8500235708086121326.gal : 2 ms
[2026-05-23 08:24:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5603180346802465545.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/CTLFireability8500235708086121326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5603180346802465545.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,1.06278e+08,0.177474,9960,2,1231,5,25003,6,0,1090,16891,0


Converting to forward existential form...Done !
original formula: EF(AG((p106==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p106==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t42, t68, t71, t78, t83, t105, t113, t119, t167, Intersection with reachable at each ste...215
(forward)formula 0,0,1.55602,58044,1,0,383,273904,657,204,6493,177874,645
FORMULA CO4-PT-17-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 521/521 places, 674/674 transitions.
Graph (trivial) has 559 edges and 521 vertex of which 2 / 521 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 864 edges and 520 vertex of which 512 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 194 rules applied. Total rules applied 196 place count 511 transition count 469
Reduce places removed 193 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 197 rules applied. Total rules applied 393 place count 318 transition count 465
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 397 place count 316 transition count 463
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 401 place count 315 transition count 460
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 404 place count 312 transition count 460
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 56 Pre rules applied. Total rules applied 404 place count 312 transition count 404
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 5 with 112 rules applied. Total rules applied 516 place count 256 transition count 404
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 524 place count 248 transition count 395
Iterating global reduction 5 with 8 rules applied. Total rules applied 532 place count 248 transition count 395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 537 place count 248 transition count 390
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 541 place count 246 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 541 place count 246 transition count 387
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 543 place count 245 transition count 387
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 546 place count 242 transition count 384
Iterating global reduction 7 with 3 rules applied. Total rules applied 549 place count 242 transition count 384
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 599 place count 217 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 602 place count 217 transition count 355
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 604 place count 216 transition count 354
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 610 place count 210 transition count 348
Iterating global reduction 9 with 6 rules applied. Total rules applied 616 place count 210 transition count 348
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 617 place count 209 transition count 346
Iterating global reduction 9 with 1 rules applied. Total rules applied 618 place count 209 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 619 place count 209 transition count 345
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 10 with 2 rules applied. Total rules applied 621 place count 208 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 634 place count 208 transition count 331
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 8 rules applied. Total rules applied 642 place count 208 transition count 323
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 650 place count 200 transition count 323
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 12 with 2 rules applied. Total rules applied 652 place count 199 transition count 322
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 655 place count 199 transition count 322
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 657 place count 197 transition count 320
Applied a total of 657 rules in 98 ms. Remains 197 /521 variables (removed 324) and now considering 320/674 (removed 354) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10650461360796454951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9168629295331182113.kers'
[2026-05-23 08:24:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10650461360796454951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9168629295331182113.kers]
Normalized transition count is 319 out of 320 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 319 rows 197 cols 781 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-23 08:24:50] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9168629295331182113.kers
Total runtime 1 ms.
[2026-05-23 08:24:50] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-23 08:24:50] [INFO ] Invariant cache hit.
[2026-05-23 08:24:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:24:50] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2026-05-23 08:24:50] [INFO ] Redundant transitions in 12 ms returned []
Running 310 sub problems to find dead transitions.
[2026-05-23 08:24:50] [INFO ] Invariant cache hit.
[2026-05-23 08:24:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 319/515 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 1/516 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 1/517 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 0/517 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 202 constraints, problems are : Problem set: 0 solved, 310 unsolved in 27178 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 319/515 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 191/391 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 119/511 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/517 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 512 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57234ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 57235ms
Starting structural reductions in SI_CTL mode, iteration 1 : 197/521 places, 320/674 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57658 ms. Remains : 197/521 places, 320/674 transitions.
[2026-05-23 08:25:47] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:25:47] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:25:47] [INFO ] Input system was already deterministic with 320 transitions.
[2026-05-23 08:25:47] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:25:47] [INFO ] Flatten gal took : 22 ms
[2026-05-23 08:25:47] [INFO ] Time to serialize gal into /tmp/CTLFireability2240030118186021561.gal : 2 ms
[2026-05-23 08:25:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16891364739030161582.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/CTLFireability2240030118186021561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16891364739030161582.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.20932e+08,0.157725,8932,2,1026,5,22507,6,0,1096,12848,0


Converting to forward existential form...Done !
original formula: EG(EF(((p796!=1)||(p955!=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p796!=1)||(p955!=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t37, t63, t66, t73, t78, t101, t110, t115, t165, Intersection with reachable at each ste...215
(forward)formula 0,1,1.5036,54100,1,0,388,252320,664,209,7144,170901,654
FORMULA CO4-PT-17-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 521/521 places, 674/674 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 496 transition count 649
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 496 transition count 649
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 496 transition count 647
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 67 place count 481 transition count 631
Iterating global reduction 1 with 15 rules applied. Total rules applied 82 place count 481 transition count 631
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 476 transition count 624
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 476 transition count 624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 474 transition count 622
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 474 transition count 622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 472 transition count 620
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 472 transition count 620
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 472 transition count 618
Applied a total of 102 rules in 52 ms. Remains 472 /521 variables (removed 49) and now considering 618/674 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1822538581991635245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3079460567387762711.kers'
[2026-05-23 08:25:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1822538581991635245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3079460567387762711.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 618 rows 472 cols 1412 entries
Finished phase 1 with 468 SingleSign rule and 0 generalized
[2026-05-23 08:25:49] [INFO ] Computed 4 invariants in 7 ms
Computed 4 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-3079460567387762711.kers
Total runtime 8 ms.
[2026-05-23 08:25:49] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-23 08:25:49] [INFO ] Invariant cache hit.
[2026-05-23 08:25:49] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2026-05-23 08:25:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1090 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1090 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 617/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1095 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 472/521 places, 618/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60557 ms. Remains : 472/521 places, 618/674 transitions.
[2026-05-23 08:26:50] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:26:50] [INFO ] Flatten gal took : 12 ms
[2026-05-23 08:26:50] [INFO ] Input system was already deterministic with 618 transitions.
[2026-05-23 08:26:50] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:26:50] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:26:50] [INFO ] Time to serialize gal into /tmp/CTLFireability8534900379139360497.gal : 2 ms
[2026-05-23 08:26:50] [INFO ] Time to serialize properties into /tmp/CTLFireability242917080385885638.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/CTLFireability8534900379139360497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability242917080385885638.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 -...282
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.8842e+10,1.22469,45544,2,8597,5,152071,6,0,2502,200796,0


Converting to forward existential form...Done !
original formula: AX(EG((EX((((p954==1)||(p787==1))&&((p733==1)||(p809==1)))) + EF(EG(((p796==1)&&(p955==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((EX((((p954==1)||(p787==1))&&((p733==1)||(p809==1)))) + E(TRUE U EG(((p796==1)&&(p955==1))))))...166
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t157, t183, t...488
Detected timeout of ITS tools.
[2026-05-23 08:27:20] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:27:20] [INFO ] Applying decomposition
[2026-05-23 08:27:20] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2776473682200577642.txt' '-o' '/tmp/graph2776473682200577642.bin' '-w' '/tmp/graph2776473682200577642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2776473682200577642.bin' '-l' '-1' '-v' '-w' '/tmp/graph2776473682200577642.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:27:20] [INFO ] Decomposing Gal with order
[2026-05-23 08:27:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:27:20] [INFO ] Removed a total of 205 redundant transitions.
[2026-05-23 08:27:20] [INFO ] Flatten gal took : 78 ms
[2026-05-23 08:27:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 16 ms.
[2026-05-23 08:27:20] [INFO ] Time to serialize gal into /tmp/CTLFireability10599041168007179604.gal : 9 ms
[2026-05-23 08:27:20] [INFO ] Time to serialize properties into /tmp/CTLFireability17262524924881398192.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/CTLFireability10599041168007179604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17262524924881398192.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.8842e+10,0.357839,17316,732,88,26041,1447,1081,46563,112,6618,0


Converting to forward existential form...Done !
original formula: AX(EG((EX((((i19.u161.p954==1)||(i16.u129.p787==1))&&((i14.u118.p733==1)||(i19.u134.p809==1)))) + EF(EG(((i14.u136.p796==1)&&(i19.u162.p9...167
=> equivalent forward existential formula: [(EY(Init) * !(EG((EX((((i19.u161.p954==1)||(i16.u129.p787==1))&&((i14.u118.p733==1)||(i19.u134.p809==1)))) + E(...220
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t197, t207, t214, t241, t248, t352, t371, t456, t502, t540, i0.t244, i0.t4, i0.u163...739
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 a local 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 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an 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
(forward)formula 0,1,3.37768,117960,1,0,218350,2043,7682,604348,682,7405,334406
FORMULA CO4-PT-17-CTLFireability-2024-06 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 : 521/521 places, 674/674 transitions.
Graph (trivial) has 556 edges and 521 vertex of which 2 / 521 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 864 edges and 520 vertex of which 512 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 188 rules applied. Total rules applied 190 place count 511 transition count 475
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 191 rules applied. Total rules applied 381 place count 324 transition count 471
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 385 place count 322 transition count 469
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 3 with 8 rules applied. Total rules applied 393 place count 321 transition count 462
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 400 place count 314 transition count 462
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 56 Pre rules applied. Total rules applied 400 place count 314 transition count 406
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 5 with 112 rules applied. Total rules applied 512 place count 258 transition count 406
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 522 place count 248 transition count 394
Iterating global reduction 5 with 10 rules applied. Total rules applied 532 place count 248 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 534 place count 248 transition count 392
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 534 place count 248 transition count 391
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 536 place count 247 transition count 391
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 539 place count 244 transition count 388
Iterating global reduction 6 with 3 rules applied. Total rules applied 542 place count 244 transition count 388
Performed 25 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 592 place count 219 transition count 361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 596 place count 219 transition count 357
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 598 place count 218 transition count 356
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 604 place count 212 transition count 350
Iterating global reduction 8 with 6 rules applied. Total rules applied 610 place count 212 transition count 350
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 614 place count 210 transition count 348
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 615 place count 209 transition count 347
Iterating global reduction 8 with 1 rules applied. Total rules applied 616 place count 209 transition count 347
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 617 place count 208 transition count 345
Iterating global reduction 8 with 1 rules applied. Total rules applied 618 place count 208 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 619 place count 208 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 632 place count 208 transition count 331
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 9 with 7 rules applied. Total rules applied 639 place count 208 transition count 324
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 8 rules applied. Total rules applied 647 place count 201 transition count 323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 648 place count 200 transition count 323
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 12 with 2 rules applied. Total rules applied 650 place count 199 transition count 322
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 652 place count 197 transition count 320
Applied a total of 652 rules in 59 ms. Remains 197 /521 variables (removed 324) and now considering 320/674 (removed 354) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2046577791460809061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18202404841336749370.kers'
[2026-05-23 08:27:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2046577791460809061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18202404841336749370.kers]
Normalized transition count is 319 out of 320 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 319 rows 197 cols 727 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-23 08:27:24] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18202404841336749370.kers
Total runtime 2 ms.
[2026-05-23 08:27:24] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-23 08:27:24] [INFO ] Invariant cache hit.
[2026-05-23 08:27:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:27:24] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2026-05-23 08:27:24] [INFO ] Redundant transitions in 1 ms returned []
Running 307 sub problems to find dead transitions.
[2026-05-23 08:27:24] [INFO ] Invariant cache hit.
[2026-05-23 08:27:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 319/515 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 1/516 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 1/517 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 0/517 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 202 constraints, problems are : Problem set: 0 solved, 307 unsolved in 27037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 319/515 variables, 196/200 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 263/463 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 1/516 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 44/508 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/517 variables, and 508 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57080ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 57081ms
Starting structural reductions in SI_CTL mode, iteration 1 : 197/521 places, 320/674 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57364 ms. Remains : 197/521 places, 320/674 transitions.
[2026-05-23 08:28:21] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:28:21] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:28:21] [INFO ] Input system was already deterministic with 320 transitions.
[2026-05-23 08:28:21] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:28:21] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:28:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14394599952868299611.gal : 3 ms
[2026-05-23 08:28:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15959803641118728248.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/CTLFireability14394599952868299611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15959803641118728248.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,1.07775e+08,0.149361,10164,2,1280,5,25263,6,0,1096,22113,0


Converting to forward existential form...Done !
original formula: AG(!(E(AG((p579==1)) U ((p201==1)&&(p878==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),!(E(TRUE U !((p579==1))))) * ((p201==1)&&(p878==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t43, t65, t68, t75, t80, t104, t113, t118, t170, Intersection with reachable at each ste...215
(forward)formula 0,0,1.5465,59496,1,0,385,302901,666,206,6487,187679,653
FORMULA CO4-PT-17-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 521/521 places, 674/674 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 496 transition count 649
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 496 transition count 649
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 496 transition count 647
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 483 transition count 633
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 483 transition count 633
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 478 transition count 626
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 478 transition count 626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 476 transition count 624
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 476 transition count 624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 474 transition count 622
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 474 transition count 622
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 98 place count 474 transition count 620
Applied a total of 98 rules in 48 ms. Remains 474 /521 variables (removed 47) and now considering 620/674 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11434982501621888149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3618737488758587877.kers'
[2026-05-23 08:28:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11434982501621888149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3618737488758587877.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 620 rows 474 cols 1418 entries
Finished phase 1 with 470 SingleSign rule and 0 generalized
[2026-05-23 08:28:23] [INFO ] Computed 4 invariants in 7 ms
Computed 4 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3618737488758587877.kers
Total runtime 8 ms.
[2026-05-23 08:28:23] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-23 08:28:23] [INFO ] Invariant cache hit.
[2026-05-23 08:28:23] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2026-05-23 08:28:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (OVERLAPS) 620/1094 variables, 474/478 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1094 variables, and 480 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (OVERLAPS) 620/1094 variables, 474/480 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1094 variables, 619/1099 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1094 variables, and 1099 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 474/521 places, 620/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60563 ms. Remains : 474/521 places, 620/674 transitions.
[2026-05-23 08:29:23] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:29:23] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:29:23] [INFO ] Input system was already deterministic with 620 transitions.
[2026-05-23 08:29:23] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:29:23] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:29:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9933407019101269940.gal : 2 ms
[2026-05-23 08:29:23] [INFO ] Time to serialize properties into /tmp/CTLFireability7621431948898254125.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/CTLFireability9933407019101269940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7621431948898254125.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,1.91462e+10,1.40993,48808,2,8794,5,160099,6,0,2512,221406,0


Converting to forward existential form...Done !
original formula: E((E((((p388==1) + AF((p850==1))) + !(EG((p738==1)))) U AF(EX(((p102==1)&&(p878==1))))) * AF(!(EF(EX((p270==1)))))) U EF((p841==1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(E((((p388==1) + !(EG(!((p850==1))))) + !(EG((p738==1)))) U !(EG(!(EX(((p102==1)&&(p878==1)))))...227
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...482
Detected timeout of ITS tools.
[2026-05-23 08:29:53] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:29:53] [INFO ] Applying decomposition
[2026-05-23 08:29:53] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18175086548205532283.txt' '-o' '/tmp/graph18175086548205532283.bin' '-w' '/tmp/graph18175086548205532283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18175086548205532283.bin' '-l' '-1' '-v' '-w' '/tmp/graph18175086548205532283.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:29:53] [INFO ] Decomposing Gal with order
[2026-05-23 08:29:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:29:53] [INFO ] Removed a total of 200 redundant transitions.
[2026-05-23 08:29:53] [INFO ] Flatten gal took : 20 ms
[2026-05-23 08:29:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 4 ms.
[2026-05-23 08:29:53] [INFO ] Time to serialize gal into /tmp/CTLFireability996929998428027806.gal : 5 ms
[2026-05-23 08:29:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12390243258552673080.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/CTLFireability996929998428027806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12390243258552673080.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.91462e+10,0.195053,12036,613,81,14369,1359,954,25665,102,5332,0


Converting to forward existential form...Done !
original formula: E((E((((i5.u44.p388==1) + AF((i15.u136.p850==1))) + !(EG((i14.u109.p738==1)))) U AF(EX(((i1.u7.p102==1)&&(i9.u143.p878==1))))) * AF(!(EF(...205
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(E((((i5.u44.p388==1) + !(EG(!((i15.u136.p850==1))))) + !(EG((i14.u109.p738==1)))) U !(EG(!(EX(...282
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t156, t204, t247, t351, t370, t481, t502, t540, i1.t475, i1.u7.t506, i1.u12.t477, i...750
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Using 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 521/521 places, 674/674 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 496 transition count 649
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 496 transition count 649
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 496 transition count 647
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 66 place count 482 transition count 632
Iterating global reduction 1 with 14 rules applied. Total rules applied 80 place count 482 transition count 632
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 477 transition count 625
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 477 transition count 625
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 475 transition count 623
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 475 transition count 623
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 473 transition count 621
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 473 transition count 621
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 100 place count 473 transition count 619
Applied a total of 100 rules in 60 ms. Remains 473 /521 variables (removed 48) and now considering 619/674 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8729173206061512549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-866462305388820619.kers'
[2026-05-23 08:30:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8729173206061512549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-866462305388820619.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 619 rows 473 cols 1416 entries
Finished phase 1 with 469 SingleSign rule and 0 generalized
[2026-05-23 08:30:23] [INFO ] Computed 4 invariants in 4 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-866462305388820619.kers
Total runtime 5 ms.
[2026-05-23 08:30:24] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-23 08:30:24] [INFO ] Invariant cache hit.
[2026-05-23 08:30:24] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2026-05-23 08:30:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1092 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 479 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1092 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 618/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1097 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 473/521 places, 619/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60539 ms. Remains : 473/521 places, 619/674 transitions.
[2026-05-23 08:31:24] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:31:24] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:31:24] [INFO ] Input system was already deterministic with 619 transitions.
[2026-05-23 08:31:24] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:31:24] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:31:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5196230380439829922.gal : 2 ms
[2026-05-23 08:31:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13496785332413641369.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/CTLFireability5196230380439829922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13496785332413641369.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.90404e+10,1.39965,46448,2,8708,5,155165,6,0,2507,205511,0


Converting to forward existential form...Done !
original formula: AF(((AG((((p379==1)&&(p878==1))&&(p134==1))) * EX((p629==0))) * AF((p498==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((((p379==1)&&(p878==1))&&(p134==1))))) * EX((p629==0))) * !(EG(!((p498==1)))))))] = ...160
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...482
Detected timeout of ITS tools.
[2026-05-23 08:31:54] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:31:54] [INFO ] Applying decomposition
[2026-05-23 08:31:54] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9870822753293620985.txt' '-o' '/tmp/graph9870822753293620985.bin' '-w' '/tmp/graph9870822753293620985.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9870822753293620985.bin' '-l' '-1' '-v' '-w' '/tmp/graph9870822753293620985.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:31:54] [INFO ] Decomposing Gal with order
[2026-05-23 08:31:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:31:54] [INFO ] Removed a total of 208 redundant transitions.
[2026-05-23 08:31:54] [INFO ] Flatten gal took : 34 ms
[2026-05-23 08:31:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 16 ms.
[2026-05-23 08:31:54] [INFO ] Time to serialize gal into /tmp/CTLFireability4154024896044825085.gal : 4 ms
[2026-05-23 08:31:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16866972897280405558.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/CTLFireability4154024896044825085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16866972897280405558.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,1.90404e+10,0.221916,11680,671,87,13697,1231,1000,23833,100,4321,0


Converting to forward existential form...Done !
original formula: AF(((AG((((i4.u45.p379==1)&&(i9.u104.p878==1))&&(i3.u12.p134==1))) * EX((i10.u92.p629==0))) * AF((i8.u62.p498==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((((i4.u45.p379==1)&&(i9.u104.p878==1))&&(i3.u12.p134==1))))) * EX((i10.u92.p629==0))...197
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t196, t206, t247, t351, t370, t449, t455, t502, t540, i0.t499, i0.u7.t506, i2.t442,...746
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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 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
(forward)formula 0,0,21.015,545724,1,0,806719,3924,8254,3.3088e+06,590,18510,579068
FORMULA CO4-PT-17-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 521/521 places, 674/674 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 497 transition count 650
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 497 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 497 transition count 648
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 64 place count 483 transition count 633
Iterating global reduction 1 with 14 rules applied. Total rules applied 78 place count 483 transition count 633
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 479 transition count 627
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 479 transition count 627
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 477 transition count 625
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 477 transition count 625
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 475 transition count 623
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 475 transition count 623
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 475 transition count 621
Applied a total of 96 rules in 41 ms. Remains 475 /521 variables (removed 46) and now considering 621/674 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4811706648211509146.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14029568903172275726.kers'
[2026-05-23 08:32:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4811706648211509146.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14029568903172275726.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 621 rows 475 cols 1420 entries
Finished phase 1 with 471 SingleSign rule and 0 generalized
[2026-05-23 08:32:15] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14029568903172275726.kers
Total runtime 3 ms.
[2026-05-23 08:32:15] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 08:32:15] [INFO ] Invariant cache hit.
[2026-05-23 08:32:16] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2026-05-23 08:32:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 621/1096 variables, 475/479 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 482 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (OVERLAPS) 621/1096 variables, 475/482 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1096 variables, 620/1102 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 1102 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 475/521 places, 621/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60480 ms. Remains : 475/521 places, 621/674 transitions.
[2026-05-23 08:33:16] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:33:16] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:33:16] [INFO ] Input system was already deterministic with 621 transitions.
[2026-05-23 08:33:16] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:33:16] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:33:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9618783281226213155.gal : 2 ms
[2026-05-23 08:33:16] [INFO ] Time to serialize properties into /tmp/CTLFireability16791449280198143111.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/CTLFireability9618783281226213155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16791449280198143111.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.95092e+10,1.41936,48396,2,8855,5,160333,6,0,2517,218337,0


Converting to forward existential form...Done !
original formula: AX(E(EX(((EX((p214==1)) + !(((p285==1)||(p176==1)))) + ((p885==1)&&(p950==1)))) U (p791==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(EX(((EX((p214==1)) + !(((p285==1)||(p176==1)))) + ((p885==1)&&(p950==1)))) U (p791==1))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t18...498
Detected timeout of ITS tools.
[2026-05-23 08:33:46] [INFO ] Flatten gal took : 13 ms
[2026-05-23 08:33:46] [INFO ] Applying decomposition
[2026-05-23 08:33:46] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4130482442740217546.txt' '-o' '/tmp/graph4130482442740217546.bin' '-w' '/tmp/graph4130482442740217546.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4130482442740217546.bin' '-l' '-1' '-v' '-w' '/tmp/graph4130482442740217546.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:33:46] [INFO ] Decomposing Gal with order
[2026-05-23 08:33:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:33:46] [INFO ] Removed a total of 204 redundant transitions.
[2026-05-23 08:33:46] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:33:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 5 ms.
[2026-05-23 08:33:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16097947133681998739.gal : 4 ms
[2026-05-23 08:33:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11667145479888853470.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/CTLFireability16097947133681998739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11667145479888853470.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.95092e+10,0.216592,12044,693,107,14197,1177,1031,26182,111,4535,0


Converting to forward existential form...Done !
original formula: AX(E(EX(((EX((i3.u27.p214==1)) + !(((i4.u46.p285==1)||(i1.i0.i2.u18.p176==1)))) + ((i10.u155.p885==1)&&(i17.u160.p950==1)))) U (i13.u133....165
=> equivalent forward existential formula: [(EY(Init) * !(E(EX(((EX((i3.u27.p214==1)) + !(((i4.u46.p285==1)||(i1.i0.i2.u18.p176==1)))) + ((i10.u155.p885==1...212
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t64, t196, t247, t540, t541, i0.t502, i0.t499, i0.u6.t506, i0.u12.t478, i0.u13.t476...840
(forward)formula 0,1,1.96526,72424,1,0,114017,2209,5744,433946,534,9300,194076
FORMULA CO4-PT-17-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 521/521 places, 674/674 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 503 transition count 656
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 503 transition count 656
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 503 transition count 654
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 493 transition count 643
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 493 transition count 643
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 489 transition count 638
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 489 transition count 638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 488 transition count 637
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 488 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 487 transition count 636
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 487 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 487 transition count 635
Applied a total of 71 rules in 47 ms. Remains 487 /521 variables (removed 34) and now considering 635/674 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6620913126433119058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2561311455805802875.kers'
[2026-05-23 08:33:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6620913126433119058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2561311455805802875.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 635 rows 487 cols 1448 entries
Finished phase 1 with 483 SingleSign rule and 0 generalized
[2026-05-23 08:33:48] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2561311455805802875.kers
Total runtime 4 ms.
[2026-05-23 08:33:48] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 08:33:48] [INFO ] Invariant cache hit.
[2026-05-23 08:33:48] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 634 sub problems to find dead transitions.
[2026-05-23 08:33:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (OVERLAPS) 635/1122 variables, 487/491 constraints. Problems are: Problem set: 0 solved, 634 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1122/1122 variables, and 493 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (OVERLAPS) 635/1122 variables, 487/493 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1122 variables, 634/1127 constraints. Problems are: Problem set: 0 solved, 634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1122/1122 variables, and 1127 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 634 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 487/521 places, 635/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60505 ms. Remains : 487/521 places, 635/674 transitions.
[2026-05-23 08:34:49] [INFO ] Flatten gal took : 13 ms
[2026-05-23 08:34:49] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:34:49] [INFO ] Input system was already deterministic with 635 transitions.
[2026-05-23 08:34:49] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:34:49] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:34:49] [INFO ] Time to serialize gal into /tmp/CTLFireability8349490956505973808.gal : 2 ms
[2026-05-23 08:34:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14757757316819070672.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/CTLFireability8349490956505973808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14757757316819070672.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,2.48104e+10,1.33752,46888,2,9094,5,153926,6,0,2579,207673,0


Converting to forward existential form...Done !
original formula: A(E(A(EG(((p91==1)&&(p878==1))) U ((p626==1)&&(p955==1))) U ((AF((p919==1)) + AF((p483==1))) + EX(EX((p727==1))))) U A(((p660==1) + ((E((...266
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((E((p957==1) U !(((p906==1)||(p758==1)))) * !(EG(!(!(EX(!(FALSE)))))))) U (!(((p660==1) ...1231
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t34, t38, t39, t43, t46, t48, t132, t16...516
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-23 08:35:19] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:35:19] [INFO ] Applying decomposition
[2026-05-23 08:35:19] [INFO ] Flatten gal took : 6 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/graph1972193761419830569.txt' '-o' '/tmp/graph1972193761419830569.bin' '-w' '/tmp/graph1972193761419830569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1972193761419830569.bin' '-l' '-1' '-v' '-w' '/tmp/graph1972193761419830569.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:35:19] [INFO ] Decomposing Gal with order
[2026-05-23 08:35:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:35:19] [INFO ] Removed a total of 210 redundant transitions.
[2026-05-23 08:35:19] [INFO ] Flatten gal took : 22 ms
[2026-05-23 08:35:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 10 ms.
[2026-05-23 08:35:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14136801909165608366.gal : 4 ms
[2026-05-23 08:35:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17788803189475195088.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/CTLFireability14136801909165608366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17788803189475195088.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.48104e+10,0.370941,18872,754,77,26542,1572,1042,66173,100,6868,0


Converting to forward existential form...Done !
original formula: A(E(A(EG(((i1.u5.p91==1)&&(i9.u152.p878==1))) U ((i8.u93.p626==1)&&(i15.u160.p955==1))) U ((AF((i15.u159.p919==1)) + AF((i6.i0.i1.u63.p48...389
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((E((i0.u0.p957==1) U !(((i15.u156.p906==1)||(i10.u124.p758==1)))) * !(EG(!(!(EX(!(FALSE)...1656
Reverse transition relation is NOT exact ! Due to transitions t18, t48, t205, t215, t222, t227, t238, t256, t362, t513, t551, i0.t252, i0.t4, i0.u165.t8, i...831
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 a local 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 an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using 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 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 an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 521/521 places, 674/674 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 496 transition count 649
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 496 transition count 649
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 496 transition count 647
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 66 place count 482 transition count 632
Iterating global reduction 1 with 14 rules applied. Total rules applied 80 place count 482 transition count 632
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 477 transition count 625
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 477 transition count 625
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 475 transition count 623
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 475 transition count 623
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 473 transition count 621
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 473 transition count 621
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 100 place count 473 transition count 619
Applied a total of 100 rules in 46 ms. Remains 473 /521 variables (removed 48) and now considering 619/674 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12460889422771535187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14831311848944764367.kers'
[2026-05-23 08:35:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12460889422771535187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14831311848944764367.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 619 rows 473 cols 1414 entries
Finished phase 1 with 469 SingleSign rule and 0 generalized
[2026-05-23 08:35:49] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14831311848944764367.kers
Total runtime 2 ms.
[2026-05-23 08:35:49] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-23 08:35:49] [INFO ] Invariant cache hit.
[2026-05-23 08:35:49] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2026-05-23 08:35:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1092 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 479 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1092 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 618/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1097 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 473/521 places, 619/674 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60536 ms. Remains : 473/521 places, 619/674 transitions.
[2026-05-23 08:36:49] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:36:49] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:36:49] [INFO ] Input system was already deterministic with 619 transitions.
[2026-05-23 08:36:49] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:36:49] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:36:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6118271502733142702.gal : 7 ms
[2026-05-23 08:36:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14587228751793496893.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/CTLFireability6118271502733142702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14587228751793496893.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.89461e+10,1.35034,47152,2,8643,5,155444,6,0,2507,209827,0


Converting to forward existential form...Done !
original formula: AX(AF(EG((AF((p809==0)) * ((p834==0)||(p429==0))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG((!(EG(!((p809==0)))) * ((p834==0)||(p429==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t126, t157, t183, t...488
Detected timeout of ITS tools.
[2026-05-23 08:37:20] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:37:20] [INFO ] Applying decomposition
[2026-05-23 08:37:20] [INFO ] Flatten gal took : 6 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/graph3688750404334887944.txt' '-o' '/tmp/graph3688750404334887944.bin' '-w' '/tmp/graph3688750404334887944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3688750404334887944.bin' '-l' '-1' '-v' '-w' '/tmp/graph3688750404334887944.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:37:20] [INFO ] Decomposing Gal with order
[2026-05-23 08:37:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:37:20] [INFO ] Removed a total of 219 redundant transitions.
[2026-05-23 08:37:20] [INFO ] Flatten gal took : 22 ms
[2026-05-23 08:37:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2026-05-23 08:37:20] [INFO ] Time to serialize gal into /tmp/CTLFireability836118117807326560.gal : 4 ms
[2026-05-23 08:37:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15099444957761355394.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/CTLFireability836118117807326560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15099444957761355394.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.89461e+10,0.23594,13652,696,87,17690,1353,1152,32150,95,5038,0


Converting to forward existential form...Done !
original formula: AX(AF(EG((AF((i15.u141.p809==0)) * ((i14.i0.i1.u149.p834==0)||(i6.u50.p429==0))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG((!(EG(!((i15.u141.p809==0)))) * ((i14.i0.i1.u149.p834==0)||(i6.u50.p429==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t197, t207, t248, t352, t502, t540, i0.t244, i1.t499, i1.u7.t506, i2.t476, i2.u13.t...802
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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 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
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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 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
(forward)formula 0,1,25.3061,692432,1,0,976907,3474,7109,4.62483e+06,515,17243,618322
FORMULA CO4-PT-17-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2026-05-23 08:37:45] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:37:45] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:37:45] [INFO ] Applying decomposition
[2026-05-23 08:37:45] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph430758664430613960.txt' '-o' '/tmp/graph430758664430613960.bin' '-w' '/tmp/graph430758664430613960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph430758664430613960.bin' '-l' '-1' '-v' '-w' '/tmp/graph430758664430613960.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:37:45] [INFO ] Decomposing Gal with order
[2026-05-23 08:37:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:37:45] [INFO ] Removed a total of 222 redundant transitions.
[2026-05-23 08:37:45] [INFO ] Flatten gal took : 46 ms
[2026-05-23 08:37:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 7 ms.
[2026-05-23 08:37:45] [INFO ] Time to serialize gal into /tmp/CTLFireability2365495248171782587.gal : 7 ms
[2026-05-23 08:37:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3330507475321847178.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/CTLFireability2365495248171782587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3330507475321847178.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 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.67836e+10,0.239787,13324,710,83,17436,1257,1082,28439,106,4998,0


Converting to forward existential form...Done !
original formula: E((E((((i8.u58.p388==1) + AF((i16.u164.p850==1))) + !(EG((i12.u136.p738==1)))) U AF(EX(((i4.i0.i0.u7.p102==1)&&(i10.u172.p878==1))))) * A...218
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(E((((i8.u58.p388==1) + !(EG(!((i16.u164.p850==1))))) + !(EG((i12.u136.p738==1)))) U !(EG(!(EX(...295
Reverse transition relation is NOT exact ! Due to transitions t59, t72, t221, t272, t519, t540, t578, t579, i1.u20.t504, i1.u18.t478, i2.t491, i2.t489, i2....893
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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 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
(forward)formula 0,1,55.7922,1584344,1,0,2.58261e+06,4408,9433,6.13574e+06,623,20750,2178022
FORMULA CO4-PT-17-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(E(A(EG(((i0.u4.p91==1)&&(i10.u172.p878==1))) U ((i9.u106.p626==1)&&(i17.u187.p955==1))) U ((AF((i17.u181.p919==1)) + AF((i7.u77.p483==1...388
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((E((i18.u1.p957==1) U !(((i17.u180.p906==1)||(i14.u142.p758==1)))) * !(EG(!(!(EX(!(FALSE...1667
Fast SCC detection found an 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
Using 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 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
(forward)formula 1,0,73.8174,2014964,1,0,3.29938e+06,4562,9644,7.35662e+06,624,21749,2861901
FORMULA CO4-PT-17-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1130695 ms.

BK_STOP 1779525539991

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-17"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is CO4-PT-17, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tall-177946967700410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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