Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.6K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 6 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 177K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CO4-PT-12-CTLFireability-2024-00
FORMULA_NAME CO4-PT-12-CTLFireability-2024-01
FORMULA_NAME CO4-PT-12-CTLFireability-2024-02
FORMULA_NAME CO4-PT-12-CTLFireability-2024-03
FORMULA_NAME CO4-PT-12-CTLFireability-2024-04
FORMULA_NAME CO4-PT-12-CTLFireability-2024-05
FORMULA_NAME CO4-PT-12-CTLFireability-2024-06
FORMULA_NAME CO4-PT-12-CTLFireability-2024-07
FORMULA_NAME CO4-PT-12-CTLFireability-2024-08
FORMULA_NAME CO4-PT-12-CTLFireability-2024-09
FORMULA_NAME CO4-PT-12-CTLFireability-2024-10
FORMULA_NAME CO4-PT-12-CTLFireability-2024-11
FORMULA_NAME CO4-PT-12-CTLFireability-2024-12
FORMULA_NAME CO4-PT-12-CTLFireability-2024-13
FORMULA_NAME CO4-PT-12-CTLFireability-2024-14
FORMULA_NAME CO4-PT-12-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779522857103

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 07:54:18] [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 07:54:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:54:18] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2026-05-23 07:54:18] [INFO ] Transformed 649 places.
[2026-05-23 07:54:18] [INFO ] Transformed 782 transitions.
[2026-05-23 07:54:18] [INFO ] Found NUPN structural information;
[2026-05-23 07:54:18] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 563/563 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 461 transition count 559
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 91 place count 390 transition count 486
Iterating global reduction 1 with 71 rules applied. Total rules applied 162 place count 390 transition count 486
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 206 place count 346 transition count 433
Iterating global reduction 1 with 44 rules applied. Total rules applied 250 place count 346 transition count 433
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 253 place count 346 transition count 430
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 271 place count 328 transition count 410
Iterating global reduction 2 with 18 rules applied. Total rules applied 289 place count 328 transition count 410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 290 place count 328 transition count 409
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 297 place count 321 transition count 402
Iterating global reduction 3 with 7 rules applied. Total rules applied 304 place count 321 transition count 402
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 306 place count 321 transition count 400
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 307 place count 320 transition count 399
Iterating global reduction 4 with 1 rules applied. Total rules applied 308 place count 320 transition count 399
Applied a total of 308 rules in 110 ms. Remains 320 /477 variables (removed 157) and now considering 399/563 (removed 164) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6348876316016863768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16053602936045380044.kers'
[2026-05-23 07:54:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6348876316016863768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16053602936045380044.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 320 cols 971 entries
Finished phase 1 with 314 SingleSign rule and 0 generalized
[2026-05-23 07:54:18] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16053602936045380044.kers
Total runtime 2 ms.
[2026-05-23 07:54:18] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-05-23 07:54:18] [INFO ] Invariant cache hit.
[2026-05-23 07:54:19] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2026-05-23 07:54:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (OVERLAPS) 1/320 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 5/11 constraints. Problems are: Problem set: 8 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 399/719 variables, 320/331 constraints. Problems are: Problem set: 8 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/719 variables, 0/331 constraints. Problems are: Problem set: 8 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 719/719 variables, and 331 constraints, problems are : Problem set: 8 solved, 390 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/320 variables, 6/6 constraints. Problems are: Problem set: 8 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 5/11 constraints. Problems are: Problem set: 8 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 1/12 constraints. Problems are: Problem set: 8 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 390 unsolved
At refinement iteration 5 (OVERLAPS) 399/719 variables, 320/332 constraints. Problems are: Problem set: 8 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/719 variables, 390/722 constraints. Problems are: Problem set: 8 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/719 variables, 1/723 constraints. Problems are: Problem set: 8 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 719/719 variables, and 723 constraints, problems are : Problem set: 8 solved, 390 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 390/398 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 8 solved, 390 unsolved
Search for dead transitions found 8 dead transitions in 60168ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 320/477 places, 391/563 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60840 ms. Remains : 320/477 places, 391/563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 391/391 transitions.
Applied a total of 0 rules in 4 ms. Remains 320 /320 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2098241799951121047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5232520925605880111.kers'
[2026-05-23 07:55:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2098241799951121047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5232520925605880111.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 391 rows 320 cols 923 entries
Finished phase 1 with 312 SingleSign rule and 1 generalized
[2026-05-23 07:55:19] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5232520925605880111.kers
Total runtime 2 ms.
[2026-05-23 07:55:19] [INFO ] Implicit Places using invariants in 93 ms returned [230]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 319/320 places, 391/391 transitions.
Applied a total of 0 rules in 5 ms. Remains 319 /319 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 319/320 places, 391/391 transitions.
Support contains 85 out of 319 places after structural reductions.
[2026-05-23 07:55:19] [INFO ] Flatten gal took : 56 ms
[2026-05-23 07:55:19] [INFO ] Flatten gal took : 31 ms
[2026-05-23 07:55:19] [INFO ] Input system was already deterministic with 391 transitions.
Support contains 75 out of 319 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (299 resets) in 2144 ms. (18 steps per ms) remains 45/60 properties
BEST_FIRST walk for 4004 steps (31 resets) in 59 ms. (66 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (27 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (29 resets) in 36 ms. (108 steps per ms) remains 43/45 properties
BEST_FIRST walk for 4002 steps (22 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 40/43 properties
BEST_FIRST walk for 4002 steps (27 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (27 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (25 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (27 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (29 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (23 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (25 resets) in 17 ms. (222 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 12 ms. (308 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4002 steps (28 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (30 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (25 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (29 resets) in 11 ms. (333 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (24 resets) in 11 ms. (333 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4002 steps (26 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (28 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (28 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (28 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (26 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (22 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (27 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (27 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (29 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17305425431851124850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16613009574093763713.kers'
[2026-05-23 07:55:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17305425431851124850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16613009574093763713.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 391 rows 319 cols 913 entries
Finished phase 1 with 313 SingleSign rule and 0 generalized
[2026-05-23 07:55:20] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16613009574093763713.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/81 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 159/240 variables, 81/87 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 246/486 variables, 108/195 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 169/655 variables, 92/287 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 47/702 variables, 32/319 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 0/319 constraints. Problems are: Problem set: 1 solved, 34 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 11 (OVERLAPS) 8/710 variables, 6/325 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/710 variables, 0/325 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 0/710 variables, 0/325 constraints. Problems are: Problem set: 2 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 710/710 variables, and 325 constraints, problems are : Problem set: 2 solved, 33 unsolved in 1925 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 319/319 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 156/235 variables, 79/85 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 5/90 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 247/482 variables, 108/198 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 28/226 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 0/226 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 169/651 variables, 92/318 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/651 variables, 0/318 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 47/698 variables, 32/350 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 0/350 constraints. Problems are: Problem set: 2 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 11/709 variables, 7/357 constraints. Problems are: Problem set: 2 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 709/710 variables, and 357 constraints, problems are : Problem set: 2 solved, 33 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 318/319 constraints, PredecessorRefiner: 33/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6954ms problems are : Problem set: 2 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 391/391 transitions.
Graph (trivial) has 241 edges and 319 vertex of which 3 / 319 are part of one of the 1 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 526 edges and 317 vertex of which 313 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 313 transition count 278
Reduce places removed 100 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 112 rules applied. Total rules applied 218 place count 213 transition count 266
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 230 place count 201 transition count 266
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 230 place count 201 transition count 249
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 264 place count 184 transition count 249
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 272 place count 176 transition count 241
Iterating global reduction 3 with 8 rules applied. Total rules applied 280 place count 176 transition count 241
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 281 place count 175 transition count 239
Iterating global reduction 3 with 1 rules applied. Total rules applied 282 place count 175 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 283 place count 175 transition count 238
Performed 36 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 355 place count 139 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 357 place count 139 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 358 place count 138 transition count 188
Iterating global reduction 5 with 1 rules applied. Total rules applied 359 place count 138 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 360 place count 137 transition count 187
Iterating global reduction 5 with 1 rules applied. Total rules applied 361 place count 137 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 362 place count 137 transition count 186
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 392 place count 122 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 393 place count 122 transition count 189
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 396 place count 119 transition count 183
Iterating global reduction 7 with 3 rules applied. Total rules applied 399 place count 119 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 407 place count 119 transition count 175
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 418 place count 119 transition count 164
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 432 place count 108 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 433 place count 108 transition count 160
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 443 place count 108 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 108 transition count 159
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 445 place count 108 transition count 159
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 446 place count 107 transition count 158
Applied a total of 446 rules in 89 ms. Remains 107 /319 variables (removed 212) and now considering 158/391 (removed 233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 107/319 places, 158/391 transitions.
RANDOM walk for 40000 steps (2954 resets) in 769 ms. (51 steps per ms) remains 12/33 properties
BEST_FIRST walk for 40004 steps (686 resets) in 97 ms. (408 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40003 steps (682 resets) in 42 ms. (930 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40001 steps (874 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (515 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (697 resets) in 37 ms. (1052 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (690 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
[2026-05-23 07:55:28] [INFO ] Flow matrix only has 150 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9513660682680319300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10465001538732967624.kers'
[2026-05-23 07:55:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9513660682680319300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10465001538732967624.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 107 cols 423 entries
Finished phase 1 with 101 SingleSign rule and 1 generalized
[2026-05-23 07:55:28] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10465001538732967624.kers
Total runtime 1 ms.
[2026-05-23 07:55:28] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 19/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 77/109 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 111/220 variables, 50/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 31/251 variables, 21/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/257 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/257 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 114 constraints, problems are : Problem set: 0 solved, 4 unsolved in 169 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 19/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 77/109 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 111/220 variables, 50/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 31/251 variables, 21/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 11 (OVERLAPS) 6/257 variables, 4/118 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/257 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 118 constraints, problems are : Problem set: 1 solved, 3 unsolved in 333 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 107/107 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 511ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 28 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 158/158 transitions.
Graph (complete) has 254 edges and 107 vertex of which 97 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 97 transition count 124
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 52 place count 77 transition count 124
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 52 place count 77 transition count 120
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 73 transition count 120
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 65 transition count 112
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 65 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 65 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 65 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 64 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 61 transition count 105
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 61 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 60 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 60 transition count 103
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 114 place count 47 transition count 90
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 129 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 15 rules applied. Total rules applied 129 place count 46 transition count 76
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 46 transition count 74
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 140 place count 37 transition count 63
Iterating global reduction 5 with 9 rules applied. Total rules applied 149 place count 37 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 153 place count 37 transition count 59
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 154 place count 36 transition count 57
Iterating global reduction 6 with 1 rules applied. Total rules applied 155 place count 36 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 156 place count 36 transition count 56
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 162 place count 33 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 168 place count 33 transition count 50
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 171 place count 30 transition count 47
Iterating global reduction 8 with 3 rules applied. Total rules applied 174 place count 30 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 176 place count 30 transition count 45
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 177 place count 29 transition count 43
Iterating global reduction 9 with 1 rules applied. Total rules applied 178 place count 29 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 179 place count 29 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 185 place count 29 transition count 36
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 186 place count 28 transition count 35
Iterating global reduction 10 with 1 rules applied. Total rules applied 187 place count 28 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 188 place count 28 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 190 place count 27 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 191 place count 27 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 192 place count 26 transition count 41
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 193 place count 26 transition count 41
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 194 place count 26 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 196 place count 24 transition count 38
Applied a total of 196 rules in 22 ms. Remains 24 /107 variables (removed 83) and now considering 38/158 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 24/107 places, 38/158 transitions.
RANDOM walk for 40000 steps (1608 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (280 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Probably explored full state space saw : 1248 states, properties seen :0
Probabilistic random walk after 4982 steps, saw 1248 distinct states, run finished after 18 ms. (steps per millisecond=276 ) properties seen :0
Explored full state space saw : 1248 states, properties seen :0
Exhaustive walk after 4982 steps, saw 1248 distinct states, run finished after 5 ms. (steps per millisecond=996 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
[2026-05-23 07:55:28] [INFO ] Flatten gal took : 16 ms
[2026-05-23 07:55:28] [INFO ] Flatten gal took : 15 ms
[2026-05-23 07:55:28] [INFO ] Input system was already deterministic with 391 transitions.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 529 edges and 319 vertex of which 311 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 391/391 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 287 transition count 359
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 287 transition count 359
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 287 transition count 357
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 86 place count 267 transition count 337
Iterating global reduction 1 with 20 rules applied. Total rules applied 106 place count 267 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 267 transition count 334
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 120 place count 256 transition count 323
Iterating global reduction 2 with 11 rules applied. Total rules applied 131 place count 256 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 256 transition count 322
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 140 place count 248 transition count 314
Iterating global reduction 3 with 8 rules applied. Total rules applied 148 place count 248 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 248 transition count 312
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 153 place count 245 transition count 309
Iterating global reduction 4 with 3 rules applied. Total rules applied 156 place count 245 transition count 309
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 158 place count 243 transition count 307
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 243 transition count 307
Applied a total of 160 rules in 36 ms. Remains 243 /319 variables (removed 76) and now considering 307/391 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7057313927936235383.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-30934390451158985.kers'
[2026-05-23 07:55:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7057313927936235383.kers, --Pflows, --basisKERS=/tmp/petrispot-output-30934390451158985.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 243 cols 724 entries
Finished phase 1 with 237 SingleSign rule and 0 generalized
[2026-05-23 07:55:28] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-30934390451158985.kers
Total runtime 6 ms.
[2026-05-23 07:55:28] [INFO ] Implicit Places using invariants in 65 ms returned [6, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 241/319 places, 307/391 transitions.
Applied a total of 0 rules in 4 ms. Remains 241 /241 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 241/319 places, 307/391 transitions.
[2026-05-23 07:55:28] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:55:28] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:55:29] [INFO ] Input system was already deterministic with 307 transitions.
[2026-05-23 07:55:29] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:55:29] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:55:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15143719956884390561.gal : 5 ms
[2026-05-23 07:55:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16766463405848871372.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15143719956884390561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16766463405848871372.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,2.42696e+07,0.194241,11848,2,3445,5,29754,6,0,1267,37131,0


Converting to forward existential form...Done !
original formula: ((AX(EG(EF((p343==0)))) * EG((EF((p413==0)) + (EF((p365==0)) * AF((p336==0)))))) + (AG(((p376==1) * AX(((p193==1)&&(p439==1))))) * EX((AX...186
=> equivalent forward existential formula: (([(FwdU((Init * !((!(EX(!(EG(E(TRUE U (p343==0)))))) * EG((E(TRUE U (p413==0)) + (E(TRUE U (p365==0)) * !(EG(!(...574
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55,...390
Detected timeout of ITS tools.
[2026-05-23 07:55:59] [INFO ] Flatten gal took : 31 ms
[2026-05-23 07:55:59] [INFO ] Applying decomposition
[2026-05-23 07:55:59] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14673801088187281882.txt' '-o' '/tmp/graph14673801088187281882.bin' '-w' '/tmp/graph14673801088187281882.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14673801088187281882.bin' '-l' '-1' '-v' '-w' '/tmp/graph14673801088187281882.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:55:59] [INFO ] Decomposing Gal with order
[2026-05-23 07:55:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:55:59] [INFO ] Removed a total of 96 redundant transitions.
[2026-05-23 07:55:59] [INFO ] Flatten gal took : 96 ms
[2026-05-23 07:55:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2026-05-23 07:55:59] [INFO ] Time to serialize gal into /tmp/CTLFireability4919208123131008401.gal : 7 ms
[2026-05-23 07:55:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7695351673281919896.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/CTLFireability4919208123131008401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7695351673281919896.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.42696e+07,0.076998,7164,359,67,5084,587,669,8070,74,2137,0


Converting to forward existential form...Done !
original formula: ((AX(EG(EF((i9.i1.u47.p343==0)))) * EG((EF((i10.i0.u63.p413==0)) + (EF((i9.i2.u54.p365==0)) * AF((i2.i2.u44.p336==0)))))) + (AG(((i8.u53....275
=> equivalent forward existential formula: (([(FwdU((Init * !((!(EX(!(EG(E(TRUE U (i9.i1.u47.p343==0)))))) * EG((E(TRUE U (i10.i0.u63.p413==0)) + (E(TRUE U...745
Reverse transition relation is NOT exact ! Due to transitions t0, t19, t74, t84, t130, t208, t210, t220, t256, t259, t278, t281, i5.i1.t186, i5.i1.u27.t187...698
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,4.15939,162388,1,0,299418,907,4119,599661,356,3322,273512
FORMULA CO4-PT-12-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 391/391 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 290 transition count 362
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 290 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 290 transition count 361
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 77 place count 272 transition count 343
Iterating global reduction 1 with 18 rules applied. Total rules applied 95 place count 272 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 272 transition count 341
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 106 place count 263 transition count 332
Iterating global reduction 2 with 9 rules applied. Total rules applied 115 place count 263 transition count 332
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 263 transition count 331
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 122 place count 257 transition count 325
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 257 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 129 place count 257 transition count 324
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 133 place count 253 transition count 320
Iterating global reduction 4 with 4 rules applied. Total rules applied 137 place count 253 transition count 320
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 252 transition count 319
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 252 transition count 319
Applied a total of 139 rules in 19 ms. Remains 252 /319 variables (removed 67) and now considering 319/391 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10385157436121973299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-966236238581129616.kers'
[2026-05-23 07:56:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10385157436121973299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-966236238581129616.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 319 rows 252 cols 753 entries
Finished phase 1 with 246 SingleSign rule and 0 generalized
[2026-05-23 07:56:03] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-966236238581129616.kers
Total runtime 1 ms.
[2026-05-23 07:56:03] [INFO ] Implicit Places using invariants in 64 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 251/319 places, 319/391 transitions.
Applied a total of 0 rules in 13 ms. Remains 251 /251 variables (removed 0) and now considering 319/319 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 251/319 places, 319/391 transitions.
[2026-05-23 07:56:03] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:56:03] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:56:03] [INFO ] Input system was already deterministic with 319 transitions.
[2026-05-23 07:56:03] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:56:03] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:56:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9511535883482442782.gal : 2 ms
[2026-05-23 07:56:03] [INFO ] Time to serialize properties into /tmp/CTLFireability2498141677884089880.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/CTLFireability9511535883482442782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2498141677884089880.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,2.87103e+07,0.181583,11332,2,2994,5,26625,6,0,1318,32838,0


Converting to forward existential form...Done !
original formula: EF(((EG((EG((p344==1)) + (p285==1))) * AF((p558!=1))) * ((EF((p483==0)) + (p393==1)) * ((p296==0) + ((AX((p218==0)) * (p428==1)) * ((p447...176
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (EG((EG((p344==1)) + (p285==1))) * !(EG(!((p558!=1)))))) * (E(TRUE U (p483==0)) + (p393==...375
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t13, t14, t15, t16, t17, t20, t25, t33, t42, t44, t45, t46, t47, t48, t51, t53,...407
Using saturation style SCC detection
(forward)formula 0,1,14.4337,501820,1,0,1717,2.98068e+06,681,833,8231,3.01679e+06,2170
FORMULA CO4-PT-12-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 391/391 transitions.
Graph (trivial) has 327 edges and 319 vertex of which 3 / 319 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 527 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 148 place count 308 transition count 233
Reduce places removed 146 places and 0 transitions.
Iterating post reduction 1 with 146 rules applied. Total rules applied 294 place count 162 transition count 233
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 294 place count 162 transition count 216
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 328 place count 145 transition count 216
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 339 place count 134 transition count 205
Iterating global reduction 2 with 11 rules applied. Total rules applied 350 place count 134 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 134 transition count 204
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 351 place count 134 transition count 202
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 355 place count 132 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 357 place count 130 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 359 place count 130 transition count 200
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 409 place count 105 transition count 175
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 11 rules applied. Total rules applied 420 place count 105 transition count 164
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 426 place count 101 transition count 162
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 429 place count 98 transition count 159
Iterating global reduction 5 with 3 rules applied. Total rules applied 432 place count 98 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 446 place count 98 transition count 145
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 5 with 7 rules applied. Total rules applied 453 place count 98 transition count 138
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 460 place count 91 transition count 138
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 460 place count 91 transition count 137
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 462 place count 90 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 464 place count 89 transition count 136
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 465 place count 89 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 466 place count 89 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 468 place count 87 transition count 133
Applied a total of 468 rules in 46 ms. Remains 87 /319 variables (removed 232) and now considering 133/391 (removed 258) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12727371767814974286.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15188212909565538403.kers'
[2026-05-23 07:56:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12727371767814974286.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15188212909565538403.kers]
Normalized transition count is 132 out of 133 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 132 rows 86 cols 306 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-23 07:56:18] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15188212909565538403.kers
Total runtime 0 ms.
[2026-05-23 07:56:18] [INFO ] Implicit Places using invariants in 41 ms returned [1, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 85/319 places, 133/391 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 83 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 83 transition count 131
Applied a total of 4 rules in 4 ms. Remains 83 /85 variables (removed 2) and now considering 131/133 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16822503059961856836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3351396676740416395.kers'
[2026-05-23 07:56:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16822503059961856836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3351396676740416395.kers]
Normalized transition count is 130 out of 131 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 83 cols 290 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-23 07:56:18] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3351396676740416395.kers
Total runtime 0 ms.
[2026-05-23 07:56:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 07:56:18] [INFO ] Invariant cache hit.
[2026-05-23 07:56:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:56:18] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 83/319 places, 131/391 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 191 ms. Remains : 83/319 places, 131/391 transitions.
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:56:18] [INFO ] Input system was already deterministic with 131 transitions.
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:56:18] [INFO ] Time to serialize gal into /tmp/CTLFireability16343979204449440034.gal : 1 ms
[2026-05-23 07:56:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17660443446920888279.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/CTLFireability16343979204449440034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17660443446920888279.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,138673,0.020745,4644,2,290,5,2444,6,0,453,1885,0


Converting to forward existential form...Done !
original formula: EG((p549==0))
=> equivalent forward existential formula: [FwdG(Init,(p549==0))] != FALSE
Hit Full ! (commute/partial/dont) 129/0/2
(forward)formula 0,1,0.07106,6896,1,0,8,15283,19,4,2137,6279,8
FORMULA CO4-PT-12-CTLFireability-2024-04 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 : 319/319 places, 391/391 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 287 transition count 359
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 287 transition count 359
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 287 transition count 357
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 86 place count 267 transition count 337
Iterating global reduction 1 with 20 rules applied. Total rules applied 106 place count 267 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 267 transition count 334
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 118 place count 258 transition count 325
Iterating global reduction 2 with 9 rules applied. Total rules applied 127 place count 258 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 258 transition count 324
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 135 place count 251 transition count 317
Iterating global reduction 3 with 7 rules applied. Total rules applied 142 place count 251 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 251 transition count 315
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 147 place count 248 transition count 312
Iterating global reduction 4 with 3 rules applied. Total rules applied 150 place count 248 transition count 312
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 246 transition count 310
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 246 transition count 310
Applied a total of 154 rules in 31 ms. Remains 246 /319 variables (removed 73) and now considering 310/391 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4360746912316504864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15755294391105316420.kers'
[2026-05-23 07:56:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4360746912316504864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15755294391105316420.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 246 cols 731 entries
Finished phase 1 with 240 SingleSign rule and 0 generalized
[2026-05-23 07:56:18] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15755294391105316420.kers
Total runtime 1 ms.
[2026-05-23 07:56:18] [INFO ] Implicit Places using invariants in 70 ms returned [6, 178]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 244/319 places, 310/391 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 244/319 places, 310/391 transitions.
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:56:18] [INFO ] Input system was already deterministic with 310 transitions.
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:56:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2320549716648688202.gal : 2 ms
[2026-05-23 07:56:18] [INFO ] Time to serialize properties into /tmp/CTLFireability724727069225300935.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/CTLFireability2320549716648688202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability724727069225300935.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,2.58738e+07,0.22917,13576,2,3622,5,35019,6,0,1282,45783,0


Converting to forward existential form...Done !
original formula: AG((EF((p619!=1)) + ((EX(TRUE) + EF((p392==0))) * ((p498==1) + A(((p478==1)||(p384==1)) U (p583==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((EX(TRUE) + E(TRUE U (p392==0))) * ((p498==1) + !((E(!((p583==1)) U (!(((p478==1)||(p384...238
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t13, t14, t15, t16, t17, t20, t26, t27, t35, t44, t46, t47, t48, t49, t50, t52,...402
(forward)formula 0,1,3.75283,133812,1,0,432,471222,641,266,7218,501668,633
FORMULA CO4-PT-12-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 391/391 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 286 transition count 358
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 286 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 286 transition count 356
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 90 place count 264 transition count 334
Iterating global reduction 1 with 22 rules applied. Total rules applied 112 place count 264 transition count 334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 115 place count 264 transition count 331
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 126 place count 253 transition count 320
Iterating global reduction 2 with 11 rules applied. Total rules applied 137 place count 253 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 253 transition count 319
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 146 place count 245 transition count 311
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 245 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 245 transition count 309
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 160 place count 241 transition count 305
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 241 transition count 305
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 166 place count 239 transition count 303
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 239 transition count 303
Applied a total of 168 rules in 18 ms. Remains 239 /319 variables (removed 80) and now considering 303/391 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13317609681903108978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4431859031311831204.kers'
[2026-05-23 07:56:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13317609681903108978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4431859031311831204.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 303 rows 239 cols 714 entries
Finished phase 1 with 233 SingleSign rule and 0 generalized
[2026-05-23 07:56:22] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4431859031311831204.kers
Total runtime 1 ms.
[2026-05-23 07:56:22] [INFO ] Implicit Places using invariants in 56 ms returned [6, 175]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/319 places, 303/391 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /237 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 237/319 places, 303/391 transitions.
[2026-05-23 07:56:22] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:56:22] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:56:22] [INFO ] Input system was already deterministic with 303 transitions.
[2026-05-23 07:56:22] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:56:22] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:56:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16634026644741479091.gal : 2 ms
[2026-05-23 07:56:22] [INFO ] Time to serialize properties into /tmp/CTLFireability8133117575171247200.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/CTLFireability16634026644741479091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8133117575171247200.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.36744e+07,0.173838,11300,2,3317,5,27881,6,0,1247,33189,0


Converting to forward existential form...Done !
original formula: EF((EF(EX((p233==0))) * ((AF(((p351!=1)||(p439!=1))) + AX((p395==0))) + EG((p364==0)))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * E(TRUE U EX((p233==0)))) * !(EG(!(((p351!=1)||(p439!=1))))))] != FALSE + [((FwdU(Init,TRU...292
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55,...390
(forward)formula 0,1,4.88474,179496,1,0,632,796576,635,343,7390,890079,897
FORMULA CO4-PT-12-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 391/391 transitions.
Graph (trivial) has 327 edges and 319 vertex of which 3 / 319 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 527 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 148 place count 308 transition count 233
Reduce places removed 146 places and 0 transitions.
Iterating post reduction 1 with 146 rules applied. Total rules applied 294 place count 162 transition count 233
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 294 place count 162 transition count 216
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 328 place count 145 transition count 216
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 339 place count 134 transition count 205
Iterating global reduction 2 with 11 rules applied. Total rules applied 350 place count 134 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 134 transition count 204
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 351 place count 134 transition count 202
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 355 place count 132 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 357 place count 130 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 359 place count 130 transition count 200
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 409 place count 105 transition count 175
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 13 rules applied. Total rules applied 422 place count 105 transition count 162
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 430 place count 100 transition count 159
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 433 place count 97 transition count 156
Iterating global reduction 5 with 3 rules applied. Total rules applied 436 place count 97 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 448 place count 97 transition count 144
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 5 rules applied. Total rules applied 453 place count 97 transition count 139
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 458 place count 92 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 458 place count 92 transition count 137
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 462 place count 90 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 464 place count 89 transition count 136
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 465 place count 89 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 466 place count 89 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 468 place count 87 transition count 133
Applied a total of 468 rules in 28 ms. Remains 87 /319 variables (removed 232) and now considering 133/391 (removed 258) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3676744249146234839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12498467288497401475.kers'
[2026-05-23 07:56:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3676744249146234839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12498467288497401475.kers]
Normalized transition count is 132 out of 133 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 132 rows 86 cols 306 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-23 07:56:27] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12498467288497401475.kers
Total runtime 0 ms.
[2026-05-23 07:56:27] [INFO ] Implicit Places using invariants in 36 ms returned [1, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 85/319 places, 133/391 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 83 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 83 transition count 131
Applied a total of 4 rules in 3 ms. Remains 83 /85 variables (removed 2) and now considering 131/133 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1720931230145074561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18390729218724078460.kers'
[2026-05-23 07:56:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1720931230145074561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18390729218724078460.kers]
Normalized transition count is 130 out of 131 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 83 cols 290 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-23 07:56:27] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18390729218724078460.kers
Total runtime 1 ms.
[2026-05-23 07:56:27] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 07:56:27] [INFO ] Invariant cache hit.
[2026-05-23 07:56:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:56:27] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 83/319 places, 131/391 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 168 ms. Remains : 83/319 places, 131/391 transitions.
[2026-05-23 07:56:27] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:56:27] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:56:27] [INFO ] Input system was already deterministic with 131 transitions.
[2026-05-23 07:56:27] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:56:27] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:56:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8263068041702568889.gal : 1 ms
[2026-05-23 07:56:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15516309667917598901.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/CTLFireability8263068041702568889.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15516309667917598901.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,138673,0.020445,4628,2,290,5,2443,6,0,453,1883,0


Converting to forward existential form...Done !
original formula: EF(EG((p572==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p572==0))] != FALSE
Hit Full ! (commute/partial/dont) 129/0/2
(forward)formula 0,1,0.061734,6604,1,0,8,14547,19,3,2137,5302,8
FORMULA CO4-PT-12-CTLFireability-2024-08 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 : 319/319 places, 391/391 transitions.
Graph (trivial) has 316 edges and 319 vertex of which 3 / 319 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 527 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 138 place count 308 transition count 243
Reduce places removed 136 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 141 rules applied. Total rules applied 279 place count 172 transition count 238
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 284 place count 167 transition count 238
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 284 place count 167 transition count 222
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 316 place count 151 transition count 222
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 327 place count 140 transition count 211
Iterating global reduction 3 with 11 rules applied. Total rules applied 338 place count 140 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 339 place count 140 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 339 place count 140 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 343 place count 138 transition count 208
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 345 place count 136 transition count 206
Iterating global reduction 4 with 2 rules applied. Total rules applied 347 place count 136 transition count 206
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 397 place count 111 transition count 181
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 11 rules applied. Total rules applied 408 place count 111 transition count 170
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 414 place count 107 transition count 168
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 417 place count 104 transition count 165
Iterating global reduction 6 with 3 rules applied. Total rules applied 420 place count 104 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 431 place count 104 transition count 154
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 5 rules applied. Total rules applied 436 place count 104 transition count 149
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 441 place count 99 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 443 place count 98 transition count 148
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 446 place count 98 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 448 place count 98 transition count 146
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 450 place count 96 transition count 144
Applied a total of 450 rules in 42 ms. Remains 96 /319 variables (removed 223) and now considering 144/391 (removed 247) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18337211937254736526.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7967954837157401312.kers'
[2026-05-23 07:56:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18337211937254736526.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7967954837157401312.kers]
Normalized transition count is 143 out of 144 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 143 rows 95 cols 328 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-23 07:56:28] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7967954837157401312.kers
Total runtime 0 ms.
[2026-05-23 07:56:28] [INFO ] Implicit Places using invariants in 160 ms returned [1, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 161 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 94/319 places, 144/391 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 92 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 92 transition count 142
Applied a total of 4 rules in 3 ms. Remains 92 /94 variables (removed 2) and now considering 142/144 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4768795283870235151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7326781088919986088.kers'
[2026-05-23 07:56:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4768795283870235151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7326781088919986088.kers]
Normalized transition count is 141 out of 142 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 92 cols 312 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-23 07:56:28] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7326781088919986088.kers
Total runtime 0 ms.
[2026-05-23 07:56:28] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-23 07:56:28] [INFO ] Invariant cache hit.
[2026-05-23 07:56:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:56:28] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 92/319 places, 142/391 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 334 ms. Remains : 92/319 places, 142/391 transitions.
[2026-05-23 07:56:28] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:56:28] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:56:28] [INFO ] Input system was already deterministic with 142 transitions.
[2026-05-23 07:56:28] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:56:28] [INFO ] Flatten gal took : 13 ms
[2026-05-23 07:56:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14765091991175023389.gal : 1 ms
[2026-05-23 07:56:28] [INFO ] Time to serialize properties into /tmp/CTLFireability4352273852253977225.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/CTLFireability14765091991175023389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4352273852253977225.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,205921,0.024119,4736,2,321,5,2684,6,0,500,2214,0


Converting to forward existential form...Done !
original formula: !(A(AF(AG((p393==1))) U ((!(EF((p463==1))) + E((p413!=1) U (p570==1))) * A((p344!=1) U AG((p235==1))))))
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,!(((!(E(TRUE U (p463==1))) + E((p413!=1) U (p570==1))) * !((E(!(!(E(TRUE U !((p235==1))))) ...1159
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t18, t20, t35, t51, t56, t84, Intersection with reachable at each step enabled. (de...200
(forward)formula 0,1,0.711352,37676,1,0,519,195992,319,313,3205,200772,726
FORMULA CO4-PT-12-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 391/391 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 287 transition count 359
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 287 transition count 359
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 287 transition count 357
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 86 place count 267 transition count 337
Iterating global reduction 1 with 20 rules applied. Total rules applied 106 place count 267 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 267 transition count 334
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 120 place count 256 transition count 323
Iterating global reduction 2 with 11 rules applied. Total rules applied 131 place count 256 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 256 transition count 322
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 140 place count 248 transition count 314
Iterating global reduction 3 with 8 rules applied. Total rules applied 148 place count 248 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 248 transition count 312
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 154 place count 244 transition count 308
Iterating global reduction 4 with 4 rules applied. Total rules applied 158 place count 244 transition count 308
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 160 place count 242 transition count 306
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 242 transition count 306
Applied a total of 162 rules in 24 ms. Remains 242 /319 variables (removed 77) and now considering 306/391 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10626118399236975825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18150925097488944709.kers'
[2026-05-23 07:56:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10626118399236975825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18150925097488944709.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 306 rows 242 cols 722 entries
Finished phase 1 with 236 SingleSign rule and 0 generalized
[2026-05-23 07:56:29] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18150925097488944709.kers
Total runtime 1 ms.
[2026-05-23 07:56:29] [INFO ] Implicit Places using invariants in 77 ms returned [6, 178]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/319 places, 306/391 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 240/319 places, 306/391 transitions.
[2026-05-23 07:56:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:56:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:56:29] [INFO ] Input system was already deterministic with 306 transitions.
[2026-05-23 07:56:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:56:29] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:56:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7773166318912353168.gal : 2 ms
[2026-05-23 07:56:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1001279524292425590.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/CTLFireability7773166318912353168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1001279524292425590.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,2.41208e+07,0.189835,11564,2,3366,5,29350,6,0,1262,34657,0


Converting to forward existential form...Done !
original formula: EF(((AF(EX((p382==0))) * (p304==1)) * EX(AG(((p420==0)&&(p542==0))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (!(EG(!(EX((p382==0))))) * (p304==1)))) * !(E(TRUE U !(((p420==0)&&(p542==0))))))] != FA...158
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55,...396
Using saturation style SCC detection
(forward)formula 0,1,5.9178,192788,1,0,486,857075,644,285,7894,937916,694
FORMULA CO4-PT-12-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 391/391 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 287 transition count 359
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 287 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 287 transition count 358
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 84 place count 268 transition count 339
Iterating global reduction 1 with 19 rules applied. Total rules applied 103 place count 268 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 106 place count 268 transition count 336
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 115 place count 259 transition count 327
Iterating global reduction 2 with 9 rules applied. Total rules applied 124 place count 259 transition count 327
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 131 place count 252 transition count 320
Iterating global reduction 2 with 7 rules applied. Total rules applied 138 place count 252 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 140 place count 252 transition count 318
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 249 transition count 315
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 249 transition count 315
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 148 place count 247 transition count 313
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 247 transition count 313
Applied a total of 150 rules in 17 ms. Remains 247 /319 variables (removed 72) and now considering 313/391 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3200815050344025255.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17597845437578471220.kers'
[2026-05-23 07:56:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3200815050344025255.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17597845437578471220.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 247 cols 736 entries
Finished phase 1 with 241 SingleSign rule and 0 generalized
[2026-05-23 07:56:35] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17597845437578471220.kers
Total runtime 1 ms.
[2026-05-23 07:56:35] [INFO ] Implicit Places using invariants in 61 ms returned [6, 180]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/319 places, 313/391 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 245/319 places, 313/391 transitions.
[2026-05-23 07:56:35] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:56:35] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:56:35] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-23 07:56:35] [INFO ] Flatten gal took : 15 ms
[2026-05-23 07:56:35] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:56:35] [INFO ] Time to serialize gal into /tmp/CTLFireability4532706883891593235.gal : 1 ms
[2026-05-23 07:56:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17440433216912788551.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/CTLFireability4532706883891593235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17440433216912788551.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.70576e+07,0.19139,11892,2,3417,5,28903,6,0,1289,36495,0


Converting to forward existential form...Done !
original formula: EF(((EX((p236==1)) + EX(((p137==1)&&(p439==1)))) + (EG((p409==0)) * AF((p549==0)))))
=> equivalent forward existential formula: (([(EY(FwdU(Init,TRUE)) * (p236==1))] != FALSE + [(EY(FwdU(Init,TRUE)) * ((p137==1)&&(p439==1)))] != FALSE) + [(...222
(forward)formula 0,1,0.256083,12120,1,0,8,30071,8,1,2091,36495,2
FORMULA CO4-PT-12-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 391/391 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 286 transition count 358
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 286 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 286 transition count 356
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 87 place count 267 transition count 337
Iterating global reduction 1 with 19 rules applied. Total rules applied 106 place count 267 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 108 place count 267 transition count 335
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 119 place count 256 transition count 324
Iterating global reduction 2 with 11 rules applied. Total rules applied 130 place count 256 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 131 place count 256 transition count 323
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 139 place count 248 transition count 315
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 248 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 248 transition count 313
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 153 place count 244 transition count 309
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 244 transition count 309
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 159 place count 242 transition count 307
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 242 transition count 307
Applied a total of 161 rules in 23 ms. Remains 242 /319 variables (removed 77) and now considering 307/391 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18116518334732114686.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15890593577259831278.kers'
[2026-05-23 07:56:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18116518334732114686.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15890593577259831278.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 242 cols 722 entries
Finished phase 1 with 236 SingleSign rule and 0 generalized
[2026-05-23 07:56:35] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15890593577259831278.kers
Total runtime 1 ms.
[2026-05-23 07:56:35] [INFO ] Implicit Places using invariants in 52 ms returned [6, 176]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/319 places, 307/391 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 240/319 places, 307/391 transitions.
[2026-05-23 07:56:35] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:56:35] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:56:35] [INFO ] Input system was already deterministic with 307 transitions.
[2026-05-23 07:56:35] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:56:35] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:56:35] [INFO ] Time to serialize gal into /tmp/CTLFireability4383627248692875786.gal : 1 ms
[2026-05-23 07:56:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8456419141875995958.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/CTLFireability4383627248692875786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8456419141875995958.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,2.55399e+07,0.178747,11436,2,3474,5,28462,6,0,1263,34102,0


Converting to forward existential form...Done !
original formula: (AF(EG((p406==1))) * (AF((((p347!=1)||(p470!=1)) * A((p272==1) U (p333==1)))) + (E(!(EG(AG((p181==1)))) U EG((p321==1))) * AX(EX((p332==0...161
=> equivalent forward existential formula: ([FwdG(Init,!(EG((p406==1))))] = FALSE * ([((Init * !(!(EG(!((((p347!=1)||(p470!=1)) * !((E(!((p333==1)) U (!((p...434
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t11, t12, t13, t14, t15, t16, t17, t20, t25, t33, t42, t44, t45, t46, t47, t48, t50, ...399
Detected timeout of ITS tools.
[2026-05-23 07:57:05] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:57:05] [INFO ] Applying decomposition
[2026-05-23 07:57:05] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16472565042024622045.txt' '-o' '/tmp/graph16472565042024622045.bin' '-w' '/tmp/graph16472565042024622045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16472565042024622045.bin' '-l' '-1' '-v' '-w' '/tmp/graph16472565042024622045.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:57:05] [INFO ] Decomposing Gal with order
[2026-05-23 07:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:57:05] [INFO ] Removed a total of 104 redundant transitions.
[2026-05-23 07:57:05] [INFO ] Flatten gal took : 19 ms
[2026-05-23 07:57:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2026-05-23 07:57:05] [INFO ] Time to serialize gal into /tmp/CTLFireability5013213149505669514.gal : 4 ms
[2026-05-23 07:57:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16777737143892186172.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/CTLFireability5013213149505669514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16777737143892186172.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.55399e+07,0.089698,7468,354,63,5884,586,691,9279,79,2285,0


Converting to forward existential form...Done !
original formula: (AF(EG((i6.i0.u50.p406==1))) * (AF((((i6.i0.u51.p347!=1)||(i12.i1.u71.p470!=1)) * A((i3.i1.u32.p272==1) U (i1.i0.u21.p333==1)))) + (E(!(E...242
=> equivalent forward existential formula: ([FwdG(Init,!(EG((i6.i0.u50.p406==1))))] = FALSE * ([((Init * !(!(EG(!((((i6.i0.u51.p347!=1)||(i12.i1.u71.p470!=...596
Reverse transition relation is NOT exact ! Due to transitions t20, t44, t75, t88, t187, t209, t250, t257, t260, t282, i1.t211, i1.i3.u30.t0, i3.i1.u32.t188...697
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,6.93592,228924,1,0,435141,1035,4459,899027,382,4254,451006
FORMULA CO4-PT-12-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 391/391 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 285 transition count 357
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 285 transition count 357
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 70 place count 285 transition count 355
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 91 place count 264 transition count 334
Iterating global reduction 1 with 21 rules applied. Total rules applied 112 place count 264 transition count 334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 115 place count 264 transition count 331
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 126 place count 253 transition count 320
Iterating global reduction 2 with 11 rules applied. Total rules applied 137 place count 253 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 253 transition count 319
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 146 place count 245 transition count 311
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 245 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 245 transition count 309
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 160 place count 241 transition count 305
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 241 transition count 305
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 166 place count 239 transition count 303
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 239 transition count 303
Applied a total of 168 rules in 36 ms. Remains 239 /319 variables (removed 80) and now considering 303/391 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14137650197381729479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11124348270352116969.kers'
[2026-05-23 07:57:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14137650197381729479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11124348270352116969.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 303 rows 239 cols 714 entries
Finished phase 1 with 233 SingleSign rule and 0 generalized
[2026-05-23 07:57:13] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11124348270352116969.kers
Total runtime 1 ms.
[2026-05-23 07:57:13] [INFO ] Implicit Places using invariants in 70 ms returned [6, 175]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 237/319 places, 303/391 transitions.
Applied a total of 0 rules in 2 ms. Remains 237 /237 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 237/319 places, 303/391 transitions.
[2026-05-23 07:57:13] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:57:13] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:57:13] [INFO ] Input system was already deterministic with 303 transitions.
[2026-05-23 07:57:13] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:57:13] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:57:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17245155405053911108.gal : 1 ms
[2026-05-23 07:57:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12663780475057717416.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/CTLFireability17245155405053911108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12663780475057717416.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,2.52661e+07,0.226501,13392,2,4435,5,34333,6,0,1247,47498,0


Converting to forward existential form...Done !
original formula: EG(AX((p440==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((p440==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t20, t24, t32, t41, t43, t44, t45, t46, t47, t49,...446
(forward)formula 0,0,4.94628,160416,1,0,538,547913,629,315,7028,715984,693
FORMULA CO4-PT-12-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 319/319 places, 391/391 transitions.
Graph (trivial) has 309 edges and 319 vertex of which 3 / 319 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 527 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 308 transition count 248
Reduce places removed 131 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 136 rules applied. Total rules applied 269 place count 177 transition count 243
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 274 place count 172 transition count 243
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 274 place count 172 transition count 226
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 308 place count 155 transition count 226
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 318 place count 145 transition count 216
Iterating global reduction 3 with 10 rules applied. Total rules applied 328 place count 145 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 329 place count 145 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 329 place count 145 transition count 213
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 333 place count 143 transition count 213
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 335 place count 141 transition count 211
Iterating global reduction 4 with 2 rules applied. Total rules applied 337 place count 141 transition count 211
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 387 place count 116 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 12 rules applied. Total rules applied 399 place count 116 transition count 174
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 7 rules applied. Total rules applied 406 place count 112 transition count 171
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 408 place count 111 transition count 170
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 410 place count 109 transition count 168
Iterating global reduction 7 with 2 rules applied. Total rules applied 412 place count 109 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 424 place count 109 transition count 156
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 429 place count 109 transition count 151
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 6 rules applied. Total rules applied 435 place count 104 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 436 place count 103 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 436 place count 103 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 438 place count 102 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 440 place count 101 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 441 place count 101 transition count 147
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 442 place count 101 transition count 147
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 444 place count 99 transition count 145
Applied a total of 444 rules in 33 ms. Remains 99 /319 variables (removed 220) and now considering 145/391 (removed 246) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16552746358441488880.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2032129794917995155.kers'
[2026-05-23 07:57:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16552746358441488880.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2032129794917995155.kers]
Normalized transition count is 144 out of 145 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 144 rows 98 cols 330 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-23 07:57:18] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2032129794917995155.kers
Total runtime 0 ms.
[2026-05-23 07:57:18] [INFO ] Implicit Places using invariants in 87 ms returned [1, 72]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 90 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 97/319 places, 145/391 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 95 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 95 transition count 143
Applied a total of 4 rules in 3 ms. Remains 95 /97 variables (removed 2) and now considering 143/145 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11546567676504813885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11009600190645418680.kers'
[2026-05-23 07:57:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11546567676504813885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11009600190645418680.kers]
Normalized transition count is 142 out of 143 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 95 cols 314 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-23 07:57:18] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11009600190645418680.kers
Total runtime 5 ms.
[2026-05-23 07:57:18] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 07:57:18] [INFO ] Invariant cache hit.
[2026-05-23 07:57:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:57:18] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 95/319 places, 143/391 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 269 ms. Remains : 95/319 places, 143/391 transitions.
[2026-05-23 07:57:18] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:57:18] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:57:18] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-23 07:57:18] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:57:18] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:57:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10637498166416076382.gal : 1 ms
[2026-05-23 07:57:18] [INFO ] Time to serialize properties into /tmp/CTLFireability2375849311887437607.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/CTLFireability10637498166416076382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2375849311887437607.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,157585,0.02532,4796,2,335,5,2969,6,0,513,2528,0


Converting to forward existential form...Done !
original formula: E((((p498!=1) * AF(AG((p143==1)))) + (AF((p387!=1)) * !(EG((p184==1))))) U EG(((AG((p308==1)) * (p485==1)) * ((p405==1)||(p140==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(((p498!=1) * !(EG(!(!(E(TRUE U !((p143==1)))))))) + (!(EG(!((p387!=1)))) * !(EG((p184==1)))))),...232
Reverse transition relation is NOT exact ! Due to transitions t9, t15, t17, t29, t45, t50, t81, t137, Intersection with reachable at each step enabled. (d...201
(forward)formula 0,0,0.703546,36644,1,0,506,179241,334,328,3155,202843,769
FORMULA CO4-PT-12-CTLFireability-2024-14 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 : 319/319 places, 391/391 transitions.
Graph (trivial) has 316 edges and 319 vertex of which 3 / 319 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 527 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 308 transition count 240
Reduce places removed 139 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 144 rules applied. Total rules applied 285 place count 169 transition count 235
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 290 place count 164 transition count 235
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 290 place count 164 transition count 217
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 326 place count 146 transition count 217
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 337 place count 135 transition count 206
Iterating global reduction 3 with 11 rules applied. Total rules applied 348 place count 135 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 349 place count 135 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 349 place count 135 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 351 place count 134 transition count 204
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 353 place count 132 transition count 202
Iterating global reduction 4 with 2 rules applied. Total rules applied 355 place count 132 transition count 202
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 403 place count 108 transition count 178
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 13 rules applied. Total rules applied 416 place count 108 transition count 165
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 424 place count 103 transition count 162
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 427 place count 100 transition count 159
Iterating global reduction 6 with 3 rules applied. Total rules applied 430 place count 100 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 444 place count 100 transition count 145
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 7 rules applied. Total rules applied 451 place count 100 transition count 138
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 458 place count 93 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 458 place count 93 transition count 136
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 462 place count 91 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 464 place count 90 transition count 135
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 467 place count 90 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 469 place count 88 transition count 133
Applied a total of 469 rules in 24 ms. Remains 88 /319 variables (removed 231) and now considering 133/391 (removed 258) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9689940878891304126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6777486696638409320.kers'
[2026-05-23 07:57:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9689940878891304126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6777486696638409320.kers]
Normalized transition count is 132 out of 133 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 132 rows 87 cols 346 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-23 07:57:19] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6777486696638409320.kers
Total runtime 1 ms.
[2026-05-23 07:57:19] [INFO ] Implicit Places using invariants in 208 ms returned [1, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 228 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 86/319 places, 133/391 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 84 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 131
Applied a total of 4 rules in 2 ms. Remains 84 /86 variables (removed 2) and now considering 131/133 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6740598497287618457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7178705660536305616.kers'
[2026-05-23 07:57:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6740598497287618457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7178705660536305616.kers]
Normalized transition count is 130 out of 131 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 84 cols 330 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-23 07:57:19] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7178705660536305616.kers
Total runtime 0 ms.
[2026-05-23 07:57:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-23 07:57:19] [INFO ] Invariant cache hit.
[2026-05-23 07:57:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:57:19] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 84/319 places, 131/391 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 431 ms. Remains : 84/319 places, 131/391 transitions.
[2026-05-23 07:57:19] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:57:19] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:57:19] [INFO ] Input system was already deterministic with 131 transitions.
[2026-05-23 07:57:19] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:57:19] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:57:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17004581994660861989.gal : 1 ms
[2026-05-23 07:57:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17040344101770650292.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/CTLFireability17004581994660861989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17040344101770650292.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,145921,0.021845,4668,2,282,5,2430,6,0,457,1873,0


Converting to forward existential form...Done !
original formula: AF(((AG((p334==1)) + ((p331==1)&&(p439==1))) + ((p372==1) * EF((p294==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((p334==1)))) + ((p331==1)&&(p439==1))) + ((p372==1) * E(TRUE U (p294==1))))))] = FAL...157
Reverse transition relation is NOT exact ! Due to transitions t9, t15, t28, t41, t46, t85, t121, t123, Intersection with reachable at each step enabled. (...202
(forward)formula 0,0,0.323571,19400,1,0,237,76340,292,155,2935,94666,341
FORMULA CO4-PT-12-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 07:57:19] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:57:19] [INFO ] Flatten gal took : 7 ms
Total runtime 181687 ms.

BK_STOP 1779523039985

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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