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.r082-smll-177946993600202.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 DBSingleClientW-PT-d2m05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DBSingleClientW-PT-d2m05-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-12
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-13
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-14
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779599538885

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 05:12:21] [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-24 05:12:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:12:21] [INFO ] Load time of PNML (sax parser for PT used): 422 ms
[2026-05-24 05:12:21] [INFO ] Transformed 4763 places.
[2026-05-24 05:12:21] [INFO ] Transformed 2478 transitions.
[2026-05-24 05:12:21] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 603 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Deduced a syphon composed of 3580 places in 24 ms
Reduce places removed 3580 places and 0 transitions.
Support contains 82 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 350 places :
Symmetric choice reduction at 1 with 350 rule applications. Total rules 595 place count 787 transition count 1652
Iterating global reduction 1 with 350 rules applied. Total rules applied 945 place count 787 transition count 1652
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 1057 place count 787 transition count 1540
Discarding 281 places :
Symmetric choice reduction at 2 with 281 rule applications. Total rules 1338 place count 506 transition count 1259
Iterating global reduction 2 with 281 rules applied. Total rules applied 1619 place count 506 transition count 1259
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1626 place count 506 transition count 1252
Discarding 191 places :
Symmetric choice reduction at 3 with 191 rule applications. Total rules 1817 place count 315 transition count 1001
Iterating global reduction 3 with 191 rules applied. Total rules applied 2008 place count 315 transition count 1001
Ensure Unique test removed 249 transitions
Reduce isomorphic transitions removed 249 transitions.
Iterating post reduction 3 with 249 rules applied. Total rules applied 2257 place count 315 transition count 752
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 2267 place count 305 transition count 737
Iterating global reduction 4 with 10 rules applied. Total rules applied 2277 place count 305 transition count 737
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 2319 place count 305 transition count 695
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 2324 place count 300 transition count 690
Iterating global reduction 5 with 5 rules applied. Total rules applied 2329 place count 300 transition count 690
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 2334 place count 295 transition count 685
Iterating global reduction 5 with 5 rules applied. Total rules applied 2339 place count 295 transition count 685
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2343 place count 295 transition count 681
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2345 place count 293 transition count 677
Iterating global reduction 6 with 2 rules applied. Total rules applied 2347 place count 293 transition count 677
Applied a total of 2347 rules in 334 ms. Remains 293 /1183 variables (removed 890) and now considering 677/2478 (removed 1801) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-656206141551750406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-165406172111277548.kers'
[2026-05-24 05:12:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-656206141551750406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-165406172111277548.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 677 rows 293 cols 1910 entries
Finished phase 1 with 289 SingleSign rule and 2 generalized
[2026-05-24 05:12:22] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-165406172111277548.kers
Total runtime 5 ms.
[2026-05-24 05:12:22] [INFO ] Implicit Places using invariants in 760 ms returned []
[2026-05-24 05:12:23] [INFO ] Invariant cache hit.
[2026-05-24 05:12:23] [INFO ] State equation strengthened by 381 read => feed constraints.
[2026-05-24 05:12:26] [INFO ] Implicit Places using invariants and state equation in 3798 ms returned []
Implicit Place search using SMT with State Equation took 4609 ms to find 0 implicit places.
Running 676 sub problems to find dead transitions.
[2026-05-24 05:12:26] [INFO ] Invariant cache hit.
[2026-05-24 05:12:26] [INFO ] State equation strengthened by 381 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 676 unsolved
SMT process timed out in 31816ms, After SMT, problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 31845ms
Starting structural reductions in LTL mode, iteration 1 : 293/1183 places, 677/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36844 ms. Remains : 293/1183 places, 677/2478 transitions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Applied a total of 0 rules in 7 ms. Remains 293 /293 variables (removed 0) and now considering 677/677 (removed 0) transitions.
[2026-05-24 05:12:58] [INFO ] Invariant cache hit.
[2026-05-24 05:12:59] [INFO ] Implicit Places using invariants in 476 ms returned []
[2026-05-24 05:12:59] [INFO ] Invariant cache hit.
[2026-05-24 05:12:59] [INFO ] State equation strengthened by 381 read => feed constraints.
[2026-05-24 05:13:01] [INFO ] Implicit Places using invariants and state equation in 2502 ms returned []
Implicit Place search using SMT with State Equation took 2983 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2990 ms. Remains : 293/293 places, 677/677 transitions.
Support contains 82 out of 293 places after structural reductions.
[2026-05-24 05:13:02] [INFO ] Flatten gal took : 109 ms
[2026-05-24 05:13:02] [INFO ] Flatten gal took : 68 ms
[2026-05-24 05:13:02] [INFO ] Input system was already deterministic with 677 transitions.
Support contains 77 out of 293 places (down from 82) after GAL structural reductions.
RANDOM walk for 40000 steps (9167 resets) in 5902 ms. (6 steps per ms) remains 55/58 properties
BEST_FIRST walk for 4003 steps (377 resets) in 86 ms. (46 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (380 resets) in 77 ms. (51 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (370 resets) in 73 ms. (54 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (173 resets) in 76 ms. (52 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (401 resets) in 102 ms. (38 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (178 resets) in 63 ms. (62 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (375 resets) in 50 ms. (78 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (172 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (192 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (183 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (181 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (347 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (186 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (170 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (177 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (171 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (189 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (361 resets) in 43 ms. (90 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (608 resets) in 82 ms. (48 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (215 resets) in 48 ms. (81 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (385 resets) in 58 ms. (67 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (390 resets) in 49 ms. (80 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (176 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (184 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (369 resets) in 79 ms. (50 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (177 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (391 resets) in 43 ms. (90 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (149 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (166 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (188 resets) in 39 ms. (100 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (158 resets) in 35 ms. (111 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (162 resets) in 35 ms. (111 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (184 resets) in 49 ms. (80 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (191 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (177 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (192 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (169 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (382 resets) in 46 ms. (85 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (189 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (173 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (178 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (205 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (193 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (75 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (182 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (186 resets) in 42 ms. (93 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (179 resets) in 35 ms. (111 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (171 resets) in 35 ms. (111 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (385 resets) in 58 ms. (67 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (153 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
Interrupted probabilistic random walk after 565377 steps, run timeout after 6001 ms. (steps per millisecond=94 ) properties seen :47 out of 55
Probabilistic random walk after 565377 steps, saw 214333 distinct states, run finished after 6011 ms. (steps per millisecond=94 ) properties seen :47
[2026-05-24 05:13:10] [INFO ] Invariant cache hit.
[2026-05-24 05:13:10] [INFO ] State equation strengthened by 381 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 105/125 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 68/193 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 393/586 variables, 193/195 constraints. Problems are: Problem set: 3 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 97/292 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 0/292 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 8 (OVERLAPS) 374/960 variables, 95/387 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/960 variables, 279/666 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/960 variables, 0/666 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/970 variables, 5/671 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/970 variables, 5/676 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/970 variables, 0/676 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/970 variables, 0/676 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 970/970 variables, and 676 constraints, problems are : Problem set: 6 solved, 2 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 293/293 constraints, ReadFeed: 381/381 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/114 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 69/183 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 347/530 variables, 183/185 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 51/236 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/236 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 428/958 variables, 104/340 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/958 variables, 324/664 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/958 variables, 2/666 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/958 variables, 0/666 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/970 variables, 6/672 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/970 variables, 6/678 constraints. Problems are: Problem set: 6 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 970/970 variables, and 678 constraints, problems are : Problem set: 6 solved, 2 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 293/293 constraints, ReadFeed: 381/381 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6424ms problems are : Problem set: 6 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 677/677 transitions.
Graph (complete) has 1175 edges and 293 vertex of which 292 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 292 transition count 670
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 65 place count 235 transition count 434
Iterating global reduction 1 with 57 rules applied. Total rules applied 122 place count 235 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 136 place count 235 transition count 420
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 176 place count 195 transition count 366
Iterating global reduction 2 with 40 rules applied. Total rules applied 216 place count 195 transition count 366
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 229 place count 195 transition count 353
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 256 place count 168 transition count 310
Iterating global reduction 3 with 27 rules applied. Total rules applied 283 place count 168 transition count 310
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 298 place count 168 transition count 295
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 309 place count 157 transition count 273
Iterating global reduction 4 with 11 rules applied. Total rules applied 320 place count 157 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 325 place count 157 transition count 268
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 332 place count 150 transition count 261
Iterating global reduction 5 with 7 rules applied. Total rules applied 339 place count 150 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 342 place count 150 transition count 258
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 350 place count 142 transition count 233
Iterating global reduction 6 with 8 rules applied. Total rules applied 358 place count 142 transition count 233
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 363 place count 142 transition count 228
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 365 place count 140 transition count 215
Iterating global reduction 7 with 2 rules applied. Total rules applied 367 place count 140 transition count 215
Applied a total of 367 rules in 99 ms. Remains 140 /293 variables (removed 153) and now considering 215/677 (removed 462) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 140/293 places, 215/677 transitions.
RANDOM walk for 40000 steps (9162 resets) in 352 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1839 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1814 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 99640 steps, run visited all 2 properties in 396 ms. (steps per millisecond=251 )
Probabilistic random walk after 99640 steps, saw 41900 distinct states, run finished after 402 ms. (steps per millisecond=247 ) properties seen :2
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2026-05-24 05:13:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 05:13:17] [INFO ] Flatten gal took : 46 ms
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 05:13:17] [INFO ] Flatten gal took : 45 ms
[2026-05-24 05:13:18] [INFO ] Input system was already deterministic with 677 transitions.
Support contains 67 out of 293 places (down from 68) after GAL structural reductions.
Computed a total of 5 stabilizing places and 39 stable transitions
Graph (complete) has 1266 edges and 293 vertex of which 292 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 233 transition count 420
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 233 transition count 420
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 134 place count 233 transition count 406
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 176 place count 191 transition count 351
Iterating global reduction 1 with 42 rules applied. Total rules applied 218 place count 191 transition count 351
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 232 place count 191 transition count 337
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 263 place count 160 transition count 288
Iterating global reduction 2 with 31 rules applied. Total rules applied 294 place count 160 transition count 288
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 312 place count 160 transition count 270
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 323 place count 149 transition count 245
Iterating global reduction 3 with 11 rules applied. Total rules applied 334 place count 149 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 338 place count 149 transition count 241
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 345 place count 142 transition count 234
Iterating global reduction 4 with 7 rules applied. Total rules applied 352 place count 142 transition count 234
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 358 place count 136 transition count 228
Iterating global reduction 4 with 6 rules applied. Total rules applied 364 place count 136 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 370 place count 136 transition count 222
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 373 place count 133 transition count 202
Iterating global reduction 5 with 3 rules applied. Total rules applied 376 place count 133 transition count 202
Applied a total of 376 rules in 27 ms. Remains 133 /293 variables (removed 160) and now considering 202/677 (removed 475) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17588570681349015651.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17237812835417648086.kers'
[2026-05-24 05:13:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17588570681349015651.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17237812835417648086.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 133 cols 641 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-24 05:13:18] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17237812835417648086.kers
Total runtime 2 ms.
[2026-05-24 05:13:18] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-24 05:13:18] [INFO ] Invariant cache hit.
[2026-05-24 05:13:18] [INFO ] State equation strengthened by 76 read => feed constraints.
[2026-05-24 05:13:18] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2026-05-24 05:13:18] [INFO ] Invariant cache hit.
[2026-05-24 05:13:18] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/335 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 76/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 211 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16807 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/335 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 76/211 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 201/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 412 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47050ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 47053ms
Starting structural reductions in LTL mode, iteration 1 : 133/293 places, 202/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47898 ms. Remains : 133/293 places, 202/677 transitions.
[2026-05-24 05:14:06] [INFO ] Flatten gal took : 17 ms
[2026-05-24 05:14:06] [INFO ] Flatten gal took : 16 ms
[2026-05-24 05:14:06] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-24 05:14:06] [INFO ] Flatten gal took : 15 ms
[2026-05-24 05:14:06] [INFO ] Flatten gal took : 15 ms
[2026-05-24 05:14:06] [INFO ] Time to serialize gal into /tmp/CTLFireability67263888747542414.gal : 11 ms
[2026-05-24 05:14:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13159597769969852246.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability67263888747542414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13159597769969852246.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,240834,5.60263,141700,2,16567,5,361577,6,0,734,414309,0


Converting to forward existential form...Done !
original formula: AG((EF(EX(((p318>=1)&&(l0>=1)))) * AG(((p351<1)||(l2145<1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U EX(((p318>=1)&&(l0>=1))))))] = FALSE * [(FwdU(FwdU(Init,TRUE),TRUE) * !(((p351<1...180
(forward)formula 0,0,5.9338,141732,1,0,8,361577,10,2,1391,414309,3
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 233 transition count 426
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 233 transition count 426
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 134 place count 233 transition count 412
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 175 place count 192 transition count 357
Iterating global reduction 1 with 41 rules applied. Total rules applied 216 place count 192 transition count 357
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 228 place count 192 transition count 345
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 257 place count 163 transition count 300
Iterating global reduction 2 with 29 rules applied. Total rules applied 286 place count 163 transition count 300
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 303 place count 163 transition count 283
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 315 place count 151 transition count 258
Iterating global reduction 3 with 12 rules applied. Total rules applied 327 place count 151 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 330 place count 151 transition count 255
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 338 place count 143 transition count 247
Iterating global reduction 4 with 8 rules applied. Total rules applied 346 place count 143 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 350 place count 143 transition count 243
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 358 place count 135 transition count 218
Iterating global reduction 5 with 8 rules applied. Total rules applied 366 place count 135 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 370 place count 135 transition count 214
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 373 place count 132 transition count 194
Iterating global reduction 6 with 3 rules applied. Total rules applied 376 place count 132 transition count 194
Applied a total of 376 rules in 18 ms. Remains 132 /293 variables (removed 161) and now considering 194/677 (removed 483) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5032334528567467463.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3878057662835964928.kers'
[2026-05-24 05:14:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5032334528567467463.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3878057662835964928.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 132 cols 634 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-24 05:14:12] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3878057662835964928.kers
Total runtime 1 ms.
[2026-05-24 05:14:12] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-24 05:14:12] [INFO ] Invariant cache hit.
[2026-05-24 05:14:12] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 05:14:13] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-24 05:14:13] [INFO ] Invariant cache hit.
[2026-05-24 05:14:13] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/326 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 204 constraints, problems are : Problem set: 0 solved, 193 unsolved in 27209 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 1/132 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 194/326 variables, 132/140 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 64/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 193/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 397 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57408ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 57410ms
Starting structural reductions in LTL mode, iteration 1 : 132/293 places, 194/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58470 ms. Remains : 132/293 places, 194/677 transitions.
[2026-05-24 05:15:10] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:15:10] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:15:10] [INFO ] Input system was already deterministic with 194 transitions.
[2026-05-24 05:15:10] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:15:10] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:15:10] [INFO ] Time to serialize gal into /tmp/CTLFireability17747922601773086189.gal : 6 ms
[2026-05-24 05:15:10] [INFO ] Time to serialize properties into /tmp/CTLFireability12891018294156875506.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/CTLFireability17747922601773086189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12891018294156875506.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,271584,4.56918,109148,2,14892,5,275788,6,0,722,360456,0


Converting to forward existential form...Done !
original formula: EF(EX(((E(((s1>=1)&&(l3849>=1)) U ((p323>=1)&&(l3097>=1))) * (p380>=1)) * (l2273>=1))))
=> equivalent forward existential formula: [(FwdU(((EY(FwdU(Init,TRUE)) * (l2273>=1)) * (p380>=1)),((s1>=1)&&(l3849>=1))) * ((p323>=1)&&(l3097>=1)))] != FA...158
Hit Full ! (commute/partial/dont) 4/182/190
(forward)formula 0,0,4.876,109148,1,0,12,275788,17,3,1528,360456,7
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-01 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 : 293/293 places, 677/677 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 235 transition count 434
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 235 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 132 place count 235 transition count 418
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 172 place count 195 transition count 365
Iterating global reduction 1 with 40 rules applied. Total rules applied 212 place count 195 transition count 365
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 225 place count 195 transition count 352
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 254 place count 166 transition count 307
Iterating global reduction 2 with 29 rules applied. Total rules applied 283 place count 166 transition count 307
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 299 place count 166 transition count 291
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 312 place count 153 transition count 264
Iterating global reduction 3 with 13 rules applied. Total rules applied 325 place count 153 transition count 264
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 335 place count 153 transition count 254
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 342 place count 146 transition count 247
Iterating global reduction 4 with 7 rules applied. Total rules applied 349 place count 146 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 353 place count 146 transition count 243
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 359 place count 140 transition count 227
Iterating global reduction 5 with 6 rules applied. Total rules applied 365 place count 140 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 368 place count 140 transition count 224
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 371 place count 137 transition count 204
Iterating global reduction 6 with 3 rules applied. Total rules applied 374 place count 137 transition count 204
Applied a total of 374 rules in 64 ms. Remains 137 /293 variables (removed 156) and now considering 204/677 (removed 473) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11954172060445988042.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1362866787468571102.kers'
[2026-05-24 05:15:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11954172060445988042.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1362866787468571102.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 137 cols 661 entries
Finished phase 1 with 133 SingleSign rule and 2 generalized
[2026-05-24 05:15:15] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1362866787468571102.kers
Total runtime 1 ms.
[2026-05-24 05:15:15] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-24 05:15:15] [INFO ] Invariant cache hit.
[2026-05-24 05:15:15] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 05:15:16] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
[2026-05-24 05:15:16] [INFO ] Redundant transitions in 9 ms returned []
Running 203 sub problems to find dead transitions.
[2026-05-24 05:15:16] [INFO ] Invariant cache hit.
[2026-05-24 05:15:16] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/341 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 203 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 210 constraints, problems are : Problem set: 0 solved, 203 unsolved in 15315 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/341 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 203/413 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 413 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45427ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 45428ms
Starting structural reductions in SI_CTL mode, iteration 1 : 137/293 places, 204/677 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46745 ms. Remains : 137/293 places, 204/677 transitions.
[2026-05-24 05:16:02] [INFO ] Flatten gal took : 13 ms
[2026-05-24 05:16:02] [INFO ] Flatten gal took : 13 ms
[2026-05-24 05:16:02] [INFO ] Input system was already deterministic with 204 transitions.
[2026-05-24 05:16:02] [INFO ] Flatten gal took : 13 ms
[2026-05-24 05:16:02] [INFO ] Flatten gal took : 13 ms
[2026-05-24 05:16:02] [INFO ] Time to serialize gal into /tmp/CTLFireability4908523976024192420.gal : 5 ms
[2026-05-24 05:16:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11425913357332465.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/CTLFireability4908523976024192420.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11425913357332465.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 -...281
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,305316,6.97775,151160,2,16580,5,355643,6,0,752,530353,0


Converting to forward existential form...Done !
original formula: (EF(((p237<1)||(l0<1))) * AG(!(A(AG(((s1>=1)&&(l4106>=1))) U EF(((s1>=1)&&(l4118>=1)))))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((p237<1)||(l0<1)))))] = FALSE * [((FwdU(Init,TRUE) * !(EG(!(E(TRUE U ((s1>=1)&&(l4118>=1))...296
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t70, t71, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t...711
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,25.7774,531160,1,0,504,2.33652e+06,439,221,5496,1.28463e+06,579
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 234 transition count 427
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 234 transition count 427
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 133 place count 234 transition count 412
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 174 place count 193 transition count 357
Iterating global reduction 1 with 41 rules applied. Total rules applied 215 place count 193 transition count 357
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 228 place count 193 transition count 344
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 258 place count 163 transition count 297
Iterating global reduction 2 with 30 rules applied. Total rules applied 288 place count 163 transition count 297
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 305 place count 163 transition count 280
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 318 place count 150 transition count 253
Iterating global reduction 3 with 13 rules applied. Total rules applied 331 place count 150 transition count 253
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 338 place count 150 transition count 246
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 346 place count 142 transition count 238
Iterating global reduction 4 with 8 rules applied. Total rules applied 354 place count 142 transition count 238
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 358 place count 142 transition count 234
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 365 place count 135 transition count 217
Iterating global reduction 5 with 7 rules applied. Total rules applied 372 place count 135 transition count 217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 377 place count 135 transition count 212
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 380 place count 132 transition count 192
Iterating global reduction 6 with 3 rules applied. Total rules applied 383 place count 132 transition count 192
Applied a total of 383 rules in 22 ms. Remains 132 /293 variables (removed 161) and now considering 192/677 (removed 485) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3874869385045227910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8964661619268222310.kers'
[2026-05-24 05:16:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3874869385045227910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8964661619268222310.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 192 rows 132 cols 623 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-24 05:16:28] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8964661619268222310.kers
Total runtime 1 ms.
[2026-05-24 05:16:28] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-24 05:16:28] [INFO ] Invariant cache hit.
[2026-05-24 05:16:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 05:16:30] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2026-05-24 05:16:30] [INFO ] Invariant cache hit.
[2026-05-24 05:16:30] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/324 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 66/200 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 200 constraints, problems are : Problem set: 0 solved, 191 unsolved in 15272 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/324 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 66/200 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 191/391 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 391 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45418ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 45419ms
Starting structural reductions in LTL mode, iteration 1 : 132/293 places, 192/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47205 ms. Remains : 132/293 places, 192/677 transitions.
[2026-05-24 05:17:15] [INFO ] Flatten gal took : 7 ms
[2026-05-24 05:17:15] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:17:15] [INFO ] Input system was already deterministic with 192 transitions.
[2026-05-24 05:17:15] [INFO ] Flatten gal took : 7 ms
[2026-05-24 05:17:15] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:17:15] [INFO ] Time to serialize gal into /tmp/CTLFireability14700480826802368961.gal : 2 ms
[2026-05-24 05:17:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3862546250861561122.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/CTLFireability14700480826802368961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3862546250861561122.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,243189,4.70607,110588,2,13819,5,279033,6,0,720,355365,0


Converting to forward existential form...Done !
original formula: AX(EF(((EG(((p53<1)||(l0<1))) * (s1>=1)) * (l4105>=1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((EG(((p53<1)||(l0<1))) * (s1>=1)) * (l4105>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t70, t74, t75, t76, t85, t86, t87, t88, t89, t90, t91, t92, t93, t...634
(forward)formula 0,1,20.299,431568,1,0,462,2.07124e+06,413,192,5223,1.05731e+06,557
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 235 transition count 433
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 235 transition count 433
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 130 place count 235 transition count 419
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 171 place count 194 transition count 364
Iterating global reduction 1 with 41 rules applied. Total rules applied 212 place count 194 transition count 364
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 226 place count 194 transition count 350
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 255 place count 165 transition count 304
Iterating global reduction 2 with 29 rules applied. Total rules applied 284 place count 165 transition count 304
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 300 place count 165 transition count 288
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 313 place count 152 transition count 261
Iterating global reduction 3 with 13 rules applied. Total rules applied 326 place count 152 transition count 261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 333 place count 152 transition count 254
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 341 place count 144 transition count 246
Iterating global reduction 4 with 8 rules applied. Total rules applied 349 place count 144 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 353 place count 144 transition count 242
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 361 place count 136 transition count 217
Iterating global reduction 5 with 8 rules applied. Total rules applied 369 place count 136 transition count 217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 374 place count 136 transition count 212
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 376 place count 134 transition count 199
Iterating global reduction 6 with 2 rules applied. Total rules applied 378 place count 134 transition count 199
Applied a total of 378 rules in 21 ms. Remains 134 /293 variables (removed 159) and now considering 199/677 (removed 478) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17520050256753083664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2310099811203668089.kers'
[2026-05-24 05:17:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17520050256753083664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2310099811203668089.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 134 cols 651 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 05:17:36] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2310099811203668089.kers
Total runtime 1 ms.
[2026-05-24 05:17:36] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-24 05:17:36] [INFO ] Invariant cache hit.
[2026-05-24 05:17:36] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 05:17:37] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-24 05:17:37] [INFO ] Invariant cache hit.
[2026-05-24 05:17:37] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/333 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 66/202 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 202 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22843 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/333 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 66/202 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 198/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53003ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 53004ms
Starting structural reductions in LTL mode, iteration 1 : 134/293 places, 199/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54140 ms. Remains : 134/293 places, 199/677 transitions.
[2026-05-24 05:18:30] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:18:30] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:18:30] [INFO ] Input system was already deterministic with 199 transitions.
[2026-05-24 05:18:30] [INFO ] Flatten gal took : 11 ms
[2026-05-24 05:18:30] [INFO ] Flatten gal took : 10 ms
[2026-05-24 05:18:30] [INFO ] Time to serialize gal into /tmp/CTLFireability5695252217825758974.gal : 3 ms
[2026-05-24 05:18:30] [INFO ] Time to serialize properties into /tmp/CTLFireability10348635261878789133.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/CTLFireability5695252217825758974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10348635261878789133.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,283917,6.94154,147980,2,15556,5,387971,6,0,735,528609,0


Converting to forward existential form...Done !
original formula: AF(AX((((s1>=1)&&(l4107>=1))&&((l1701>=1)||(l4308>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((s1>=1)&&(l4107>=1))&&((l1701>=1)||(l4308>=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t28, t70, t71, t75, t76, t77, t85, t86, t87, t88, t90, t91, t92, t...675
(forward)formula 0,0,20.6632,366360,1,0,546,1.39136e+06,421,262,5217,1.3019e+06,541
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 233 transition count 426
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 233 transition count 426
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 135 place count 233 transition count 411
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 176 place count 192 transition count 356
Iterating global reduction 1 with 41 rules applied. Total rules applied 217 place count 192 transition count 356
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 231 place count 192 transition count 342
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 260 place count 163 transition count 297
Iterating global reduction 2 with 29 rules applied. Total rules applied 289 place count 163 transition count 297
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 305 place count 163 transition count 281
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 318 place count 150 transition count 254
Iterating global reduction 3 with 13 rules applied. Total rules applied 331 place count 150 transition count 254
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 338 place count 150 transition count 247
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 346 place count 142 transition count 239
Iterating global reduction 4 with 8 rules applied. Total rules applied 354 place count 142 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 358 place count 142 transition count 235
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 366 place count 134 transition count 210
Iterating global reduction 5 with 8 rules applied. Total rules applied 374 place count 134 transition count 210
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 379 place count 134 transition count 205
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 382 place count 131 transition count 185
Iterating global reduction 6 with 3 rules applied. Total rules applied 385 place count 131 transition count 185
Applied a total of 385 rules in 18 ms. Remains 131 /293 variables (removed 162) and now considering 185/677 (removed 492) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14215911945220757496.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8229698134404915138.kers'
[2026-05-24 05:18:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14215911945220757496.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8229698134404915138.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 131 cols 612 entries
Finished phase 1 with 127 SingleSign rule and 2 generalized
[2026-05-24 05:18:51] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8229698134404915138.kers
Total runtime 2 ms.
[2026-05-24 05:18:51] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-24 05:18:51] [INFO ] Invariant cache hit.
[2026-05-24 05:18:51] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-24 05:18:52] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2026-05-24 05:18:52] [INFO ] Invariant cache hit.
[2026-05-24 05:18:52] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/316 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 58/191 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 191 constraints, problems are : Problem set: 0 solved, 184 unsolved in 29942 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/316 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 58/191 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 184/375 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 375 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 131/293 places, 185/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60830 ms. Remains : 131/293 places, 185/677 transitions.
[2026-05-24 05:19:52] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:19:52] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:19:52] [INFO ] Input system was already deterministic with 185 transitions.
[2026-05-24 05:19:52] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:19:52] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:19:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3463545340782243789.gal : 2 ms
[2026-05-24 05:19:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5415510795030545787.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/CTLFireability3463545340782243789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5415510795030545787.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,252915,4.83459,106944,2,13363,5,278570,6,0,709,343507,0


Converting to forward existential form...Done !
original formula: AF(AG(AF((AX(((p344>=1)&&(l2273>=1))) + ((s1>=1)&&(l4106>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!((!(EX(!(((p344>=1)&&(l2273>=1))))) + ((s1>=1)&&(l4106>=1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t96, t97, t99, t...596
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,21.599,429668,1,0,599,1.89812e+06,405,311,5190,1.33926e+06,615
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 244 transition count 484
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 244 transition count 484
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 117 place count 244 transition count 465
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 153 place count 208 transition count 422
Iterating global reduction 1 with 36 rules applied. Total rules applied 189 place count 208 transition count 422
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 204 place count 208 transition count 407
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 231 place count 181 transition count 363
Iterating global reduction 2 with 27 rules applied. Total rules applied 258 place count 181 transition count 363
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 276 place count 181 transition count 345
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 287 place count 170 transition count 321
Iterating global reduction 3 with 11 rules applied. Total rules applied 298 place count 170 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 304 place count 170 transition count 315
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 311 place count 163 transition count 308
Iterating global reduction 4 with 7 rules applied. Total rules applied 318 place count 163 transition count 308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 323 place count 163 transition count 303
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 328 place count 158 transition count 294
Iterating global reduction 5 with 5 rules applied. Total rules applied 333 place count 158 transition count 294
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 337 place count 158 transition count 290
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 338 place count 157 transition count 283
Iterating global reduction 6 with 1 rules applied. Total rules applied 339 place count 157 transition count 283
Applied a total of 339 rules in 27 ms. Remains 157 /293 variables (removed 136) and now considering 283/677 (removed 394) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16553748770346433940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13769256167051450922.kers'
[2026-05-24 05:20:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16553748770346433940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13769256167051450922.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 157 cols 845 entries
Finished phase 1 with 153 SingleSign rule and 2 generalized
[2026-05-24 05:20:13] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13769256167051450922.kers
Total runtime 2 ms.
[2026-05-24 05:20:14] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-24 05:20:14] [INFO ] Invariant cache hit.
[2026-05-24 05:20:14] [INFO ] State equation strengthened by 133 read => feed constraints.
[2026-05-24 05:20:15] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-24 05:20:15] [INFO ] Invariant cache hit.
[2026-05-24 05:20:15] [INFO ] State equation strengthened by 133 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 283/440 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 133/292 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 10/302 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 303 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 283/440 variables, 157/170 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 133/303 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 282/585 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 585 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Starting structural reductions in LTL mode, iteration 1 : 157/293 places, 283/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61951 ms. Remains : 157/293 places, 283/677 transitions.
[2026-05-24 05:21:15] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:21:15] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:21:15] [INFO ] Input system was already deterministic with 283 transitions.
[2026-05-24 05:21:15] [INFO ] Flatten gal took : 17 ms
[2026-05-24 05:21:15] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:21:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10386503351641462560.gal : 3 ms
[2026-05-24 05:21:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10712293646767460036.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/CTLFireability10386503351641462560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10712293646767460036.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,474400,21.1198,404160,2,31842,5,979629,6,0,911,1.1439e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 05:21:46] [INFO ] Flatten gal took : 7 ms
[2026-05-24 05:21:46] [INFO ] Applying decomposition
[2026-05-24 05:21: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/graph13494151591622573731.txt' '-o' '/tmp/graph13494151591622573731.bin' '-w' '/tmp/graph13494151591622573731.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13494151591622573731.bin' '-l' '-1' '-v' '-w' '/tmp/graph13494151591622573731.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:21:46] [INFO ] Decomposing Gal with order
[2026-05-24 05:21:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:21:46] [INFO ] Removed a total of 268 redundant transitions.
[2026-05-24 05:21:46] [INFO ] Flatten gal took : 121 ms
[2026-05-24 05:21:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 217 labels/synchronizations in 21 ms.
[2026-05-24 05:21:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11669152000118948691.gal : 6 ms
[2026-05-24 05:21:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8966155272605748786.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/CTLFireability11669152000118948691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8966155272605748786.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,474400,1.79694,43996,2142,2095,42270,24072,608,99920,300,212235,0


Converting to forward existential form...Done !
original formula: AG((((AG(((i4.u9.p154>=1)&&(i0.u1.l0>=1))) + AX(((i7.u20.p433<1)||(i7.u11.l2528<1)))) + ((((EF(((i0.u1.s1>=1)&&(i3.u13.l3088>=1))) * (i8....497
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !((((i0.u1.s2>=1)&&(i8.u22.l4182>=1))||((((i0.u6.p240>=1)&&(i0.u1.l0>=1))&&((i0.u1.s1>...578
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t13, t30, t122, t125, t136, t140, t165, t166, t168, t173, t181, t184, t197, t202, t20...1204
(forward)formula 0,0,4.47018,97812,1,0,92824,64614,3066,255151,1661,490524,474424
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 234 transition count 431
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 234 transition count 431
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 133 place count 234 transition count 416
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 174 place count 193 transition count 361
Iterating global reduction 1 with 41 rules applied. Total rules applied 215 place count 193 transition count 361
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 229 place count 193 transition count 347
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 258 place count 164 transition count 301
Iterating global reduction 2 with 29 rules applied. Total rules applied 287 place count 164 transition count 301
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 302 place count 164 transition count 286
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 315 place count 151 transition count 259
Iterating global reduction 3 with 13 rules applied. Total rules applied 328 place count 151 transition count 259
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 335 place count 151 transition count 252
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 343 place count 143 transition count 244
Iterating global reduction 4 with 8 rules applied. Total rules applied 351 place count 143 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 355 place count 143 transition count 240
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 363 place count 135 transition count 215
Iterating global reduction 5 with 8 rules applied. Total rules applied 371 place count 135 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 376 place count 135 transition count 210
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 379 place count 132 transition count 190
Iterating global reduction 6 with 3 rules applied. Total rules applied 382 place count 132 transition count 190
Applied a total of 382 rules in 43 ms. Remains 132 /293 variables (removed 161) and now considering 190/677 (removed 487) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3280073133643601357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18377142051023566258.kers'
[2026-05-24 05:21:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3280073133643601357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18377142051023566258.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 132 cols 632 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-24 05:21:50] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18377142051023566258.kers
Total runtime 1 ms.
[2026-05-24 05:21:51] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-24 05:21:51] [INFO ] Invariant cache hit.
[2026-05-24 05:21:51] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-24 05:21:51] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
[2026-05-24 05:21:51] [INFO ] Redundant transitions in 10 ms returned []
Running 189 sub problems to find dead transitions.
[2026-05-24 05:21:51] [INFO ] Invariant cache hit.
[2026-05-24 05:21:51] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 58/192 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 192 constraints, problems are : Problem set: 0 solved, 189 unsolved in 28197 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 58/192 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 189/381 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 381 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58314ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 58314ms
Starting structural reductions in SI_CTL mode, iteration 1 : 132/293 places, 190/677 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59257 ms. Remains : 132/293 places, 190/677 transitions.
[2026-05-24 05:22:50] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:22:50] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:22:50] [INFO ] Input system was already deterministic with 190 transitions.
[2026-05-24 05:22:50] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:22:50] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:22:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4163172836303972678.gal : 2 ms
[2026-05-24 05:22:50] [INFO ] Time to serialize properties into /tmp/CTLFireability6535402856999623879.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/CTLFireability4163172836303972678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6535402856999623879.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,290306,5.94433,134300,2,14121,5,357815,6,0,718,460416,0


Converting to forward existential form...Done !
original formula: E(!(((s1>=1)&&(l4313>=1))) U ((s1>=1)&&(l4107>=1)))
=> equivalent forward existential formula: [(FwdU(Init,!(((s1>=1)&&(l4313>=1)))) * ((s1>=1)&&(l4107>=1)))] != FALSE
Hit Full ! (commute/partial/dont) 3/0/187
(forward)formula 0,1,11.9792,197860,1,0,9,690476,16,1,1407,590078,4
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 240 transition count 455
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 240 transition count 455
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 122 place count 240 transition count 439
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 157 place count 205 transition count 390
Iterating global reduction 1 with 35 rules applied. Total rules applied 192 place count 205 transition count 390
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 204 place count 205 transition count 378
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 228 place count 181 transition count 339
Iterating global reduction 2 with 24 rules applied. Total rules applied 252 place count 181 transition count 339
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 264 place count 181 transition count 327
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 273 place count 172 transition count 310
Iterating global reduction 3 with 9 rules applied. Total rules applied 282 place count 172 transition count 310
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 289 place count 172 transition count 303
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 294 place count 167 transition count 298
Iterating global reduction 4 with 5 rules applied. Total rules applied 299 place count 167 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 303 place count 167 transition count 294
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 306 place count 164 transition count 284
Iterating global reduction 5 with 3 rules applied. Total rules applied 309 place count 164 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 310 place count 164 transition count 283
Applied a total of 310 rules in 24 ms. Remains 164 /293 variables (removed 129) and now considering 283/677 (removed 394) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12027590520567811025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-443442018549787410.kers'
[2026-05-24 05:23:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12027590520567811025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-443442018549787410.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 164 cols 862 entries
Finished phase 1 with 160 SingleSign rule and 2 generalized
[2026-05-24 05:23:02] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-443442018549787410.kers
Total runtime 2 ms.
[2026-05-24 05:23:02] [INFO ] Implicit Places using invariants in 183 ms returned []
[2026-05-24 05:23:02] [INFO ] Invariant cache hit.
[2026-05-24 05:23:02] [INFO ] State equation strengthened by 125 read => feed constraints.
[2026-05-24 05:23:03] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-24 05:23:03] [INFO ] Invariant cache hit.
[2026-05-24 05:23:03] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 283/447 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 125/291 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 292 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 283/447 variables, 164/167 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 125/292 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 282/574 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 574 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 164/293 places, 283/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61625 ms. Remains : 164/293 places, 283/677 transitions.
[2026-05-24 05:24:03] [INFO ] Flatten gal took : 14 ms
[2026-05-24 05:24:04] [INFO ] Flatten gal took : 15 ms
[2026-05-24 05:24:04] [INFO ] Input system was already deterministic with 283 transitions.
[2026-05-24 05:24:04] [INFO ] Flatten gal took : 13 ms
[2026-05-24 05:24:04] [INFO ] Flatten gal took : 14 ms
[2026-05-24 05:24:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11971866971547104152.gal : 3 ms
[2026-05-24 05:24:04] [INFO ] Time to serialize properties into /tmp/CTLFireability11319142011474117608.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/CTLFireability11971866971547104152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11319142011474117608.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,621237,22.0724,425380,2,33583,5,965196,6,0,939,1.10774e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 05:24:34] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:24:34] [INFO ] Applying decomposition
[2026-05-24 05:24:34] [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/graph17407376247353378080.txt' '-o' '/tmp/graph17407376247353378080.bin' '-w' '/tmp/graph17407376247353378080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17407376247353378080.bin' '-l' '-1' '-v' '-w' '/tmp/graph17407376247353378080.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:24:34] [INFO ] Decomposing Gal with order
[2026-05-24 05:24:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:24:34] [INFO ] Removed a total of 263 redundant transitions.
[2026-05-24 05:24:34] [INFO ] Flatten gal took : 34 ms
[2026-05-24 05:24:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 241 labels/synchronizations in 14 ms.
[2026-05-24 05:24:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12754448872587607745.gal : 4 ms
[2026-05-24 05:24:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4125929614033336385.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/CTLFireability12754448872587607745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4125929614033336385.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,621237,4.03315,95652,2388,3467,87177,83697,580,315058,385,472670,0


Converting to forward existential form...Done !
original formula: (AF(!(E(EF((((i3.u0.s1>=1)&&(i3.u0.l3085>=1))||((i3.u0.s1>=1)&&(i7.u19.l4121>=1)))) U ((i3.u0.s1>=1)&&(i2.u2.l2883>=1))))) * AX((((AG(((i...419
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(E(TRUE U (((i3.u0.s1>=1)&&(i3.u0.l3085>=1))||((i3.u0.s1>=1)&&(i7.u19.l4121>=1)))) U ((i3.u0.s1...516
Reverse transition relation is NOT exact ! Due to transitions t6, t76, t120, t138, t145, t146, t148, t158, t169, t170, t171, t179, t190, t206, t219, t220, ...1132
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,13.9393,309564,1,0,341725,212977,2737,1.30452e+06,2117,1.24182e+06,999146
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 236 transition count 429
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 236 transition count 429
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 127 place count 236 transition count 416
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 166 place count 197 transition count 364
Iterating global reduction 1 with 39 rules applied. Total rules applied 205 place count 197 transition count 364
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 218 place count 197 transition count 351
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 247 place count 168 transition count 307
Iterating global reduction 2 with 29 rules applied. Total rules applied 276 place count 168 transition count 307
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 294 place count 168 transition count 289
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 305 place count 157 transition count 268
Iterating global reduction 3 with 11 rules applied. Total rules applied 316 place count 157 transition count 268
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 320 place count 157 transition count 264
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 327 place count 150 transition count 257
Iterating global reduction 4 with 7 rules applied. Total rules applied 334 place count 150 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 338 place count 150 transition count 253
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 343 place count 145 transition count 244
Iterating global reduction 5 with 5 rules applied. Total rules applied 348 place count 145 transition count 244
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 351 place count 145 transition count 241
Applied a total of 351 rules in 19 ms. Remains 145 /293 variables (removed 148) and now considering 241/677 (removed 436) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2966588387738657797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2153914442640440612.kers'
[2026-05-24 05:24:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2966588387738657797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2153914442640440612.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 241 rows 145 cols 740 entries
Finished phase 1 with 141 SingleSign rule and 2 generalized
[2026-05-24 05:24:48] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2153914442640440612.kers
Total runtime 2 ms.
[2026-05-24 05:24:48] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-24 05:24:48] [INFO ] Invariant cache hit.
[2026-05-24 05:24:48] [INFO ] State equation strengthened by 103 read => feed constraints.
[2026-05-24 05:24:49] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2026-05-24 05:24:49] [INFO ] Invariant cache hit.
[2026-05-24 05:24:49] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/386 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 103/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 250 constraints, problems are : Problem set: 0 solved, 240 unsolved in 24476 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/386 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 103/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 240/490 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 490 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54603ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 54604ms
Starting structural reductions in LTL mode, iteration 1 : 145/293 places, 241/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55622 ms. Remains : 145/293 places, 241/677 transitions.
[2026-05-24 05:25:43] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:25:43] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:25:43] [INFO ] Input system was already deterministic with 241 transitions.
[2026-05-24 05:25:44] [INFO ] Flatten gal took : 7 ms
[2026-05-24 05:25:44] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:25:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16305150254244475857.gal : 2 ms
[2026-05-24 05:25:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11945262700048738007.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/CTLFireability16305150254244475857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11945262700048738007.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,341256,11.1762,213200,2,20469,5,501314,6,0,821,670069,0


Converting to forward existential form...Done !
original formula: AF((E(((s1>=1)&&(l3082>=1)) U ((A(((p115>=1)&&(l0>=1)) U EX(((s1>=1)&&(l2326>=1)))) * (s1>=1)) * (l4126>=1))) + ((s1>=1)&&(l1791>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(((s1>=1)&&(l3082>=1)) U ((!((E(!(EX(((s1>=1)&&(l2326>=1)))) U (!(((p115>=1)&&(l0>=1))) * !(EX(((...277
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t29, t55, t56, t60, t78, t79, t80, t81, t82, t83, t84, t85, t86, t...975
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-24 05:26:14] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:26:14] [INFO ] Applying decomposition
[2026-05-24 05:26:14] [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/graph7459935263587020856.txt' '-o' '/tmp/graph7459935263587020856.bin' '-w' '/tmp/graph7459935263587020856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7459935263587020856.bin' '-l' '-1' '-v' '-w' '/tmp/graph7459935263587020856.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:26:14] [INFO ] Decomposing Gal with order
[2026-05-24 05:26:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:26:14] [INFO ] Removed a total of 276 redundant transitions.
[2026-05-24 05:26:14] [INFO ] Flatten gal took : 23 ms
[2026-05-24 05:26:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 225 labels/synchronizations in 15 ms.
[2026-05-24 05:26:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17081899919094828106.gal : 3 ms
[2026-05-24 05:26:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15917408516959128368.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/CTLFireability17081899919094828106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15917408516959128368.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,341256,4.07931,95504,2134,1758,81870,26408,644,505157,269,289782,0


Converting to forward existential form...Done !
original formula: AF((E(((i0.u0.s1>=1)&&(i4.u5.l3082>=1)) U ((A(((i0.u7.p115>=1)&&(i0.u0.l0>=1)) U EX(((i0.u0.s1>=1)&&(i1.i0.u12.l2326>=1)))) * (i0.u0.s1>=...218
=> equivalent forward existential formula: [FwdG(Init,!((E(((i0.u0.s1>=1)&&(i4.u5.l3082>=1)) U ((!((E(!(EX(((i0.u0.s1>=1)&&(i1.i0.u12.l2326>=1)))) U (!(((i...374
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t14, t27, t29, t52, t56, t60, t77, t83, t85, t91, t99, t100, t102, t103, t111, t119,...748
(forward)formula 0,0,18.04,408416,1,0,299601,93429,2814,2.86781e+06,1511,1.25495e+06,1035941
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 239 transition count 469
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 239 transition count 469
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 125 place count 239 transition count 452
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 166 place count 198 transition count 397
Iterating global reduction 1 with 41 rules applied. Total rules applied 207 place count 198 transition count 397
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 224 place count 198 transition count 380
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 253 place count 169 transition count 334
Iterating global reduction 2 with 29 rules applied. Total rules applied 282 place count 169 transition count 334
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 302 place count 169 transition count 314
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 313 place count 158 transition count 290
Iterating global reduction 3 with 11 rules applied. Total rules applied 324 place count 158 transition count 290
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 331 place count 158 transition count 283
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 338 place count 151 transition count 276
Iterating global reduction 4 with 7 rules applied. Total rules applied 345 place count 151 transition count 276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 349 place count 151 transition count 272
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 356 place count 144 transition count 252
Iterating global reduction 5 with 7 rules applied. Total rules applied 363 place count 144 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 367 place count 144 transition count 248
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 369 place count 142 transition count 236
Iterating global reduction 6 with 2 rules applied. Total rules applied 371 place count 142 transition count 236
Applied a total of 371 rules in 22 ms. Remains 142 /293 variables (removed 151) and now considering 236/677 (removed 441) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5222996735902941790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17961324432275064073.kers'
[2026-05-24 05:26:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5222996735902941790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17961324432275064073.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 236 rows 142 cols 718 entries
Finished phase 1 with 138 SingleSign rule and 2 generalized
[2026-05-24 05:26:32] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17961324432275064073.kers
Total runtime 2 ms.
[2026-05-24 05:26:32] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-24 05:26:32] [INFO ] Invariant cache hit.
[2026-05-24 05:26:32] [INFO ] State equation strengthened by 104 read => feed constraints.
[2026-05-24 05:26:33] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2026-05-24 05:26:33] [INFO ] Invariant cache hit.
[2026-05-24 05:26:33] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/378 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 104/248 constraints. Problems are: Problem set: 0 solved, 235 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 248 constraints, problems are : Problem set: 0 solved, 235 unsolved in 24602 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/378 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 104/248 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 235/483 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 483 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54737ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 54738ms
Starting structural reductions in LTL mode, iteration 1 : 142/293 places, 236/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56097 ms. Remains : 142/293 places, 236/677 transitions.
[2026-05-24 05:27:28] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:27:28] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:27:28] [INFO ] Input system was already deterministic with 236 transitions.
[2026-05-24 05:27:28] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:27:28] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:27:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4725062497286124108.gal : 2 ms
[2026-05-24 05:27:28] [INFO ] Time to serialize properties into /tmp/CTLFireability23319251984613711.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/CTLFireability4725062497286124108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability23319251984613711.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 -...281
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,397361,11.9099,257712,2,25814,5,624298,6,0,804,867291,0


Converting to forward existential form...Done !
original formula: EX(AF(((EG((((s1<1)||(l2144<1))&&((s1<1)||(l2166<1)))) * E(EX(((s1>=1)&&(l4279>=1))) U EG(((s1>=1)&&(l3089>=1))))) * E((((s1>=1)&&(l4101>...212
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((EG((((s1<1)||(l2144<1))&&((s1<1)||(l2166<1)))) * E(EX(((s1>=1)&&(l4279>=1))) U EG(((s1>=1)...263
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t36, t40, t70, t71, t75, t76, t77, t78, t79,...914
Detected timeout of ITS tools.
[2026-05-24 05:27:58] [INFO ] Flatten gal took : 6 ms
[2026-05-24 05:27:58] [INFO ] Applying decomposition
[2026-05-24 05:27:58] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2356603008626046250.txt' '-o' '/tmp/graph2356603008626046250.bin' '-w' '/tmp/graph2356603008626046250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2356603008626046250.bin' '-l' '-1' '-v' '-w' '/tmp/graph2356603008626046250.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:27:58] [INFO ] Decomposing Gal with order
[2026-05-24 05:27:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:27:58] [INFO ] Removed a total of 234 redundant transitions.
[2026-05-24 05:27:58] [INFO ] Flatten gal took : 21 ms
[2026-05-24 05:27:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 14 ms.
[2026-05-24 05:27:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11634724322914067647.gal : 3 ms
[2026-05-24 05:27:58] [INFO ] Time to serialize properties into /tmp/CTLFireability5307385285564905503.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/CTLFireability11634724322914067647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5307385285564905503.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,397361,2.58931,68612,1650,1161,74746,20609,590,312221,241,177609,0


Converting to forward existential form...Done !
original formula: EX(AF(((EG((((i3.u2.s1<1)||(i3.u2.l2144<1))&&((i3.u2.s1<1)||(i1.u0.l2166<1)))) * E(EX(((i3.u2.s1>=1)&&(i6.u5.l4279>=1))) U EG(((i3.u2.s1>...300
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((EG((((i3.u2.s1<1)||(i3.u2.l2144<1))&&((i3.u2.s1<1)||(i1.u0.l2166<1)))) * E(EX(((i3.u2.s1>=...351
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t77, t110, t115, t126, t129, t132, t140, t146, t148, t152, t163, t180, t182, t183, t...609
(forward)formula 0,0,5.7502,124788,1,0,140411,50991,2526,616650,1330,300131,467321
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 237 transition count 462
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 237 transition count 462
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 132 place count 237 transition count 442
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 171 place count 198 transition count 389
Iterating global reduction 1 with 39 rules applied. Total rules applied 210 place count 198 transition count 389
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 224 place count 198 transition count 375
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 250 place count 172 transition count 335
Iterating global reduction 2 with 26 rules applied. Total rules applied 276 place count 172 transition count 335
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 292 place count 172 transition count 319
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 303 place count 161 transition count 295
Iterating global reduction 3 with 11 rules applied. Total rules applied 314 place count 161 transition count 295
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 323 place count 161 transition count 286
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 329 place count 155 transition count 280
Iterating global reduction 4 with 6 rules applied. Total rules applied 335 place count 155 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 338 place count 155 transition count 277
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 344 place count 149 transition count 258
Iterating global reduction 5 with 6 rules applied. Total rules applied 350 place count 149 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 354 place count 149 transition count 254
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 357 place count 146 transition count 234
Iterating global reduction 6 with 3 rules applied. Total rules applied 360 place count 146 transition count 234
Applied a total of 360 rules in 43 ms. Remains 146 /293 variables (removed 147) and now considering 234/677 (removed 443) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15194315990266308974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4873701422669797185.kers'
[2026-05-24 05:28:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15194315990266308974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4873701422669797185.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 146 cols 732 entries
Finished phase 1 with 142 SingleSign rule and 2 generalized
[2026-05-24 05:28:04] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4873701422669797185.kers
Total runtime 2 ms.
[2026-05-24 05:28:04] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-24 05:28:04] [INFO ] Invariant cache hit.
[2026-05-24 05:28:04] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-24 05:28:05] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2026-05-24 05:28:05] [INFO ] Invariant cache hit.
[2026-05-24 05:28:05] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/380 variables, 146/148 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 94/242 constraints. Problems are: Problem set: 0 solved, 233 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 243 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 234/380 variables, 146/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 94/243 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 233/476 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 476 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 146/293 places, 234/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61084 ms. Remains : 146/293 places, 234/677 transitions.
[2026-05-24 05:29:05] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:29:05] [INFO ] Flatten gal took : 11 ms
[2026-05-24 05:29:05] [INFO ] Input system was already deterministic with 234 transitions.
[2026-05-24 05:29:05] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:29:05] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:29:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14147449918489649610.gal : 2 ms
[2026-05-24 05:29:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16743469739410783429.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/CTLFireability14147449918489649610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16743469739410783429.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,413497,10.8922,222232,2,23952,5,541875,6,0,818,724268,0


Converting to forward existential form...Done !
original formula: ((AF(((s1>=1)&&(l4110>=1))) * EX(A(!(EX(((s1>=1)&&(l3089>=1)))) U EG(A(((s1>=1)&&(l3085>=1)) U ((s1>=1)&&(l4118>=1))))))) * (EG(EX((((s1<...225
=> equivalent forward existential formula: (([FwdG(Init,!(((s1>=1)&&(l4110>=1))))] = FALSE * [(Init * !(EX(!((E(!(EG(!((E(!(((s1>=1)&&(l4118>=1))) U (!(((s...669
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t83, t85, t...829
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-24 05:29:35] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:29:35] [INFO ] Applying decomposition
[2026-05-24 05:29:35] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7560024565436012136.txt' '-o' '/tmp/graph7560024565436012136.bin' '-w' '/tmp/graph7560024565436012136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7560024565436012136.bin' '-l' '-1' '-v' '-w' '/tmp/graph7560024565436012136.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:29:35] [INFO ] Decomposing Gal with order
[2026-05-24 05:29:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:29:35] [INFO ] Removed a total of 233 redundant transitions.
[2026-05-24 05:29:35] [INFO ] Flatten gal took : 19 ms
[2026-05-24 05:29:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 8 ms.
[2026-05-24 05:29:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14796349899832620539.gal : 11 ms
[2026-05-24 05:29:35] [INFO ] Time to serialize properties into /tmp/CTLFireability1641461293407665517.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/CTLFireability14796349899832620539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1641461293407665517.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,413497,2.49211,66664,1663,1438,43846,26497,588,372996,283,310790,0


Converting to forward existential form...Done !
original formula: ((AF(((i0.u0.s1>=1)&&(i6.u20.l4110>=1))) * EX(A(!(EX(((i0.u0.s1>=1)&&(i2.u3.l3089>=1)))) U EG(A(((i0.u0.s1>=1)&&(i2.u8.l3085>=1)) U ((i0....312
=> equivalent forward existential formula: (([FwdG(Init,!(((i0.u0.s1>=1)&&(i6.u20.l4110>=1))))] = FALSE * [(Init * !(EX(!((E(!(EG(!((E(!(((i0.u0.s1>=1)&&(i...884
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t68, t74, t75, t84, t87, t102, t103, t111, t120, t129, t138, t142, t164, t175, t176, ...699
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,13.204,309928,1,0,193475,76383,2640,2.29518e+06,1570,1.11321e+06,564304
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 236 transition count 441
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 236 transition count 441
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 131 place count 236 transition count 424
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 170 place count 197 transition count 374
Iterating global reduction 1 with 39 rules applied. Total rules applied 209 place count 197 transition count 374
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 223 place count 197 transition count 360
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 250 place count 170 transition count 318
Iterating global reduction 2 with 27 rules applied. Total rules applied 277 place count 170 transition count 318
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 292 place count 170 transition count 303
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 303 place count 159 transition count 278
Iterating global reduction 3 with 11 rules applied. Total rules applied 314 place count 159 transition count 278
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 327 place count 159 transition count 265
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 333 place count 153 transition count 259
Iterating global reduction 4 with 6 rules applied. Total rules applied 339 place count 153 transition count 259
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 344 place count 148 transition count 254
Iterating global reduction 4 with 5 rules applied. Total rules applied 349 place count 148 transition count 254
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 353 place count 148 transition count 250
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 356 place count 145 transition count 230
Iterating global reduction 5 with 3 rules applied. Total rules applied 359 place count 145 transition count 230
Applied a total of 359 rules in 41 ms. Remains 145 /293 variables (removed 148) and now considering 230/677 (removed 447) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8756747231585448907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6762530832546161771.kers'
[2026-05-24 05:29:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8756747231585448907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6762530832546161771.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 145 cols 725 entries
Finished phase 1 with 141 SingleSign rule and 2 generalized
[2026-05-24 05:29:49] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6762530832546161771.kers
Total runtime 2 ms.
[2026-05-24 05:29:49] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-24 05:29:49] [INFO ] Invariant cache hit.
[2026-05-24 05:29:49] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-24 05:29:50] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2026-05-24 05:29:50] [INFO ] Redundant transitions in 3 ms returned []
Running 229 sub problems to find dead transitions.
[2026-05-24 05:29:50] [INFO ] Invariant cache hit.
[2026-05-24 05:29:50] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/375 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 90/237 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/375 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 237 constraints, problems are : Problem set: 0 solved, 229 unsolved in 23494 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/375 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 90/237 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 229/466 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 466 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53653ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 53654ms
Starting structural reductions in SI_CTL mode, iteration 1 : 145/293 places, 230/677 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54684 ms. Remains : 145/293 places, 230/677 transitions.
[2026-05-24 05:30:43] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:30:43] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:30:43] [INFO ] Input system was already deterministic with 230 transitions.
[2026-05-24 05:30:43] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:30:43] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:30:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10335505379947064368.gal : 2 ms
[2026-05-24 05:30:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12982727211182079214.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/CTLFireability10335505379947064368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12982727211182079214.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,361638,7.6773,166360,2,21332,5,396685,6,0,810,534681,0


Converting to forward existential form...Done !
original formula: E(EF(((p316>=1)&&(l3103>=1))) U (((s1>=1)&&(l4109>=1)) + ((AG((((s1>=1)&&(l4110>=1)) + EF(((s1>=1)&&(l4110>=1))))) * (s1>=1)) * (l4117>=1...159
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U ((p316>=1)&&(l3103>=1)))) * ((s1>=1)&&(l4109>=1)))] != FALSE + [(((FwdU(Init,E(TRUE U ((p3...289
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t52, t53, t55, t74, t75, t79, t80, t81, t82, t83, t84, t85, t86, t87, t...852
Detected timeout of ITS tools.
[2026-05-24 05:31:13] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:31:13] [INFO ] Applying decomposition
[2026-05-24 05:31:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8663846547061306959.txt' '-o' '/tmp/graph8663846547061306959.bin' '-w' '/tmp/graph8663846547061306959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8663846547061306959.bin' '-l' '-1' '-v' '-w' '/tmp/graph8663846547061306959.weights' '-q' '0' '-e' '0.001'
[2026-05-24 05:31:13] [INFO ] Decomposing Gal with order
[2026-05-24 05:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 05:31:13] [INFO ] Removed a total of 263 redundant transitions.
[2026-05-24 05:31:13] [INFO ] Flatten gal took : 18 ms
[2026-05-24 05:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 5 ms.
[2026-05-24 05:31:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9299543282108777790.gal : 2 ms
[2026-05-24 05:31:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7876105316280436122.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/CTLFireability9299543282108777790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7876105316280436122.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,361638,2.07098,55832,2273,1568,63380,18241,574,249056,254,121300,0


Converting to forward existential form...Done !
original formula: E(EF(((i2.u14.p316>=1)&&(i2.u14.l3103>=1))) U (((i4.u0.s1>=1)&&(i7.u20.l4109>=1)) + ((AG((((i4.u0.s1>=1)&&(i7.u20.l4110>=1)) + EF(((i4.u0...225
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U ((i2.u14.p316>=1)&&(i2.u14.l3103>=1)))) * ((i4.u0.s1>=1)&&(i7.u20.l4109>=1)))] != FALSE + ...369
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t13, t55, t73, t86, t88, t89, t104, t106, t108, t129, t131, t134, t135, t154, t162, t...818
(forward)formula 0,1,4.81799,114656,1,0,140705,42338,2620,543244,1313,227383,471500
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 235 transition count 434
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 235 transition count 434
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 130 place count 235 transition count 420
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 171 place count 194 transition count 365
Iterating global reduction 1 with 41 rules applied. Total rules applied 212 place count 194 transition count 365
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 224 place count 194 transition count 353
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 253 place count 165 transition count 308
Iterating global reduction 2 with 29 rules applied. Total rules applied 282 place count 165 transition count 308
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 299 place count 165 transition count 291
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 310 place count 154 transition count 267
Iterating global reduction 3 with 11 rules applied. Total rules applied 321 place count 154 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 326 place count 154 transition count 262
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 334 place count 146 transition count 254
Iterating global reduction 4 with 8 rules applied. Total rules applied 342 place count 146 transition count 254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 345 place count 146 transition count 251
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 353 place count 138 transition count 233
Iterating global reduction 5 with 8 rules applied. Total rules applied 361 place count 138 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 367 place count 138 transition count 227
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 370 place count 135 transition count 207
Iterating global reduction 6 with 3 rules applied. Total rules applied 373 place count 135 transition count 207
Applied a total of 373 rules in 18 ms. Remains 135 /293 variables (removed 158) and now considering 207/677 (removed 470) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12896692360040539321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4882332829642122681.kers'
[2026-05-24 05:31:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12896692360040539321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4882332829642122681.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 135 cols 659 entries
Finished phase 1 with 131 SingleSign rule and 2 generalized
[2026-05-24 05:31:18] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4882332829642122681.kers
Total runtime 2 ms.
[2026-05-24 05:31:18] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-24 05:31:18] [INFO ] Invariant cache hit.
[2026-05-24 05:31:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-24 05:31:19] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2026-05-24 05:31:19] [INFO ] Invariant cache hit.
[2026-05-24 05:31:19] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/342 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 77/214 constraints. Problems are: Problem set: 0 solved, 206 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/342 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 214 constraints, problems are : Problem set: 0 solved, 206 unsolved in 21190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/342 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 77/214 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 206/420 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/342 variables, and 420 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51340ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 51341ms
Starting structural reductions in LTL mode, iteration 1 : 135/293 places, 207/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52188 ms. Remains : 135/293 places, 207/677 transitions.
[2026-05-24 05:32:11] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:32:11] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:32:11] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-24 05:32:11] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:32:11] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:32:11] [INFO ] Time to serialize gal into /tmp/CTLFireability252233785513348829.gal : 1 ms
[2026-05-24 05:32:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12727362053793861610.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/CTLFireability252233785513348829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12727362053793861610.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,273898,5.31217,123740,2,15833,5,305070,6,0,747,391762,0


Converting to forward existential form...Done !
original formula: AX((E(E(!(((s1>=1)&&(l3850>=1))) U !(((s1>=1)&&(l2472>=1)))) U ((s1>=1)&&(l4112>=1))) * AX(EF(((s1<1)||(l1798<1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(E(!(((s1>=1)&&(l3850>=1))) U !(((s1>=1)&&(l2472>=1)))) U ((s1>=1)&&(l4112>=1)))))] = FALSE * [...214
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t27, t69, t70, t74, t75, t76, t84, t85, t86, t87, t88, t90, t91, t92, t...687
(forward)formula 0,1,19.6208,371912,1,0,550,1.68991e+06,446,267,5384,1.06668e+06,597
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 293/293 places, 677/677 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 233 transition count 420
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 233 transition count 420
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 134 place count 233 transition count 406
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 176 place count 191 transition count 350
Iterating global reduction 1 with 42 rules applied. Total rules applied 218 place count 191 transition count 350
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 231 place count 191 transition count 337
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 262 place count 160 transition count 288
Iterating global reduction 2 with 31 rules applied. Total rules applied 293 place count 160 transition count 288
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 311 place count 160 transition count 270
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 324 place count 147 transition count 243
Iterating global reduction 3 with 13 rules applied. Total rules applied 337 place count 147 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 341 place count 147 transition count 239
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 350 place count 138 transition count 230
Iterating global reduction 4 with 9 rules applied. Total rules applied 359 place count 138 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 363 place count 138 transition count 226
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 371 place count 130 transition count 208
Iterating global reduction 5 with 8 rules applied. Total rules applied 379 place count 130 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 385 place count 130 transition count 202
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 388 place count 127 transition count 182
Iterating global reduction 6 with 3 rules applied. Total rules applied 391 place count 127 transition count 182
Applied a total of 391 rules in 30 ms. Remains 127 /293 variables (removed 166) and now considering 182/677 (removed 495) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1398804210631804930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-349196065725969141.kers'
[2026-05-24 05:32:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1398804210631804930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-349196065725969141.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 127 cols 593 entries
Finished phase 1 with 123 SingleSign rule and 2 generalized
[2026-05-24 05:32:30] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-349196065725969141.kers
Total runtime 2 ms.
[2026-05-24 05:32:31] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-24 05:32:31] [INFO ] Invariant cache hit.
[2026-05-24 05:32:31] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 05:32:31] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
[2026-05-24 05:32:31] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-24 05:32:31] [INFO ] Invariant cache hit.
[2026-05-24 05:32:31] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 190 constraints, problems are : Problem set: 0 solved, 181 unsolved in 14826 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 181/371 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/309 variables, and 371 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44978ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 44980ms
Starting structural reductions in SI_CTL mode, iteration 1 : 127/293 places, 182/677 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46063 ms. Remains : 127/293 places, 182/677 transitions.
[2026-05-24 05:33:16] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:33:16] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:33:16] [INFO ] Input system was already deterministic with 182 transitions.
[2026-05-24 05:33:16] [INFO ] Flatten gal took : 5 ms
[2026-05-24 05:33:16] [INFO ] Flatten gal took : 4 ms
[2026-05-24 05:33:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7563269268890839947.gal : 2 ms
[2026-05-24 05:33:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1368352427089013328.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/CTLFireability7563269268890839947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1368352427089013328.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,195090,3.86433,89552,2,11848,5,231276,6,0,690,289560,0


Converting to forward existential form...Done !
original formula: AF(EG(((p271<1)||(l0<1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p271<1)||(l0<1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t69, t70, t74, t75, t76, t84, t93, t95, t96, t97, t99, t100, t120, t129...569
(forward)formula 0,1,14.0483,312436,1,0,384,1.47398e+06,390,158,4888,726536,473
FORMULA DBSingleClientW-PT-d2m05-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 05:33:31] [INFO ] Flatten gal took : 13 ms
[2026-05-24 05:33:31] [INFO ] Flatten gal took : 13 ms
Total runtime 1270152 ms.

BK_STOP 1779600811197

--------------------
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="DBSingleClientW-PT-d2m05"
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 DBSingleClientW-PT-d2m05, 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 r082-smll-177946993600202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m05.tgz
mv DBSingleClientW-PT-d2m05 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 ;