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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.2K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:45 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 119K 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-d0m04-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-12
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-13
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-14
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779550736042

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-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 15:38:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 15:38:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 15:38:58] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2026-05-23 15:38:58] [INFO ] Transformed 553 places.
[2026-05-23 15:38:58] [INFO ] Transformed 150 transitions.
[2026-05-23 15:38:58] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
Support contains 68 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 98 transition count 135
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 98 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 97 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 97 transition count 134
Applied a total of 28 rules in 47 ms. Remains 97 /109 variables (removed 12) and now considering 134/150 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9814845086053990910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16059113930553385631.kers'
[2026-05-23 15:38:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9814845086053990910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16059113930553385631.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 97 cols 402 entries
Finished phase 1 with 93 SingleSign rule and 2 generalized
[2026-05-23 15:38:58] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16059113930553385631.kers
Total runtime 2 ms.
[2026-05-23 15:38:58] [INFO ] Implicit Places using invariants in 353 ms returned []
[2026-05-23 15:38:58] [INFO ] Invariant cache hit.
[2026-05-23 15:38:59] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-23 15:38:59] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-05-23 15:38:59] [INFO ] Invariant cache hit.
[2026-05-23 15:38:59] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 7/166 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/231 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 167 constraints, problems are : Problem set: 0 solved, 133 unsolved in 18049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/231 variables, 97/107 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 60/167 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 133/300 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/231 variables, and 300 constraints, problems are : Problem set: 0 solved, 133 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48493ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 48524ms
Starting structural reductions in LTL mode, iteration 1 : 97/109 places, 134/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49369 ms. Remains : 97/109 places, 134/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2026-05-23 15:39:47] [INFO ] Invariant cache hit.
[2026-05-23 15:39:47] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-23 15:39:47] [INFO ] Invariant cache hit.
[2026-05-23 15:39:48] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-23 15:39:48] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 97/97 places, 134/134 transitions.
Support contains 68 out of 97 places after structural reductions.
[2026-05-23 15:39:48] [INFO ] Flatten gal took : 69 ms
[2026-05-23 15:39:48] [INFO ] Flatten gal took : 33 ms
[2026-05-23 15:39:48] [INFO ] Input system was already deterministic with 134 transitions.
Reduction of identical properties reduced properties to check from 75 to 70
RANDOM walk for 40000 steps (9214 resets) in 3718 ms. (10 steps per ms) remains 36/70 properties
BEST_FIRST walk for 4003 steps (182 resets) in 44 ms. (88 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (395 resets) in 44 ms. (88 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (216 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (205 resets) in 41 ms. (95 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (229 resets) in 50 ms. (78 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (125 resets) in 46 ms. (85 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (202 resets) in 48 ms. (81 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (204 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (394 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (180 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (208 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (203 resets) in 56 ms. (70 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (194 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (427 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (189 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (211 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (207 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (404 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (203 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (211 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (190 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (193 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (386 resets) in 43 ms. (90 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (383 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (198 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (197 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (394 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (202 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (201 resets) in 22 ms. (174 steps per ms) remains 32/36 properties
BEST_FIRST walk for 4001 steps (192 resets) in 57 ms. (68 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (406 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (212 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (384 resets) in 32 ms. (121 steps per ms) remains 29/32 properties
BEST_FIRST walk for 4004 steps (193 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (204 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
[2026-05-23 15:39:50] [INFO ] Invariant cache hit.
[2026-05-23 15:39:50] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/66 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/80 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 122/202 variables, 80/82 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 48/130 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/130 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 29/231 variables, 17/147 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 12/159 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/231 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 159 constraints, problems are : Problem set: 3 solved, 26 unsolved in 2551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 29/63 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 16/79 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 121/200 variables, 79/81 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 47/128 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/129 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 20/149 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 9/158 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 26 unsolved
SMT process timed out in 7619ms, After SMT, problems are : Problem set: 3 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 90 transition count 127
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 90 transition count 127
Applied a total of 14 rules in 24 ms. Remains 90 /97 variables (removed 7) and now considering 127/134 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 90/97 places, 127/134 transitions.
RANDOM walk for 40000 steps (9074 resets) in 606 ms. (65 steps per ms) remains 21/26 properties
BEST_FIRST walk for 4003 steps (197 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (421 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (181 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (109 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (198 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (210 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (399 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (200 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (191 resets) in 50 ms. (78 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (206 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (221 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (399 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (398 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (185 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (195 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (196 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (402 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (202 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (433 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (371 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (197 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6793940121080580116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13253955205609523412.kers'
[2026-05-23 15:39:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6793940121080580116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13253955205609523412.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 90 cols 378 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 15:39:58] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13253955205609523412.kers
Total runtime 3 ms.
[2026-05-23 15:39:58] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 25/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 19/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 115/189 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/122 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 26/215 variables, 15/137 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 11/148 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 2/217 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/217 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 150 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1685 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 25/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 19/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 115/189 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 46/122 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 26/215 variables, 15/138 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 11/149 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 2/217 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 0/217 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 171 constraints, problems are : Problem set: 0 solved, 21 unsolved in 7020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8774ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 0 properties in 1302 ms.
Support contains 30 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 127/127 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 126
Applied a total of 2 rules in 18 ms. Remains 89 /90 variables (removed 1) and now considering 126/127 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 89/90 places, 126/127 transitions.
RANDOM walk for 40000 steps (9100 resets) in 405 ms. (98 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (199 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (407 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (196 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (137 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (191 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (205 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (429 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (199 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (208 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (195 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (222 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (403 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (401 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (210 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (191 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (200 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (380 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (181 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (407 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (396 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (200 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
Probably explored full state space saw : 9471 states, properties seen :20
Probabilistic random walk after 22889 steps, saw 9471 distinct states, run finished after 186 ms. (steps per millisecond=123 ) properties seen :20
Explored full state space saw : 9554 states, properties seen :0
Exhaustive walk after 22972 steps, saw 9554 distinct states, run finished after 58 ms. (steps per millisecond=396 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2026-05-23 15:40:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 15:40:09] [INFO ] Flatten gal took : 14 ms
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 15:40:09] [INFO ] Flatten gal took : 14 ms
[2026-05-23 15:40:09] [INFO ] Input system was already deterministic with 134 transitions.
Support contains 66 out of 97 places (down from 67) after GAL structural reductions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 326 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 82 transition count 112
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 82 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 82 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 78 transition count 107
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 78 transition count 107
Applied a total of 39 rules in 9 ms. Remains 78 /97 variables (removed 19) and now considering 107/134 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4576696072225903026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9272428336807872619.kers'
[2026-05-23 15:40:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4576696072225903026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9272428336807872619.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 78 cols 329 entries
Finished phase 1 with 74 SingleSign rule and 2 generalized
[2026-05-23 15:40:09] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9272428336807872619.kers
Total runtime 1 ms.
[2026-05-23 15:40:09] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-23 15:40:09] [INFO ] Invariant cache hit.
[2026-05-23 15:40:09] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-23 15:40:09] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2026-05-23 15:40:09] [INFO ] Invariant cache hit.
[2026-05-23 15:40:09] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/185 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 44/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 124 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4665 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/185 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 44/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 106/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 230 constraints, problems are : Problem set: 0 solved, 106 unsolved in 16888 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21625ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 21626ms
Starting structural reductions in LTL mode, iteration 1 : 78/97 places, 107/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21936 ms. Remains : 78/97 places, 107/134 transitions.
[2026-05-23 15:40:31] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:40:31] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:40:31] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-23 15:40:31] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:40:31] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:40:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14086958242739791113.gal : 5 ms
[2026-05-23 15:40:31] [INFO ] Time to serialize properties into /tmp/CTLFireability17325589259393553714.ctl : 14 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/CTLFireability14086958242739791113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17325589259393553714.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,8163,0.232592,10268,2,1901,5,25939,6,0,419,13821,0


Converting to forward existential form...Done !
original formula: AF((AX(((EG(((s1<1)||(l354<1))) * EG(((p10<1)||(l153<1)))) * EG(((p18<1)||(l115<1))))) * !(A(((E(((s1>=1)&&(l491>=1)) U ((s1>=1)&&(l90>=1...287
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(((EG(((s1<1)||(l354<1))) * EG(((p10<1)||(l153<1)))) * EG(((p18<1)||(l115<1))))))) * !(!((E(...515
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t53, t54, t55, t61, t6...434
(forward)formula 0,1,1.67955,49668,1,0,490,242945,267,217,2877,182336,611
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 82 transition count 108
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 82 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 75 transition count 101
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 75 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 75 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 74 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 74 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 73 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 73 transition count 96
Applied a total of 50 rules in 11 ms. Remains 73 /97 variables (removed 24) and now considering 96/134 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8296319631985138179.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12330037353110349376.kers'
[2026-05-23 15:40:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8296319631985138179.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12330037353110349376.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 96 rows 73 cols 301 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-23 15:40:33] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12330037353110349376.kers
Total runtime 1 ms.
[2026-05-23 15:40:33] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-23 15:40:33] [INFO ] Invariant cache hit.
[2026-05-23 15:40:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-23 15:40:33] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2026-05-23 15:40:33] [INFO ] Invariant cache hit.
[2026-05-23 15:40:33] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/169 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 37/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 112 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4405 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/169 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 37/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 95/207 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 207 constraints, problems are : Problem set: 0 solved, 95 unsolved in 17143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21590ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 21591ms
Starting structural reductions in LTL mode, iteration 1 : 73/97 places, 96/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21882 ms. Remains : 73/97 places, 96/134 transitions.
[2026-05-23 15:40:55] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:40:55] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:40:55] [INFO ] Input system was already deterministic with 96 transitions.
[2026-05-23 15:40:55] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:40:55] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:40:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4272951527328682911.gal : 3 ms
[2026-05-23 15:40:55] [INFO ] Time to serialize properties into /tmp/CTLFireability481368261582093455.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/CTLFireability4272951527328682911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability481368261582093455.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,6908,0.17136,9156,2,1912,5,19473,6,0,388,10615,0


Converting to forward existential form...Done !
original formula: AX(A(A((EG(((s1>=1)&&(l496>=1))) + (AF(((s1>=1)&&(l510>=1))) * (((s1>=1)&&(l345>=1))||((s1>=1)&&(l487>=1))))) U ((!(((s1>=1)&&(l337>=1))|...367
=> equivalent forward existential formula: ((([FwdG(((FwdU(EY(Init),!(!(((!((!(EG(!(((p24>=1)&&(l0>=1))))) + E(((s3>=1)&&(l0>=1)) U ((s1>=1)&&(l510>=1)))))...3077
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t51, t52, t53,...394
(forward)formula 0,0,1.58493,43280,1,0,346,190212,233,149,2738,137707,415
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 81 transition count 106
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 81 transition count 106
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 75 transition count 100
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 75 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 74 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 74 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 73 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 73 transition count 97
Applied a total of 48 rules in 10 ms. Remains 73 /97 variables (removed 24) and now considering 97/134 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8952458825708665898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10978213780631289586.kers'
[2026-05-23 15:40:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8952458825708665898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10978213780631289586.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 73 cols 307 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-23 15:40:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10978213780631289586.kers
Total runtime 1 ms.
[2026-05-23 15:40:56] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-23 15:40:56] [INFO ] Invariant cache hit.
[2026-05-23 15:40:56] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 15:40:57] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-23 15:40:57] [INFO ] Invariant cache hit.
[2026-05-23 15:40:57] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 36/111 constraints. Problems are: Problem set: 0 solved, 96 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/170 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 111 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 36/111 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 96/207 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 207 constraints, problems are : Problem set: 0 solved, 96 unsolved in 14310 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18470ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 18470ms
Starting structural reductions in LTL mode, iteration 1 : 73/97 places, 97/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18811 ms. Remains : 73/97 places, 97/134 transitions.
[2026-05-23 15:41:15] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:41:15] [INFO ] Flatten gal took : 11 ms
[2026-05-23 15:41:15] [INFO ] Input system was already deterministic with 97 transitions.
[2026-05-23 15:41:15] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:41:15] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:41:15] [INFO ] Time to serialize gal into /tmp/CTLFireability4419833654329400892.gal : 3 ms
[2026-05-23 15:41:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16519601516189342958.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/CTLFireability4419833654329400892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16519601516189342958.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,7172,0.199609,10832,2,2469,5,25717,6,0,389,15592,0


Converting to forward existential form...Done !
original formula: E(((s1>=1)&&(l497>=1)) U AF(((AG(((p21>=1)&&(l126>=1))) * AF(((s3>=1)&&(l0>=1)))) * ((A(((s1>=1)&&(l489>=1)) U ((s1>=1)&&(l353>=1))) + ((...336
=> equivalent forward existential formula: [(FwdU(Init,((s1>=1)&&(l497>=1))) * !(EG(!(((!(E(TRUE U !(((p21>=1)&&(l126>=1))))) * !(EG(!(((s3>=1)&&(l0>=1))))...572
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t52, t53, t5...396
Using saturation style SCC detection
(forward)formula 0,0,1.69156,51616,1,0,449,231413,252,220,2802,175581,606
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 79 transition count 103
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 79 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 79 transition count 102
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 71 transition count 94
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 71 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 71 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 70 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 70 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 69 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 69 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 68 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 68 transition count 85
Applied a total of 63 rules in 11 ms. Remains 68 /97 variables (removed 29) and now considering 85/134 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5588291422259354638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17044773545524110599.kers'
[2026-05-23 15:41:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5588291422259354638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17044773545524110599.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 68 cols 268 entries
Finished phase 1 with 64 SingleSign rule and 2 generalized
[2026-05-23 15:41:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17044773545524110599.kers
Total runtime 1 ms.
[2026-05-23 15:41:17] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-23 15:41:17] [INFO ] Invariant cache hit.
[2026-05-23 15:41:17] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-23 15:41:17] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2026-05-23 15:41:17] [INFO ] Invariant cache hit.
[2026-05-23 15:41:17] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/153 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 32/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 102 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2866 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/153 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 32/102 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 84/186 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 186 constraints, problems are : Problem set: 0 solved, 84 unsolved in 9329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12228ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 12229ms
Starting structural reductions in LTL mode, iteration 1 : 68/97 places, 85/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12570 ms. Remains : 68/97 places, 85/134 transitions.
[2026-05-23 15:41:29] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:41:29] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:41:29] [INFO ] Input system was already deterministic with 85 transitions.
[2026-05-23 15:41:29] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:41:29] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:41:29] [INFO ] Time to serialize gal into /tmp/CTLFireability926424036066684409.gal : 3 ms
[2026-05-23 15:41:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4045379091351593899.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/CTLFireability926424036066684409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4045379091351593899.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,5771,0.112776,7684,2,1810,5,13977,6,0,357,9327,0


Converting to forward existential form...Done !
original formula: EF((((s1<1)||(l339<1)) * (((EX(EX(((s1<1)||(l123<1)))) * (s1>=1)) * (l505>=1)) + (((s1>=1)&&(l504>=1))&&((s1<1)||(l150<1))))))
=> equivalent forward existential formula: ([(EY(EY((((FwdU(Init,TRUE) * ((s1<1)||(l339<1))) * (l505>=1)) * (s1>=1)))) * ((s1<1)||(l123<1)))] != FALSE + [(...250
(forward)formula 0,1,0.121387,7948,1,0,14,13977,11,4,540,9327,6
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 79 transition count 105
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 79 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 79 transition count 104
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 72 transition count 97
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 72 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 70 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 70 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 68 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 68 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 67 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 67 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 67 transition count 87
Applied a total of 63 rules in 26 ms. Remains 67 /97 variables (removed 30) and now considering 87/134 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6373879397134365240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2838463101214238611.kers'
[2026-05-23 15:41:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6373879397134365240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2838463101214238611.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 87 rows 67 cols 271 entries
Finished phase 1 with 63 SingleSign rule and 2 generalized
[2026-05-23 15:41:30] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2838463101214238611.kers
Total runtime 1 ms.
[2026-05-23 15:41:30] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-23 15:41:30] [INFO ] Invariant cache hit.
[2026-05-23 15:41:30] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-23 15:41:30] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2026-05-23 15:41:30] [INFO ] Invariant cache hit.
[2026-05-23 15:41:30] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/154 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 34/103 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 103 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2678 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/154 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 34/103 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 86/189 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 189 constraints, problems are : Problem set: 0 solved, 86 unsolved in 9734 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12458ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 12458ms
Starting structural reductions in LTL mode, iteration 1 : 67/97 places, 87/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12830 ms. Remains : 67/97 places, 87/134 transitions.
[2026-05-23 15:41:42] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:41:42] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:41:42] [INFO ] Input system was already deterministic with 87 transitions.
[2026-05-23 15:41:42] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:41:43] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:41:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17963909720639423739.gal : 2 ms
[2026-05-23 15:41:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7744023412748315924.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/CTLFireability17963909720639423739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7744023412748315924.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,5272,0.14588,8576,2,2055,5,17622,6,0,355,10530,0


Converting to forward existential form...Done !
original formula: A(AX(((p19>=1)&&(l126>=1))) U (E(A(AX(((s1>=1)&&(l149>=1))) U !(EF(((s1>=1)&&(l488>=1))))) U EF(((s1>=1)&&(l353>=1)))) + ((s1>=1)&&(l149>...161
=> equivalent forward existential formula: [((Init * !(EG(!((E(!((E(!(!(E(TRUE U ((s1>=1)&&(l488>=1))))) U (!(!(EX(!(((s1>=1)&&(l149>=1)))))) * !(!(E(TRUE ...807
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t48, t49, t50, t57, t5...376
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1.38502,37540,1,0,395,164506,214,204,2484,132707,464
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 76 transition count 94
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 76 transition count 93
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 66 transition count 83
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 86 place count 58 transition count 64
Applied a total of 86 rules in 38 ms. Remains 58 /97 variables (removed 39) and now considering 64/134 (removed 70) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13838111639454459846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13009611788256026328.kers'
[2026-05-23 15:41:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13838111639454459846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13009611788256026328.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 58 cols 210 entries
Finished phase 1 with 54 SingleSign rule and 2 generalized
[2026-05-23 15:41:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13009611788256026328.kers
Total runtime 1 ms.
[2026-05-23 15:41:44] [INFO ] Implicit Places using invariants in 166 ms returned []
[2026-05-23 15:41:44] [INFO ] Invariant cache hit.
[2026-05-23 15:41:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 15:41:44] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2026-05-23 15:41:44] [INFO ] Redundant transitions in 2 ms returned []
Running 63 sub problems to find dead transitions.
[2026-05-23 15:41:44] [INFO ] Invariant cache hit.
[2026-05-23 15:41:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 86 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/122 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 63/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 149 constraints, problems are : Problem set: 0 solved, 63 unsolved in 6575 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10848ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 10850ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/97 places, 64/134 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11227 ms. Remains : 58/97 places, 64/134 transitions.
[2026-05-23 15:41:55] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:41:55] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:41:55] [INFO ] Input system was already deterministic with 64 transitions.
[2026-05-23 15:41:55] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:41:55] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:41:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6651377027241139621.gal : 0 ms
[2026-05-23 15:41:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6024937923954025275.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/CTLFireability6651377027241139621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6024937923954025275.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,3440,0.068005,6372,2,1503,5,8918,6,0,296,6384,0


Converting to forward existential form...Done !
original formula: EF(AG(((p10<1)||(l153<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p10<1)||(l153<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...286
(forward)formula 0,1,0.337377,14416,1,0,155,44743,150,67,1970,26786,172
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 77 transition count 97
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 77 transition count 96
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 68 transition count 87
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 66 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 65 transition count 79
Applied a total of 67 rules in 15 ms. Remains 65 /97 variables (removed 32) and now considering 79/134 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1749601544114483888.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18403817768464977753.kers'
[2026-05-23 15:41:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1749601544114483888.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18403817768464977753.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 79 rows 65 cols 255 entries
Finished phase 1 with 61 SingleSign rule and 2 generalized
[2026-05-23 15:41:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18403817768464977753.kers
Total runtime 1 ms.
[2026-05-23 15:41:56] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-23 15:41:56] [INFO ] Invariant cache hit.
[2026-05-23 15:41:56] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-23 15:41:56] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2026-05-23 15:41:56] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2026-05-23 15:41:56] [INFO ] Invariant cache hit.
[2026-05-23 15:41:56] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/144 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 27/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/144 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 96 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 79/144 variables, 65/69 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 78/174 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 174 constraints, problems are : Problem set: 0 solved, 78 unsolved in 9528 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14182ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 14185ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/97 places, 79/134 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14431 ms. Remains : 65/97 places, 79/134 transitions.
[2026-05-23 15:42:10] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:42:10] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:42:10] [INFO ] Input system was already deterministic with 79 transitions.
[2026-05-23 15:42:10] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:42:10] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:42:10] [INFO ] Time to serialize gal into /tmp/CTLFireability18216946715917893291.gal : 1 ms
[2026-05-23 15:42:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10484040204805210529.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/CTLFireability18216946715917893291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10484040204805210529.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,5773,0.104103,7152,2,1596,5,13693,6,0,339,8330,0


Converting to forward existential form...Done !
original formula: EF(EG((((EF(((s1<1)||(l491<1))) + AG(((s1<1)||(l337<1)))) + (EG(((s1<1)||(l342<1))) + (s1<1))) + (l110<1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((E(TRUE U ((s1<1)||(l491<1))) + !(E(TRUE U !(((s1<1)||(l337<1)))))) + (EG(((s1<1)||(l342...194
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t49, t51, t52, t53, t58, t59, t60, t61, t62, t63, t64, t65, t66, t6...311
(forward)formula 0,1,1.14439,31044,1,0,266,143938,192,117,2420,108535,321
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 77 transition count 97
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 77 transition count 96
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 68 transition count 87
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 65 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 64 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 64 transition count 75
Applied a total of 72 rules in 7 ms. Remains 64 /97 variables (removed 33) and now considering 75/134 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10503457274224142997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3951563901890944508.kers'
[2026-05-23 15:42:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10503457274224142997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3951563901890944508.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 64 cols 243 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 15:42:11] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3951563901890944508.kers
Total runtime 1 ms.
[2026-05-23 15:42:11] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 15:42:11] [INFO ] Invariant cache hit.
[2026-05-23 15:42:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 15:42:11] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2026-05-23 15:42:11] [INFO ] Invariant cache hit.
[2026-05-23 15:42:11] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 95 constraints, problems are : Problem set: 0 solved, 74 unsolved in 4043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/139 variables, 64/70 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 74/169 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 169 constraints, problems are : Problem set: 0 solved, 74 unsolved in 9240 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13310ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 13310ms
Starting structural reductions in LTL mode, iteration 1 : 64/97 places, 75/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13583 ms. Remains : 64/97 places, 75/134 transitions.
[2026-05-23 15:42:25] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:42:25] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:42:25] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-23 15:42:25] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:42:25] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:42:25] [INFO ] Time to serialize gal into /tmp/CTLFireability5625743482499590271.gal : 0 ms
[2026-05-23 15:42:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6137444614502813759.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/CTLFireability5625743482499590271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6137444614502813759.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,5042,0.090254,6776,2,1459,5,10960,6,0,331,7541,0


Converting to forward existential form...Done !
original formula: E(((s1>=1)&&(l502>=1)) U EG(!(EG(EX(((p11>=1)&&(l154>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,((s1>=1)&&(l502>=1))),!(EG(EX(((p11>=1)&&(l154>=1))))))] != FALSE
Hit Full ! (commute/partial/dont) 1/70/74
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t45, t48, t49, t50, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...311
Using saturation style SCC detection
(forward)formula 0,1,0.409912,16084,1,0,171,49638,183,71,2429,35559,189
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 76 transition count 94
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 76 transition count 93
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 66 transition count 83
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 62 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 61 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 61 transition count 70
Applied a total of 78 rules in 13 ms. Remains 61 /97 variables (removed 36) and now considering 70/134 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14445088743962189928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6447522731175453050.kers'
[2026-05-23 15:42:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14445088743962189928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6447522731175453050.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 61 cols 232 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-23 15:42:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6447522731175453050.kers
Total runtime 1 ms.
[2026-05-23 15:42:25] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-23 15:42:25] [INFO ] Invariant cache hit.
[2026-05-23 15:42:25] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 15:42:25] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2026-05-23 15:42:25] [INFO ] Redundant transitions in 2 ms returned []
Running 69 sub problems to find dead transitions.
[2026-05-23 15:42:25] [INFO ] Invariant cache hit.
[2026-05-23 15:42:25] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/131 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 87 constraints, problems are : Problem set: 0 solved, 69 unsolved in 3663 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 70/131 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 69/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 156 constraints, problems are : Problem set: 0 solved, 69 unsolved in 8169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11856ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 11856ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/97 places, 70/134 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12149 ms. Remains : 61/97 places, 70/134 transitions.
[2026-05-23 15:42:37] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:42:37] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:42:37] [INFO ] Input system was already deterministic with 70 transitions.
[2026-05-23 15:42:37] [INFO ] Flatten gal took : 2 ms
[2026-05-23 15:42:37] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:42:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1473167363448905709.gal : 1 ms
[2026-05-23 15:42:37] [INFO ] Time to serialize properties into /tmp/CTLFireability12412434580342849062.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/CTLFireability1473167363448905709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12412434580342849062.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,4626,0.082271,6552,2,1464,5,9933,6,0,314,6857,0


Converting to forward existential form...Done !
original formula: EF(AG(AF(((s1<1)||(l335<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((s1<1)||(l335<1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t45, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t6...291
(forward)formula 0,1,0.385205,14576,1,0,160,47514,166,63,2133,30193,178
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 82 transition count 106
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 82 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 82 transition count 105
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 75 transition count 98
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 75 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 74 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 74 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 73 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 73 transition count 95
Applied a total of 49 rules in 7 ms. Remains 73 /97 variables (removed 24) and now considering 95/134 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13565901480988993456.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7824122581731207237.kers'
[2026-05-23 15:42:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13565901480988993456.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7824122581731207237.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 73 cols 301 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-23 15:42:38] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7824122581731207237.kers
Total runtime 1 ms.
[2026-05-23 15:42:38] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-23 15:42:38] [INFO ] Invariant cache hit.
[2026-05-23 15:42:38] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-23 15:42:38] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2026-05-23 15:42:38] [INFO ] Invariant cache hit.
[2026-05-23 15:42:38] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/168 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 35/110 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 7/117 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 0/168 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 124 constraints, problems are : Problem set: 0 solved, 94 unsolved in 10544 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 95/168 variables, 73/89 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 35/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 94/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 218 constraints, problems are : Problem set: 0 solved, 94 unsolved in 15008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25593ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 25595ms
Starting structural reductions in LTL mode, iteration 1 : 73/97 places, 95/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25944 ms. Remains : 73/97 places, 95/134 transitions.
[2026-05-23 15:43:04] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:43:04] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:43:04] [INFO ] Input system was already deterministic with 95 transitions.
[2026-05-23 15:43:04] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:43:04] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:43:04] [INFO ] Time to serialize gal into /tmp/CTLFireability10524245875415267693.gal : 2 ms
[2026-05-23 15:43:04] [INFO ] Time to serialize properties into /tmp/CTLFireability4320275632749956579.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/CTLFireability10524245875415267693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4320275632749956579.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,7223,0.144613,8668,2,1990,5,17535,6,0,387,9032,0


Converting to forward existential form...Done !
original formula: (EG(((((((((!(E(((s1>=1)&&(l488>=1)) U ((s1>=1)&&(l509>=1)))) * ((p30<1)||(l0<1))) * ((s1<1)||(l339<1))) + (s1<1)) + (l339<1)) * ((((s1<1...482
=> equivalent forward existential formula: ([(((Init * !(EG(((((((((!(E(((s1>=1)&&(l488>=1)) U ((s1>=1)&&(l509>=1)))) * ((p30<1)||(l0<1))) * ((s1<1)||(l339...994
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t29, t47, t48, t49, t50, t51, t52, t59, t60, t61, t62,...379
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1.88307,51752,1,0,570,255929,255,291,2699,183735,703
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 81 transition count 107
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 81 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 81 transition count 106
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 75 transition count 100
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 75 transition count 100
Applied a total of 45 rules in 3 ms. Remains 75 /97 variables (removed 22) and now considering 100/134 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4340835286351483524.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14563201608521959639.kers'
[2026-05-23 15:43:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4340835286351483524.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14563201608521959639.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 75 cols 319 entries
Finished phase 1 with 71 SingleSign rule and 2 generalized
[2026-05-23 15:43:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14563201608521959639.kers
Total runtime 1 ms.
[2026-05-23 15:43:06] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-23 15:43:06] [INFO ] Invariant cache hit.
[2026-05-23 15:43:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 15:43:06] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2026-05-23 15:43:06] [INFO ] Invariant cache hit.
[2026-05-23 15:43:06] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/175 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 36/113 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 5/118 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 118 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4611 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 100/175 variables, 75/82 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 36/118 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 99/217 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 217 constraints, problems are : Problem set: 0 solved, 99 unsolved in 16402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21039ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 21040ms
Starting structural reductions in LTL mode, iteration 1 : 75/97 places, 100/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21305 ms. Remains : 75/97 places, 100/134 transitions.
[2026-05-23 15:43:27] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:43:27] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:43:27] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-23 15:43:27] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:43:27] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:43:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15495346131508377116.gal : 1 ms
[2026-05-23 15:43:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6299778926107915095.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/CTLFireability15495346131508377116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6299778926107915095.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,7547,0.204674,9712,2,2117,5,22360,6,0,400,13533,0


Converting to forward existential form...Done !
original formula: E(AF(((EG(EX(((s1>=1)&&(l110>=1)))) + !(((p39>=1)&&(l137>=1)))) + (!((((s1>=1)&&(l339>=1))||((s1>=1)&&(l502>=1)))) * (AX(((s1>=1)&&(l149>...446
=> equivalent forward existential formula: ((([(((FwdU(Init,!(EG(!(((EG(EX(((s1>=1)&&(l110>=1)))) + !(((p39>=1)&&(l137>=1)))) + (!((((s1>=1)&&(l339>=1))||(...1322
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t53, t54, t55, t61, t6...402
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,2.1134,50172,1,0,344,217318,252,157,2946,164897,395
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 79 transition count 99
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 79 transition count 98
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 72 transition count 91
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 72 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 72 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 71 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 71 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 70 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 70 transition count 86
Applied a total of 57 rules in 3 ms. Remains 70 /97 variables (removed 27) and now considering 86/134 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4217227031951756815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14633515779113650498.kers'
[2026-05-23 15:43:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4217227031951756815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14633515779113650498.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 70 cols 279 entries
Finished phase 1 with 66 SingleSign rule and 2 generalized
[2026-05-23 15:43:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14633515779113650498.kers
Total runtime 1 ms.
[2026-05-23 15:43:29] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-23 15:43:29] [INFO ] Invariant cache hit.
[2026-05-23 15:43:29] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 15:43:29] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-23 15:43:29] [INFO ] Invariant cache hit.
[2026-05-23 15:43:29] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/156 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 85 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 101 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2625 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/156 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 85/186 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 186 constraints, problems are : Problem set: 0 solved, 85 unsolved in 12214 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14876ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 14878ms
Starting structural reductions in LTL mode, iteration 1 : 70/97 places, 86/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15170 ms. Remains : 70/97 places, 86/134 transitions.
[2026-05-23 15:43:44] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:43:44] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:43:44] [INFO ] Input system was already deterministic with 86 transitions.
[2026-05-23 15:43:44] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:43:44] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:43:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13547608040818958291.gal : 1 ms
[2026-05-23 15:43:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10843569347918576359.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/CTLFireability13547608040818958291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10843569347918576359.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,6976,0.166364,9344,2,2155,5,19598,6,0,366,14083,0


Converting to forward existential form...Done !
original formula: (!(A((((s1>=1)&&(l340>=1))||((p39>=1)&&(l137>=1))) U !((((((((s1>=1)&&(l488>=1))||((s1>=1)&&(l509>=1))) * E(((s1>=1)&&(l488>=1)) U ((s1>=...281
=> equivalent forward existential formula: [(EY((Init * !(!(!((E(!(!((((((((s1>=1)&&(l488>=1))||((s1>=1)&&(l509>=1))) * E(((s1>=1)&&(l488>=1)) U ((s1>=1)&&...672
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t29, t51, t52, t53, t54, t56, t63, t64, t65, t66, t67, t68, t69, t7...331
Using saturation style SCC detection
(forward)formula 0,1,1.2138,38912,1,0,275,168911,218,134,2545,130206,310
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 77 transition count 95
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 77 transition count 94
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 67 transition count 84
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 67 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 67 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 64 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 64 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 62 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 60 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 60 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 59 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 83 place count 59 transition count 66
Applied a total of 83 rules in 5 ms. Remains 59 /97 variables (removed 38) and now considering 66/134 (removed 68) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12166016349191769928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16194210480333706821.kers'
[2026-05-23 15:43:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12166016349191769928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16194210480333706821.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 59 cols 218 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 15:43:46] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16194210480333706821.kers
Total runtime 1 ms.
[2026-05-23 15:43:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 15:43:46] [INFO ] Invariant cache hit.
[2026-05-23 15:43:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 15:43:46] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2026-05-23 15:43:46] [INFO ] Invariant cache hit.
[2026-05-23 15:43:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 65/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 146 constraints, problems are : Problem set: 0 solved, 65 unsolved in 6515 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8638ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 8639ms
Starting structural reductions in LTL mode, iteration 1 : 59/97 places, 66/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8874 ms. Remains : 59/97 places, 66/134 transitions.
[2026-05-23 15:43:54] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:43:54] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:43:54] [INFO ] Input system was already deterministic with 66 transitions.
[2026-05-23 15:43:54] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:43:54] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:43:54] [INFO ] Time to serialize gal into /tmp/CTLFireability35831948678203633.gal : 1 ms
[2026-05-23 15:43:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11411793645565539876.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/CTLFireability35831948678203633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11411793645565539876.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,3470,0.090788,6756,2,1545,5,11403,6,0,302,7612,0


Converting to forward existential form...Done !
original formula: EX(EX(AF(((p33>=1)&&(l0>=1)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(EG(!(((p33>=1)&&(l0>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t41, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...291
(forward)formula 0,0,0.67743,24436,1,0,208,100460,155,87,2030,76549,237
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-13 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 : 97/97 places, 134/134 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 77 transition count 95
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 77 transition count 94
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 68 transition count 85
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 63 transition count 73
Applied a total of 74 rules in 22 ms. Remains 63 /97 variables (removed 34) and now considering 73/134 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8138585640602042106.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4586315216198489176.kers'
[2026-05-23 15:43:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8138585640602042106.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4586315216198489176.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 63 cols 242 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 15:43:55] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4586315216198489176.kers
Total runtime 1 ms.
[2026-05-23 15:43:55] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 15:43:55] [INFO ] Invariant cache hit.
[2026-05-23 15:43:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 15:43:55] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2026-05-23 15:43:55] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2026-05-23 15:43:55] [INFO ] Invariant cache hit.
[2026-05-23 15:43:55] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 89 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/136 variables, 63/67 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 72/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 161 constraints, problems are : Problem set: 0 solved, 72 unsolved in 7332 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10442ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 10443ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/97 places, 73/134 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10726 ms. Remains : 63/97 places, 73/134 transitions.
[2026-05-23 15:44:06] [INFO ] Flatten gal took : 3 ms
[2026-05-23 15:44:06] [INFO ] Flatten gal took : 2 ms
[2026-05-23 15:44:06] [INFO ] Input system was already deterministic with 73 transitions.
[2026-05-23 15:44:06] [INFO ] Flatten gal took : 2 ms
[2026-05-23 15:44:06] [INFO ] Flatten gal took : 2 ms
[2026-05-23 15:44:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10088993953468939695.gal : 1 ms
[2026-05-23 15:44:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10586739666135830473.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/CTLFireability10088993953468939695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10586739666135830473.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,4900,0.186073,7584,2,1856,5,14011,6,0,325,9769,0


Converting to forward existential form...Done !
original formula: EF((AG(((s1<1)||(l124<1))) * ((s1<1)||(l489<1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((s1<1)||(l489<1))) * !(E(TRUE U !(((s1<1)||(l124<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t44, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
(forward)formula 0,1,0.831692,19516,1,0,168,63970,169,72,2228,38000,186
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 83 transition count 109
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 83 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 83 transition count 106
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 76 transition count 99
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 76 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 76 transition count 97
Applied a total of 47 rules in 2 ms. Remains 76 /97 variables (removed 21) and now considering 97/134 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5925683901893863809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3519667976360028089.kers'
[2026-05-23 15:44:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5925683901893863809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3519667976360028089.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 76 cols 312 entries
Finished phase 1 with 72 SingleSign rule and 2 generalized
[2026-05-23 15:44:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3519667976360028089.kers
Total runtime 1 ms.
[2026-05-23 15:44:07] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-23 15:44:07] [INFO ] Invariant cache hit.
[2026-05-23 15:44:07] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-23 15:44:07] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-23 15:44:07] [INFO ] Invariant cache hit.
[2026-05-23 15:44:07] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/173 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 34/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/173 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4622 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/173 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 34/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/173 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 12367 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17016ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 17017ms
Starting structural reductions in LTL mode, iteration 1 : 76/97 places, 97/134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17312 ms. Remains : 76/97 places, 97/134 transitions.
[2026-05-23 15:44:24] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:44:24] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:44:24] [INFO ] Input system was already deterministic with 97 transitions.
[2026-05-23 15:44:24] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:44:24] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:44:24] [INFO ] Time to serialize gal into /tmp/CTLFireability13244260721712321120.gal : 2 ms
[2026-05-23 15:44:24] [INFO ] Time to serialize properties into /tmp/CTLFireability17427564174168590841.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/CTLFireability13244260721712321120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17427564174168590841.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,7399,0.318053,9784,2,2265,5,23333,6,0,401,12899,0


Converting to forward existential form...Done !
original formula: ((!(A(AX(AG((((s6>=1)&&(l0>=1))||((p26>=1)&&(l0>=1))))) U ((s1>=1)&&(l91>=1)))) * E((EX((((p27>=1)&&(l0>=1))||(((s1>=1)&&(l502>=1))&&((s1...392
=> equivalent forward existential formula: [(((Init * (!(!((E(!(((s1>=1)&&(l91>=1))) U (!(!(EX(!(!(E(TRUE U !((((s6>=1)&&(l0>=1))||((p26>=1)&&(l0>=1)))))))...634
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t58, t61, t62, t63, t7...386
Using saturation style SCC detection
(forward)formula 0,0,2.19179,50812,1,0,421,244893,253,207,2860,170476,527
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-23 15:44:26] [INFO ] Flatten gal took : 4 ms
[2026-05-23 15:44:26] [INFO ] Flatten gal took : 3 ms
Total runtime 328784 ms.

BK_STOP 1779551066882

--------------------
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-d0m04"
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-d0m04, 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-177946993500082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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