MCC'2026- Execution of r130-smll-177955809000186

About the Execution of ITS-Tools for FireWire-PT-06

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2780.443	860895.00	970199.00	2878.30	TFFFTTFTTFFFTTFT	normal

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.r130-smll-177955809000186.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 FireWire-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.0K Mar 7 05:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 7 05:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 05:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 05:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Mar 7 05:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 7 05:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 05:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 05:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:05 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 90K 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 FireWire-PT-06-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779800035313

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-26 12:53:57] [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-26 12:53:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 12:53:58] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2026-05-26 12:53:58] [INFO ] Transformed 116 places.
[2026-05-26 12:53:58] [INFO ] Transformed 368 transitions.
[2026-05-26 12:53:58] [INFO ] Found NUPN structural information;
[2026-05-26 12:53:58] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Support contains 69 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 312/312 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 116 transition count 306
Applied a total of 6 rules in 54 ms. Remains 116 /116 variables (removed 0) and now considering 306/312 (removed 6) transitions.
[2026-05-26 12:53:58] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4799674757557413501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18101196284063636891.kers'
[2026-05-26 12:53:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4799674757557413501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18101196284063636891.kers]
Normalized transition count is 279 out of 280 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 116 cols 936 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-26 12:53:58] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18101196284063636891.kers
Total runtime 4 ms.
[2026-05-26 12:53:59] [INFO ] Implicit Places using invariants in 596 ms returned []
[2026-05-26 12:53:59] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 12:53:59] [INFO ] Invariant cache hit.
[2026-05-26 12:53:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 12:53:59] [INFO ] Implicit Places using invariants and state equation in 678 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1347 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/116 places, 306/312 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1441 ms. Remains : 115/116 places, 306/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Applied a total of 0 rules in 24 ms. Remains 115 /115 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2026-05-26 12:53:59] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11074684059947805663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5743215602142941762.kers'
[2026-05-26 12:53:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11074684059947805663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5743215602142941762.kers]
Normalized transition count is 279 out of 280 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 115 cols 933 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-26 12:53:59] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5743215602142941762.kers
Total runtime 3 ms.
[2026-05-26 12:54:00] [INFO ] Implicit Places using invariants in 197 ms returned []
[2026-05-26 12:54:00] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 12:54:00] [INFO ] Invariant cache hit.
[2026-05-26 12:54:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 12:54:00] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2026-05-26 12:54:00] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 12:54:00] [INFO ] Invariant cache hit.
[2026-05-26 12:54:00] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 7/130 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 279/394 variables, 115/245 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 40/285 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 1/395 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 395/395 variables, and 286 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30039 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 7/130 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 279/394 variables, 115/245 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 40/285 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 305/590 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/395 variables, and 592 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30024 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60596ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60624ms
Finished structural reductions in LTL mode , in 1 iterations and 61330 ms. Remains : 115/115 places, 306/306 transitions.
Support contains 69 out of 115 places after structural reductions.
[2026-05-26 12:55:01] [INFO ] Flatten gal took : 85 ms
[2026-05-26 12:55:01] [INFO ] Flatten gal took : 54 ms
[2026-05-26 12:55:01] [INFO ] Input system was already deterministic with 306 transitions.
Reduction of identical properties reduced properties to check from 70 to 68
RANDOM walk for 40000 steps (1964 resets) in 3524 ms. (11 steps per ms) remains 36/68 properties
BEST_FIRST walk for 4004 steps (37 resets) in 39 ms. (100 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (14 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (55 resets) in 53 ms. (74 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 72 ms. (54 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (56 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (52 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (85 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (46 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (53 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (52 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (51 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (21 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (50 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (81 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (33 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (45 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (42 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (19 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (46 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (13 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (53 resets) in 22 ms. (174 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4004 steps (10 resets) in 43 ms. (91 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (61 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
[2026-05-26 12:55:03] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 12:55:03] [INFO ] Invariant cache hit.
[2026-05-26 12:55:03] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 2 (OVERLAPS) 64/105 variables, 5/46 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 64/110 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/112 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/112 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 9/114 variables, 3/115 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 9/124 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 2/126 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/126 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 279/393 variables, 114/240 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 40/280 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/280 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 1/394 variables, 1/281 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 1/282 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 0/282 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 16 (OVERLAPS) 1/395 variables, 1/283 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/395 variables, 0/283 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 0/395 variables, 0/283 constraints. Problems are: Problem set: 9 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 283 constraints, problems are : Problem set: 9 solved, 23 unsolved in 3849 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 76/105 variables, 5/34 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 76/110 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/112 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/112 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 9/114 variables, 3/115 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 9/124 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 2/126 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 1/127 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/127 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 279/393 variables, 114/241 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 40/281 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/393 variables, 21/302 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/393 variables, 1/303 constraints. Problems are: Problem set: 9 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/393 variables, 0/303 constraints. Problems are: Problem set: 9 solved, 23 unsolved
SMT process timed out in 8919ms, After SMT, problems are : Problem set: 9 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 306/306 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 115 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 114 transition count 302
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 112 transition count 300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 110 transition count 304
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 110 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 110 transition count 296
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 110 transition count 297
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 108 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 108 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 108 transition count 293
Applied a total of 31 rules in 166 ms. Remains 108 /115 variables (removed 7) and now considering 293/306 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 108/115 places, 293/306 transitions.
RANDOM walk for 40000 steps (2234 resets) in 961 ms. (41 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (75 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (55 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (48 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (99 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (44 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (45 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (42 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (62 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (53 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4002 steps (46 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (50 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (49 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 391815 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :9 out of 21
Probabilistic random walk after 391815 steps, saw 85276 distinct states, run finished after 3012 ms. (steps per millisecond=130 ) properties seen :9
[2026-05-26 12:55:15] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3455579866859987799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17397537542782047940.kers'
[2026-05-26 12:55:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3455579866859987799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17397537542782047940.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 267 rows 107 cols 907 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 12:55:15] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17397537542782047940.kers
Total runtime 2 ms.
[2026-05-26 12:55:15] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 81/100 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 81/105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 7/107 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 267/374 variables, 107/222 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 41/263 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/375 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/375 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/375 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 265 constraints, problems are : Problem set: 0 solved, 12 unsolved in 825 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 81/100 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 81/105 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 7/107 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 267/374 variables, 107/224 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 41/265 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 10/275 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 1/375 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/375 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/375 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/375 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 279 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4345 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5192ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 10794 ms.
Support contains 19 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 293/293 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 291
Applied a total of 2 rules in 17 ms. Remains 107 /108 variables (removed 1) and now considering 291/293 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 107/108 places, 291/293 transitions.
RANDOM walk for 40000 steps (2165 resets) in 297 ms. (134 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (539 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (13 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (572 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (36 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (588 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (552 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (19 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (571 resets) in 54 ms. (727 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (72 resets) in 46 ms. (851 steps per ms) remains 9/12 properties
[2026-05-26 12:55:32] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2501115255326284919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12834662764700312720.kers'
[2026-05-26 12:55:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2501115255326284919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12834662764700312720.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 265 rows 106 cols 903 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 12:55:32] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12834662764700312720.kers
Total runtime 2 ms.
[2026-05-26 12:55:32] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 82/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 7/106 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 265/371 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 41/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/372 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 156 constraints, problems are : Problem set: 0 solved, 9 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 82/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 7/106 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 265/371 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 41/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/372 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/372 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 167 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2438 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3082ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 5078 ms.
Support contains 17 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 291/291 transitions.
Applied a total of 0 rules in 10 ms. Remains 107 /107 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 107/107 places, 291/291 transitions.
RANDOM walk for 40000 steps (2179 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (626 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (579 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (547 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (570 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (18 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (539 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (42 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 453985 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 9
Probabilistic random walk after 453985 steps, saw 99910 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2026-05-26 12:55:44] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2026-05-26 12:55:44] [INFO ] Invariant cache hit.
[2026-05-26 12:55:44] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 82/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 7/106 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 265/371 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 41/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/372 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 156 constraints, problems are : Problem set: 0 solved, 9 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 82/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 7/106 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 265/371 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 41/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/372 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/372 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 167 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1948 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2456ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 5131 ms.
Support contains 17 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 291/291 transitions.
Applied a total of 0 rules in 10 ms. Remains 107 /107 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 107/107 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 291/291 transitions.
Applied a total of 0 rules in 10 ms. Remains 107 /107 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2026-05-26 12:55:51] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2026-05-26 12:55:51] [INFO ] Invariant cache hit.
[2026-05-26 12:55:51] [INFO ] Implicit Places using invariants in 109 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/107 places, 291/291 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 106 transition count 290
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 290
Applied a total of 2 rules in 13 ms. Remains 105 /106 variables (removed 1) and now considering 290/291 (removed 1) transitions.
[2026-05-26 12:55:51] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1480776414843716052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4381247942410419163.kers'
[2026-05-26 12:55:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1480776414843716052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4381247942410419163.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 105 cols 901 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 12:55:51] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4381247942410419163.kers
Total runtime 1 ms.
[2026-05-26 12:55:51] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-26 12:55:51] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 12:55:51] [INFO ] Invariant cache hit.
[2026-05-26 12:55:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 12:55:52] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 337 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 104/107 places, 290/291 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 289
Applied a total of 2 rules in 18 ms. Remains 103 /104 variables (removed 1) and now considering 289/290 (removed 1) transitions.
[2026-05-26 12:55:52] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12714987554643486108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12201145229298253158.kers'
[2026-05-26 12:55:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12714987554643486108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12201145229298253158.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 103 cols 897 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-26 12:55:52] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12201145229298253158.kers
Total runtime 2 ms.
[2026-05-26 12:55:52] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-26 12:55:52] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
[2026-05-26 12:55:52] [INFO ] Invariant cache hit.
[2026-05-26 12:55:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 12:55:52] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 103/107 places, 289/291 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 937 ms. Remains : 103/107 places, 289/291 transitions.
RANDOM walk for 40000 steps (2247 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (563 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (619 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (598 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (572 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 40 ms. (975 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (625 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (65 resets) in 66 ms. (597 steps per ms) remains 6/9 properties
[2026-05-26 12:55:52] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
[2026-05-26 12:55:52] [INFO ] Invariant cache hit.
[2026-05-26 12:55:52] [INFO ] State equation strengthened by 40 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 64/77 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 24/101 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 263/364 variables, 101/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/366 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 149 constraints, problems are : Problem set: 0 solved, 6 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 64/77 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 24/101 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 263/364 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/366 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 157 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2142ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2025 ms.
Support contains 13 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 289/289 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 288
Applied a total of 1 rules in 15 ms. Remains 102 /103 variables (removed 1) and now considering 288/289 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 102/103 places, 288/289 transitions.
RANDOM walk for 40000 steps (2396 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (620 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (687 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (608 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (570 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (657 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (66 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 919016 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :4 out of 6
Probabilistic random walk after 919016 steps, saw 188551 distinct states, run finished after 3002 ms. (steps per millisecond=306 ) properties seen :4
[2026-05-26 12:56:00] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13370601567377293713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8644175210810395355.kers'
[2026-05-26 12:56:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13370601567377293713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8644175210810395355.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 262 rows 102 cols 888 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-26 12:56:00] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8644175210810395355.kers
Total runtime 1 ms.
[2026-05-26 12:56:00] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 216/271 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 93/364 variables, 47/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 22/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/364 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 216/271 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 93/364 variables, 47/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 22/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/364 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 288/288 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 293
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 101 transition count 290
Applied a total of 5 rules in 19 ms. Remains 101 /102 variables (removed 1) and now considering 290/288 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 101/102 places, 290/288 transitions.
RANDOM walk for 40000 steps (2502 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (582 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (612 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1062305 steps, run visited all 2 properties in 2363 ms. (steps per millisecond=449 )
Probabilistic random walk after 1062305 steps, saw 207773 distinct states, run finished after 2368 ms. (steps per millisecond=448 ) properties seen :2
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2026-05-26 12:56:03] [INFO ] Flatten gal took : 25 ms
[2026-05-26 12:56:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-06-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 12:56:03] [INFO ] Flatten gal took : 25 ms
[2026-05-26 12:56:03] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 62 out of 115 places (down from 63) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 302
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 0 with 2 rules applied. Total rules applied 6 place count 111 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 111 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 110 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 109 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 109 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 108 transition count 297
Applied a total of 12 rules in 40 ms. Remains 108 /115 variables (removed 7) and now considering 297/306 (removed 9) transitions.
[2026-05-26 12:56:03] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12377566511133422041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13339530159431264382.kers'
[2026-05-26 12:56:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12377566511133422041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13339530159431264382.kers]
Normalized transition count is 271 out of 272 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 271 rows 107 cols 906 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-26 12:56:03] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13339530159431264382.kers
Total runtime 2 ms.
[2026-05-26 12:56:03] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-26 12:56:03] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2026-05-26 12:56:03] [INFO ] Invariant cache hit.
[2026-05-26 12:56:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 12:56:03] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 398 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 107/115 places, 297/306 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 446 ms. Remains : 107/115 places, 297/306 transitions.
[2026-05-26 12:56:03] [INFO ] Flatten gal took : 20 ms
[2026-05-26 12:56:03] [INFO ] Flatten gal took : 20 ms
[2026-05-26 12:56:03] [INFO ] Input system was already deterministic with 297 transitions.
[2026-05-26 12:56:03] [INFO ] Flatten gal took : 27 ms
[2026-05-26 12:56:04] [INFO ] Flatten gal took : 18 ms
RANDOM walk for 40000 steps (2437 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
[2026-05-26 12:56:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1389352964852671729.gal : 15 ms
BEST_FIRST walk for 40004 steps (14 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2026-05-26 12:56:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11395975426735769512.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1389352964852671729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11395975426735769512.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11395975426735769512.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23 after 494
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :494 after 923
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :923 after 1969
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1969 after 7747
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7747 after 24563
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :538206 after 556169
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.1337e+06,1.29101,35956,2,2756,17,84080,7,0,741,96587,0
Total reachable state count : 3133703

Verifying 1 reachability properties.
Reachability property FireWire-PT-06-CTLFireability-2024-00 is true.
FORMULA FireWire-PT-06-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-06-CTLFireability-2024-00,35,1.29275,35956,2,145,17,84080,7,0,749,96587,0
Interrupted probabilistic random walk after 1353894 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :0 out of 1
Probabilistic random walk after 1353894 steps, saw 254954 distinct states, run finished after 3001 ms. (steps per millisecond=451 ) properties seen :0
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 305
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 111 transition count 299
Applied a total of 10 rules in 41 ms. Remains 111 /115 variables (removed 4) and now considering 299/306 (removed 7) transitions.
[2026-05-26 12:56:07] [INFO ] Flow matrix only has 274 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8444957595451897996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10779546462862642665.kers'
[2026-05-26 12:56:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8444957595451897996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10779546462862642665.kers]
Normalized transition count is 273 out of 274 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 273 rows 110 cols 920 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-26 12:56:07] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10779546462862642665.kers
Total runtime 3 ms.
[2026-05-26 12:56:07] [INFO ] Implicit Places using invariants in 135 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/115 places, 299/306 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 110 transition count 298
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 298
Applied a total of 2 rules in 16 ms. Remains 109 /110 variables (removed 1) and now considering 298/299 (removed 1) transitions.
[2026-05-26 12:56:07] [INFO ] Flow matrix only has 273 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2495175999143563329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3216600284281078348.kers'
[2026-05-26 12:56:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2495175999143563329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3216600284281078348.kers]
Normalized transition count is 272 out of 273 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 272 rows 109 cols 918 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 12:56:07] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3216600284281078348.kers
Total runtime 3 ms.
[2026-05-26 12:56:07] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-26 12:56:07] [INFO ] Flow matrix only has 273 transitions (discarded 25 similar events)
[2026-05-26 12:56:07] [INFO ] Invariant cache hit.
[2026-05-26 12:56:07] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:56:07] [INFO ] Implicit Places using invariants and state equation in 300 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 435 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 108/115 places, 298/306 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 638 ms. Remains : 108/115 places, 298/306 transitions.
[2026-05-26 12:56:07] [INFO ] Flatten gal took : 16 ms
[2026-05-26 12:56:07] [INFO ] Flatten gal took : 17 ms
[2026-05-26 12:56:07] [INFO ] Input system was already deterministic with 298 transitions.
[2026-05-26 12:56:07] [INFO ] Flatten gal took : 14 ms
[2026-05-26 12:56:07] [INFO ] Flatten gal took : 14 ms
[2026-05-26 12:56:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17434382101990700708.gal : 7 ms
[2026-05-26 12:56:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14898707433026639849.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/CTLFireability17434382101990700708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14898707433026639849.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,3.1337e+06,1.42317,42152,2,3332,5,93201,6,0,729,120476,0

Converting to forward existential form...Done !
original formula: (EF(((p7==0)||(p77==0))) * (EG(!(E(EF(((p49==1)&&(p62==1))) U ((p3==1)&&(p41==1))))) + AF((((AG((p51==0)) * AF((((p72==0)||(p106==0))&&((...237
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((p7==0)||(p77==0)))))] = FALSE * [FwdG((Init * !(EG(!(E(E(TRUE U ((p49==1)&&(p62==1))) U (...337
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t6, t8, t13, t14, t15, t16, t18, t20, t25, t26, t27, t28, t30, t32, t37, t38, t39...564
Detected timeout of ITS tools.
[2026-05-26 12:56:37] [INFO ] Flatten gal took : 14 ms
[2026-05-26 12:56:37] [INFO ] Applying decomposition
[2026-05-26 12:56:37] [INFO ] Flatten gal took : 14 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/graph11204047022361968392.txt' '-o' '/tmp/graph11204047022361968392.bin' '-w' '/tmp/graph11204047022361968392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11204047022361968392.bin' '-l' '-1' '-v' '-w' '/tmp/graph11204047022361968392.weights' '-q' '0' '-e' '0.001'
[2026-05-26 12:56:38] [INFO ] Decomposing Gal with order
[2026-05-26 12:56:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 12:56:38] [INFO ] Removed a total of 453 redundant transitions.
[2026-05-26 12:56:38] [INFO ] Flatten gal took : 177 ms
[2026-05-26 12:56:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 35 ms.
[2026-05-26 12:56:38] [INFO ] Time to serialize gal into /tmp/CTLFireability15403636992376644796.gal : 12 ms
[2026-05-26 12:56:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6875330765586301797.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/CTLFireability15403636992376644796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6875330765586301797.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 304
Applied a total of 2 rules in 3 ms. Remains 114 /115 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2026-05-26 12:57:08] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14805450982120893209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13645015492603982467.kers'
[2026-05-26 12:57:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14805450982120893209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13645015492603982467.kers]
Normalized transition count is 277 out of 278 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 277 rows 114 cols 929 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 12:57:08] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13645015492603982467.kers
Total runtime 2 ms.
[2026-05-26 12:57:08] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-26 12:57:08] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 12:57:08] [INFO ] Invariant cache hit.
[2026-05-26 12:57:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 12:57:09] [INFO ] Implicit Places using invariants and state equation in 407 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 546 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 304/306 transitions.
Applied a total of 0 rules in 0 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 550 ms. Remains : 113/115 places, 304/306 transitions.
[2026-05-26 12:57:09] [INFO ] Flatten gal took : 12 ms
[2026-05-26 12:57:09] [INFO ] Flatten gal took : 12 ms
[2026-05-26 12:57:09] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-26 12:57:09] [INFO ] Flatten gal took : 20 ms
[2026-05-26 12:57:09] [INFO ] Flatten gal took : 21 ms
[2026-05-26 12:57:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6054616528635576599.gal : 5 ms
[2026-05-26 12:57:09] [INFO ] Time to serialize properties into /tmp/CTLFireability5799387730351251394.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/CTLFireability6054616528635576599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5799387730351251394.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,5.56308e+06,3.16854,79688,2,4180,5,213943,6,0,753,204163,0

Converting to forward existential form...Done !
original formula: E(AF((!((!(((p7==1)&&(p50==1))) * EX(((p6==1)&&(p26==1))))) + !(((p49==1)&&(p62==1))))) U ((EF((!(EF(((p6==1)&&(p25==1)))) * (EX(((p2==1)...422
=> equivalent forward existential formula: ((([(EY((FwdU(Init,!(EG(!((!((!(((p7==1)&&(p50==1))) * EX(((p6==1)&&(p26==1))))) + !(((p49==1)&&(p62==1)))))))) ...1512
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
Detected timeout of ITS tools.
[2026-05-26 12:57:39] [INFO ] Flatten gal took : 11 ms
[2026-05-26 12:57:39] [INFO ] Applying decomposition
[2026-05-26 12:57:39] [INFO ] Flatten gal took : 10 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/graph12510373336018910201.txt' '-o' '/tmp/graph12510373336018910201.bin' '-w' '/tmp/graph12510373336018910201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12510373336018910201.bin' '-l' '-1' '-v' '-w' '/tmp/graph12510373336018910201.weights' '-q' '0' '-e' '0.001'
[2026-05-26 12:57:39] [INFO ] Decomposing Gal with order
[2026-05-26 12:57:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 12:57:39] [INFO ] Removed a total of 458 redundant transitions.
[2026-05-26 12:57:39] [INFO ] Flatten gal took : 31 ms
[2026-05-26 12:57:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 12 ms.
[2026-05-26 12:57:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3345136514053148645.gal : 4 ms
[2026-05-26 12:57:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1807509127087671237.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/CTLFireability3345136514053148645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1807509127087671237.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,5.56308e+06,13.0298,241664,1967,188,230169,2662,617,1.90786e+06,87,38391,0

Converting to forward existential form...Done !
original formula: E(AF((!((!(((i3.u2.p7==1)&&(i3.u16.p50==1))) * EX(((i3.u2.p6==1)&&(i2.u9.p26==1))))) + !(((i3.u16.p49==1)&&(i6.i1.u20.p62==1))))) U ((EF(...630
=> equivalent forward existential formula: ((([(EY((FwdU(Init,!(EG(!((!((!(((i3.u2.p7==1)&&(i3.u16.p50==1))) * EX(((i3.u2.p6==1)&&(i2.u9.p26==1))))) + !(((...2110
Reverse transition relation is NOT exact ! Due to transitions t3, t44, t46, t47, t50, t51, t54, t59, t60, t65, t70, t75, t80, t94, t96, t97, t98, t99, t136...723
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,19.2178,241676,1,0,230169,4743,3195,1.90786e+06,401,38391,587814
FORMULA FireWire-PT-06-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 305
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 111 transition count 299
Applied a total of 10 rules in 24 ms. Remains 111 /115 variables (removed 4) and now considering 299/306 (removed 7) transitions.
[2026-05-26 12:57:58] [INFO ] Flow matrix only has 274 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3312644620489742325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9823742739385346564.kers'
[2026-05-26 12:57:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3312644620489742325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9823742739385346564.kers]
Normalized transition count is 273 out of 274 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 273 rows 110 cols 920 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-26 12:57:58] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9823742739385346564.kers
Total runtime 2 ms.
[2026-05-26 12:57:58] [INFO ] Implicit Places using invariants in 135 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/115 places, 299/306 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 110 transition count 298
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 109 transition count 298
Applied a total of 2 rules in 10 ms. Remains 109 /110 variables (removed 1) and now considering 298/299 (removed 1) transitions.
[2026-05-26 12:57:58] [INFO ] Flow matrix only has 273 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10064995051123121657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14042709949096915186.kers'
[2026-05-26 12:57:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10064995051123121657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14042709949096915186.kers]
Normalized transition count is 272 out of 273 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 272 rows 109 cols 918 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 12:57:58] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14042709949096915186.kers
Total runtime 2 ms.
[2026-05-26 12:57:59] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-26 12:57:59] [INFO ] Flow matrix only has 273 transitions (discarded 25 similar events)
[2026-05-26 12:57:59] [INFO ] Invariant cache hit.
[2026-05-26 12:57:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 12:57:59] [INFO ] Implicit Places using invariants and state equation in 637 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 790 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 108/115 places, 298/306 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 970 ms. Remains : 108/115 places, 298/306 transitions.
[2026-05-26 12:57:59] [INFO ] Flatten gal took : 15 ms
[2026-05-26 12:57:59] [INFO ] Flatten gal took : 17 ms
[2026-05-26 12:57:59] [INFO ] Input system was already deterministic with 298 transitions.
[2026-05-26 12:57:59] [INFO ] Flatten gal took : 15 ms
[2026-05-26 12:57:59] [INFO ] Flatten gal took : 14 ms
[2026-05-26 12:57:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2652260913837919217.gal : 4 ms
[2026-05-26 12:57:59] [INFO ] Time to serialize properties into /tmp/CTLFireability12333195200259772264.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/CTLFireability2652260913837919217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12333195200259772264.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,3.1337e+06,1.86981,42356,2,3332,5,93201,6,0,729,120476,0

Converting to forward existential form...Done !
original formula: (EF((((!(E(((p7==1)&&(p50==1)) U (p54==1))) + !(A(((p8==1)&&(p96==1)) U ((p2==1)&&(p15==1))))) + ((p12!=1)||(p78!=1))) + ((p7==1)&&(p51==...214
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((!(E(((p7==1)&&(p50==1)) U (p54==1))) + !(!((E(!(((p2==1)&&(p15==1))) U (!(((p8==1)&&(p96...366
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t6, t8, t13, t14, t15, t16, t18, t20, t25, t26, t27, t28, t30, t32, t37, t38, t39...564
Detected timeout of ITS tools.
[2026-05-26 12:58:29] [INFO ] Flatten gal took : 15 ms
[2026-05-26 12:58:29] [INFO ] Applying decomposition
[2026-05-26 12:58:29] [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/graph6201692200631775363.txt' '-o' '/tmp/graph6201692200631775363.bin' '-w' '/tmp/graph6201692200631775363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6201692200631775363.bin' '-l' '-1' '-v' '-w' '/tmp/graph6201692200631775363.weights' '-q' '0' '-e' '0.001'
[2026-05-26 12:58:29] [INFO ] Decomposing Gal with order
[2026-05-26 12:58:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 12:58:29] [INFO ] Removed a total of 453 redundant transitions.
[2026-05-26 12:58:29] [INFO ] Flatten gal took : 24 ms
[2026-05-26 12:58:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 10 ms.
[2026-05-26 12:58:30] [INFO ] Time to serialize gal into /tmp/CTLFireability8000128489046231955.gal : 3 ms
[2026-05-26 12:58:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1448306174835834960.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/CTLFireability8000128489046231955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1448306174835834960.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,3.1337e+06,3.48747,74144,1493,128,107210,1697,574,299982,83,15107,0

Converting to forward existential form...Done !
original formula: (EF((((!(E(((i3.u2.p7==1)&&(i3.u16.p50==1)) U (i3.u18.p54==1))) + !(A(((i1.u3.p8==1)&&(i0.u33.p96==1)) U ((i0.u0.p2==1)&&(i2.u9.p15==1)))...311
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((!(E(((i3.u2.p7==1)&&(i3.u16.p50==1)) U (i3.u18.p54==1))) + !(!((E(!(((i0.u0.p2==1)&&(i2....487
Reverse transition relation is NOT exact ! Due to transitions t0, t40, t43, t46, t47, t56, t61, t66, t71, t76, t90, t92, t128, t137, t142, t144, t145, t146...666
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 302
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 0 with 2 rules applied. Total rules applied 6 place count 111 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 111 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 110 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 109 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 109 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 108 transition count 297
Applied a total of 12 rules in 22 ms. Remains 108 /115 variables (removed 7) and now considering 297/306 (removed 9) transitions.
[2026-05-26 12:59:00] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7721961316138467487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14108633416953434706.kers'
[2026-05-26 12:59:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7721961316138467487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14108633416953434706.kers]
Normalized transition count is 271 out of 272 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 271 rows 107 cols 906 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-26 12:59:00] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14108633416953434706.kers
Total runtime 2 ms.
[2026-05-26 12:59:00] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-26 12:59:00] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2026-05-26 12:59:00] [INFO ] Invariant cache hit.
[2026-05-26 12:59:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 12:59:00] [INFO ] Implicit Places using invariants and state equation in 316 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 466 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 107/115 places, 297/306 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 495 ms. Remains : 107/115 places, 297/306 transitions.
[2026-05-26 12:59:00] [INFO ] Flatten gal took : 13 ms
[2026-05-26 12:59:00] [INFO ] Flatten gal took : 13 ms
[2026-05-26 12:59:00] [INFO ] Input system was already deterministic with 297 transitions.
[2026-05-26 12:59:00] [INFO ] Flatten gal took : 29 ms
[2026-05-26 12:59:00] [INFO ] Flatten gal took : 14 ms
[2026-05-26 12:59:00] [INFO ] Time to serialize gal into /tmp/CTLFireability13379420084331879915.gal : 3 ms
[2026-05-26 12:59:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2591302432863338472.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/CTLFireability13379420084331879915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2591302432863338472.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,3.1337e+06,1.50746,35680,2,2756,5,83467,6,0,725,96587,0

Converting to forward existential form...Done !
original formula: E((p49!=1) U (EF(((p3==1)&&(p97==1))) + ((p7==1)&&(p86==1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,(p49!=1)),TRUE) * ((p3==1)&&(p97==1)))] != FALSE + [(FwdU(Init,(p49!=1)) * ((p7==1)&&(p86==1))...167
Hit Full ! (commute/partial/dont) 289/0/8
(forward)formula 0,1,2.33617,35780,1,0,9,86307,16,1,1445,98075,6
FORMULA FireWire-PT-06-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 302
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 0 with 2 rules applied. Total rules applied 6 place count 111 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 111 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 110 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 109 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 109 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 108 transition count 297
Applied a total of 12 rules in 16 ms. Remains 108 /115 variables (removed 7) and now considering 297/306 (removed 9) transitions.
[2026-05-26 12:59:03] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2026-05-26 12:59:03] [INFO ] Invariant cache hit.
[2026-05-26 12:59:03] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-26 12:59:03] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2026-05-26 12:59:03] [INFO ] Invariant cache hit.
[2026-05-26 12:59:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 12:59:03] [INFO ] Implicit Places using invariants and state equation in 370 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 473 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 107/115 places, 297/306 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 496 ms. Remains : 107/115 places, 297/306 transitions.
[2026-05-26 12:59:03] [INFO ] Flatten gal took : 10 ms
[2026-05-26 12:59:03] [INFO ] Flatten gal took : 11 ms
[2026-05-26 12:59:03] [INFO ] Input system was already deterministic with 297 transitions.
[2026-05-26 12:59:03] [INFO ] Flatten gal took : 11 ms
[2026-05-26 12:59:03] [INFO ] Flatten gal took : 11 ms
[2026-05-26 12:59:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2122176079496682688.gal : 4 ms
[2026-05-26 12:59:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6566014445166277006.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/CTLFireability2122176079496682688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6566014445166277006.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,3.1337e+06,1.95422,35776,2,2756,5,83467,6,0,725,96587,0

Converting to forward existential form...Done !
original formula: EG(((p2==0)||(p38==0)))
=> equivalent forward existential formula: [FwdG(Init,((p2==0)||(p38==0)))] != FALSE
Hit Full ! (commute/partial/dont) 252/0/45
(forward)formula 0,1,5.64486,87964,1,0,9,270794,19,4,4179,249356,8
FORMULA FireWire-PT-06-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 304
Applied a total of 2 rules in 3 ms. Remains 114 /115 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2026-05-26 12:59:09] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17724592225345507003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11846920466889802545.kers'
[2026-05-26 12:59:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17724592225345507003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11846920466889802545.kers]
Normalized transition count is 277 out of 278 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 277 rows 114 cols 929 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 12:59:09] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11846920466889802545.kers
Total runtime 2 ms.
[2026-05-26 12:59:09] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-26 12:59:09] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 12:59:09] [INFO ] Invariant cache hit.
[2026-05-26 12:59:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 12:59:09] [INFO ] Implicit Places using invariants and state equation in 406 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 557 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 304/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 562 ms. Remains : 113/115 places, 304/306 transitions.
[2026-05-26 12:59:09] [INFO ] Flatten gal took : 6 ms
[2026-05-26 12:59:09] [INFO ] Flatten gal took : 8 ms
[2026-05-26 12:59:09] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-26 12:59:09] [INFO ] Flatten gal took : 17 ms
[2026-05-26 12:59:09] [INFO ] Flatten gal took : 8 ms
[2026-05-26 12:59:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13493650382641900894.gal : 2 ms
[2026-05-26 12:59:09] [INFO ] Time to serialize properties into /tmp/CTLFireability18170644851858864292.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/CTLFireability13493650382641900894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18170644851858864292.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,5.56308e+06,3.5072,79836,2,4180,5,213943,6,0,753,204163,0

Converting to forward existential form...Done !
original formula: AX((AX(EX((((p7==0)||(p86==0))||(p29==0)))) * AX((AG(((p2==0)||(p40==0))) + (((p6==1)&&(p90==1))&&((p7==0)||(p60==0)))))))
=> equivalent forward existential formula: ([(EY(EY(Init)) * !(EX((((p7==0)||(p86==0))||(p29==0)))))] = FALSE * [(FwdU((EY(EY(Init)) * !((((p6==1)&&(p90==1...223
(forward)formula 0,0,5.57292,80180,1,0,13,216064,12,4,1537,207507,6
FORMULA FireWire-PT-06-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 302
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 0 with 2 rules applied. Total rules applied 6 place count 111 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 111 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 110 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 109 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 109 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 108 transition count 297
Applied a total of 12 rules in 17 ms. Remains 108 /115 variables (removed 7) and now considering 297/306 (removed 9) transitions.
[2026-05-26 12:59:15] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7636785195542725683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13740714533896440843.kers'
[2026-05-26 12:59:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7636785195542725683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13740714533896440843.kers]
Normalized transition count is 271 out of 272 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 271 rows 107 cols 906 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-26 12:59:15] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13740714533896440843.kers
Total runtime 1 ms.
[2026-05-26 12:59:15] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-26 12:59:15] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2026-05-26 12:59:15] [INFO ] Invariant cache hit.
[2026-05-26 12:59:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 12:59:16] [INFO ] Implicit Places using invariants and state equation in 399 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 574 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 107/115 places, 297/306 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 598 ms. Remains : 107/115 places, 297/306 transitions.
[2026-05-26 12:59:16] [INFO ] Flatten gal took : 9 ms
[2026-05-26 12:59:16] [INFO ] Flatten gal took : 11 ms
[2026-05-26 12:59:16] [INFO ] Input system was already deterministic with 297 transitions.
[2026-05-26 12:59:16] [INFO ] Flatten gal took : 6 ms
[2026-05-26 12:59:16] [INFO ] Flatten gal took : 7 ms
[2026-05-26 12:59:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13614998768736304413.gal : 6 ms
[2026-05-26 12:59:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15484429404668568248.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13614998768736304413.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15484429404668568248.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (2452 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (626 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality15484429404668568248.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23 after 494
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :494 after 923
Reachability property FireWire-PT-06-CTLFireability-2024-07 is true.
FORMULA FireWire-PT-06-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1969,0.240797,8092,2,968,13,8489,6,0,726,8488,0
Total reachable state count : 1969

Verifying 1 reachability properties.
Reachability property FireWire-PT-06-CTLFireability-2024-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-06-CTLFireability-2024-07,1,0.242278,8208,2,108,13,8489,7,0,732,8488,0
Finished probabilistic random walk after 1111056 steps, run visited all 1 properties in 2421 ms. (steps per millisecond=458 )
Probabilistic random walk after 1111056 steps, saw 205974 distinct states, run finished after 2422 ms. (steps per millisecond=458 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 304
Applied a total of 2 rules in 4 ms. Remains 114 /115 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2026-05-26 12:59:18] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4889093718900719401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17092686136322323166.kers'
[2026-05-26 12:59:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4889093718900719401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17092686136322323166.kers]
Normalized transition count is 277 out of 278 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 277 rows 114 cols 929 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 12:59:18] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17092686136322323166.kers
Total runtime 4 ms.
[2026-05-26 12:59:18] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-26 12:59:18] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 12:59:18] [INFO ] Invariant cache hit.
[2026-05-26 12:59:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 12:59:19] [INFO ] Implicit Places using invariants and state equation in 409 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 580 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 304/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 585 ms. Remains : 113/115 places, 304/306 transitions.
[2026-05-26 12:59:19] [INFO ] Flatten gal took : 9 ms
[2026-05-26 12:59:19] [INFO ] Flatten gal took : 10 ms
[2026-05-26 12:59:19] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-26 12:59:19] [INFO ] Flatten gal took : 11 ms
[2026-05-26 12:59:19] [INFO ] Flatten gal took : 11 ms
[2026-05-26 12:59:19] [INFO ] Time to serialize gal into /tmp/CTLFireability1177661617007275961.gal : 3 ms
[2026-05-26 12:59:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15043354204092732414.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/CTLFireability1177661617007275961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15043354204092732414.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,5.56308e+06,3.33172,79836,2,4180,5,213943,6,0,753,204163,0

Converting to forward existential form...Done !
original formula: (EG(((p2==1)&&(p19==1))) + E(((((AG(!(((p7==1)&&(p55==1)))) + EF(((p7==1)&&(p80==1)))) + (((p7==1)&&(p51==1))||(p1!=1))) + (((p7==1)&&(p3...319
=> equivalent forward existential formula: ([FwdG(Init,((p2==1)&&(p19==1)))] != FALSE + [(FwdU(Init,((((!(E(TRUE U !(!(((p7==1)&&(p55==1)))))) + E(TRUE U (...407
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
Detected timeout of ITS tools.
[2026-05-26 12:59:49] [INFO ] Flatten gal took : 8 ms
[2026-05-26 12:59:49] [INFO ] Applying decomposition
[2026-05-26 12:59:49] [INFO ] Flatten gal took : 8 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/graph4193607479959332802.txt' '-o' '/tmp/graph4193607479959332802.bin' '-w' '/tmp/graph4193607479959332802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4193607479959332802.bin' '-l' '-1' '-v' '-w' '/tmp/graph4193607479959332802.weights' '-q' '0' '-e' '0.001'
[2026-05-26 12:59:49] [INFO ] Decomposing Gal with order
[2026-05-26 12:59:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 12:59:49] [INFO ] Removed a total of 458 redundant transitions.
[2026-05-26 12:59:49] [INFO ] Flatten gal took : 20 ms
[2026-05-26 12:59:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 7 ms.
[2026-05-26 12:59:49] [INFO ] Time to serialize gal into /tmp/CTLFireability9473821483433641989.gal : 2 ms
[2026-05-26 12:59:49] [INFO ] Time to serialize properties into /tmp/CTLFireability1049140088788619817.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/CTLFireability9473821483433641989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1049140088788619817.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,5.56308e+06,6.0784,132088,1622,168,208877,1758,592,466645,87,16903,0

Converting to forward existential form...Done !
original formula: (EG(((i0.u0.p2==1)&&(i2.i0.u6.p19==1))) + E(((((AG(!(((i4.u2.p7==1)&&(i4.u18.p55==1)))) + EF(((i4.u2.p7==1)&&(i7.u35.p80==1)))) + (((i4.u...478
=> equivalent forward existential formula: ([FwdG(Init,((i0.u0.p2==1)&&(i2.i0.u6.p19==1)))] != FALSE + [(FwdU(Init,((((!(E(TRUE U !(!(((i4.u2.p7==1)&&(i4.u...566
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Reverse transition relation is NOT exact ! Due to transitions t3, t44, t46, t47, t50, t51, t54, t59, t60, t65, t70, t75, t80, t94, t96, t97, t98, t99, t136...723
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 304
Applied a total of 2 rules in 4 ms. Remains 114 /115 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2026-05-26 13:00:19] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 13:00:19] [INFO ] Invariant cache hit.
[2026-05-26 13:00:19] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-26 13:00:19] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 13:00:19] [INFO ] Invariant cache hit.
[2026-05-26 13:00:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 13:00:20] [INFO ] Implicit Places using invariants and state equation in 280 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 390 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 304/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 395 ms. Remains : 113/115 places, 304/306 transitions.
[2026-05-26 13:00:20] [INFO ] Flatten gal took : 5 ms
[2026-05-26 13:00:20] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:00:20] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-26 13:00:20] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:00:20] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:00:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15747242272448302890.gal : 1 ms
[2026-05-26 13:00:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9533683377002644693.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/CTLFireability15747242272448302890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9533683377002644693.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,5.56308e+06,3.20894,79776,2,4180,5,213943,6,0,753,204163,0

Converting to forward existential form...Done !
original formula: AX(((AG((EG(((p5==0)||(p77==0))) + AG(((p3==0)||(p99==0))))) * EX(EX(((p2==0)||(p63==0))))) * EF(AX(((p7==0)||(p25==0))))))
=> equivalent forward existential formula: (([(FwdU((FwdU(EY(Init),TRUE) * !(EG(((p5==0)||(p77==0))))),TRUE) * !(((p3==0)||(p99==0))))] = FALSE * [(EY(Init...269
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
Detected timeout of ITS tools.
[2026-05-26 13:00:50] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:00:50] [INFO ] Applying decomposition
[2026-05-26 13:00:50] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17249961516156794594.txt' '-o' '/tmp/graph17249961516156794594.bin' '-w' '/tmp/graph17249961516156794594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17249961516156794594.bin' '-l' '-1' '-v' '-w' '/tmp/graph17249961516156794594.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:00:50] [INFO ] Decomposing Gal with order
[2026-05-26 13:00:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:00:50] [INFO ] Removed a total of 458 redundant transitions.
[2026-05-26 13:00:50] [INFO ] Flatten gal took : 20 ms
[2026-05-26 13:00:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 6 ms.
[2026-05-26 13:00:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12605983509855547425.gal : 2 ms
[2026-05-26 13:00:50] [INFO ] Time to serialize properties into /tmp/CTLFireability251050939755847844.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/CTLFireability12605983509855547425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability251050939755847844.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 304
Applied a total of 2 rules in 3 ms. Remains 114 /115 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2026-05-26 13:01:20] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 13:01:20] [INFO ] Invariant cache hit.
[2026-05-26 13:01:20] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-26 13:01:20] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 13:01:20] [INFO ] Invariant cache hit.
[2026-05-26 13:01:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 13:01:20] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2026-05-26 13:01:20] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 13:01:20] [INFO ] Invariant cache hit.
[2026-05-26 13:01:20] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/391 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 40/169 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/392 variables, and 170 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 277/391 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 40/169 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 303/472 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 475 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Starting structural reductions in LTL mode, iteration 1 : 114/115 places, 304/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60641 ms. Remains : 114/115 places, 304/306 transitions.
[2026-05-26 13:02:20] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:02:20] [INFO ] Flatten gal took : 11 ms
[2026-05-26 13:02:20] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-26 13:02:20] [INFO ] Flatten gal took : 11 ms
[2026-05-26 13:02:20] [INFO ] Flatten gal took : 12 ms
[2026-05-26 13:02:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11180659245305012582.gal : 2 ms
[2026-05-26 13:02:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5173386838148997500.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/CTLFireability11180659245305012582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5173386838148997500.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,5.56308e+06,3.61434,80364,2,4381,5,211609,6,0,757,202981,0

Converting to forward existential form...Done !
original formula: EF((AG(((p47==1)&&(p61==1))) + (AX(FALSE) * E(!(((p72==1)&&(p106==1))) U ((p3==1)&&(p101==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((p47==1)&&(p61==1))))))] != FALSE + [(FwdU((FwdU(Init,TRUE) * !(EX(!(FALSE)))...217
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
Hit Full ! (commute/partial/dont) 295/0/9
(forward)formula 0,0,7.40363,112048,1,0,537,461177,636,280,6635,430982,621
FORMULA FireWire-PT-06-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 115 /115 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2026-05-26 13:02:28] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10924558752031655899.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6523943518247437490.kers'
[2026-05-26 13:02:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10924558752031655899.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6523943518247437490.kers]
Normalized transition count is 279 out of 280 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 115 cols 933 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-26 13:02:28] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6523943518247437490.kers
Total runtime 2 ms.
[2026-05-26 13:02:28] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-26 13:02:28] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 13:02:28] [INFO ] Invariant cache hit.
[2026-05-26 13:02:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 13:02:29] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1359 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/115 places, 306/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1363 ms. Remains : 114/115 places, 306/306 transitions.
[2026-05-26 13:02:29] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:02:29] [INFO ] Flatten gal took : 9 ms
[2026-05-26 13:02:29] [INFO ] Input system was already deterministic with 306 transitions.
[2026-05-26 13:02:29] [INFO ] Flatten gal took : 8 ms
[2026-05-26 13:02:29] [INFO ] Flatten gal took : 8 ms
[2026-05-26 13:02:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3945084588216757494.gal : 2 ms
[2026-05-26 13:02:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17197554066485325291.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/CTLFireability3945084588216757494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17197554066485325291.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,5.68136e+06,3.75951,84840,2,4215,5,222625,6,0,759,217382,0

Converting to forward existential form...Done !
original formula: EF(AG(EX(A(((p5==1)&&(p60==1)) U A((p85==1) U ((p7==1)&&(p59==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((E(!(!((E(!(((p7==1)&&(p59==1))) U (!((p85==1)) * !(((p7==1)&&(p59==1)))))...448
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t7, t11, t12, t14, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t36,...608
Detected timeout of ITS tools.
[2026-05-26 13:02:59] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:02:59] [INFO ] Applying decomposition
[2026-05-26 13:02:59] [INFO ] Flatten gal took : 8 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/graph7850324799566997106.txt' '-o' '/tmp/graph7850324799566997106.bin' '-w' '/tmp/graph7850324799566997106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7850324799566997106.bin' '-l' '-1' '-v' '-w' '/tmp/graph7850324799566997106.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:02:59] [INFO ] Decomposing Gal with order
[2026-05-26 13:02:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:02:59] [INFO ] Removed a total of 459 redundant transitions.
[2026-05-26 13:02:59] [INFO ] Flatten gal took : 18 ms
[2026-05-26 13:03:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 5 ms.
[2026-05-26 13:03:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9854604263060151643.gal : 3 ms
[2026-05-26 13:03:00] [INFO ] Time to serialize properties into /tmp/CTLFireability7543354040250894939.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/CTLFireability9854604263060151643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7543354040250894939.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,5.68136e+06,12.6881,220732,2061,224,228740,2339,620,1.27011e+06,89,25085,0

Converting to forward existential form...Done !
original formula: EF(AG(EX(A(((i1.u8.p5==1)&&(i4.u20.p60==1)) U A((i6.u28.p85==1) U ((i4.u2.p7==1)&&(i4.u19.p59==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((E(!(!((E(!(((i4.u2.p7==1)&&(i4.u19.p59==1))) U (!((i6.u28.p85==1)) * !(((...599
Reverse transition relation is NOT exact ! Due to transitions t3, t46, t48, t49, t52, t53, t56, t61, t62, t67, t72, t77, t82, t96, t98, t138, t150, t152, t...732
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 112 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 112 transition count 302
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 0 with 2 rules applied. Total rules applied 6 place count 111 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 111 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 110 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 109 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 109 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 108 transition count 297
Applied a total of 12 rules in 19 ms. Remains 108 /115 variables (removed 7) and now considering 297/306 (removed 9) transitions.
[2026-05-26 13:03:30] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3846454490622303641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1371702687032578473.kers'
[2026-05-26 13:03:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3846454490622303641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1371702687032578473.kers]
Normalized transition count is 271 out of 272 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 271 rows 107 cols 906 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-26 13:03:30] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1371702687032578473.kers
Total runtime 1 ms.
[2026-05-26 13:03:30] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-26 13:03:30] [INFO ] Flow matrix only has 272 transitions (discarded 25 similar events)
[2026-05-26 13:03:30] [INFO ] Invariant cache hit.
[2026-05-26 13:03:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 13:03:30] [INFO ] Implicit Places using invariants and state equation in 255 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 354 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 107/115 places, 297/306 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 378 ms. Remains : 107/115 places, 297/306 transitions.
[2026-05-26 13:03:30] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:03:30] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:03:30] [INFO ] Input system was already deterministic with 297 transitions.
[2026-05-26 13:03:30] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:03:30] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:03:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17454880095440546795.gal : 2 ms
[2026-05-26 13:03:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14820987040424673509.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/CTLFireability17454880095440546795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14820987040424673509.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,3.1337e+06,1.26409,35812,2,2756,5,83467,6,0,725,96587,0

Converting to forward existential form...Done !
original formula: AG((E(((p7==1)&&(p75==1)) U !(AF(EG(((p3==1)&&(p41==1)))))) + EF(((p7==1)&&(p80==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U ((p7==1)&&(p80==1))))) * !(E(((p7==1)&&(p75==1)) U !(!(EG(!(EG(((p3==1)&&(p41==1...174
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t6, t8, t13, t14, t15, t16, t18, t20, t25, t26, t27, t28, t30, t32, t37, t38, t39...564
(forward)formula 0,1,26.8477,595324,1,0,604,2.83814e+06,623,318,6240,2.29664e+06,735
FORMULA FireWire-PT-06-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 304
Applied a total of 2 rules in 2 ms. Remains 114 /115 variables (removed 1) and now considering 304/306 (removed 2) transitions.
[2026-05-26 13:03:57] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2523174753647068371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16892989339467094599.kers'
[2026-05-26 13:03:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2523174753647068371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16892989339467094599.kers]
Normalized transition count is 277 out of 278 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 277 rows 114 cols 929 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 13:03:57] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16892989339467094599.kers
Total runtime 2 ms.
[2026-05-26 13:03:57] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-26 13:03:57] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2026-05-26 13:03:57] [INFO ] Invariant cache hit.
[2026-05-26 13:03:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 13:03:58] [INFO ] Implicit Places using invariants and state equation in 405 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 528 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 304/306 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 532 ms. Remains : 113/115 places, 304/306 transitions.
[2026-05-26 13:03:58] [INFO ] Flatten gal took : 9 ms
[2026-05-26 13:03:58] [INFO ] Flatten gal took : 11 ms
[2026-05-26 13:03:58] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-26 13:03:58] [INFO ] Flatten gal took : 16 ms
[2026-05-26 13:03:58] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:03:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3254141710609791522.gal : 2 ms
[2026-05-26 13:03:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17290398786262235585.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/CTLFireability3254141710609791522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17290398786262235585.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,5.56308e+06,3.33211,79960,2,4180,5,213943,6,0,753,204163,0

Converting to forward existential form...Done !
original formula: EF(((AX(((p12==1)&&(p53==1))) * ((AF(((p6==1)&&(p80==1))) * (((p3==1)&&(p47==1))||((p5==1)&&(p77==1)))) + (EG((p74==1)) * ((p8==0)||(p67=...278
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * !(EX(!(((p12==1)&&(p53==1)))))) * (((p3==1)&&(p47==1))||((p5==1)&&(p77==1)))) * !(EG(!((...437
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t9, t10, t12, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t34, t36, t41...598
Detected timeout of ITS tools.
[2026-05-26 13:04:28] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:04:28] [INFO ] Applying decomposition
[2026-05-26 13:04:28] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13404273458724350856.txt' '-o' '/tmp/graph13404273458724350856.bin' '-w' '/tmp/graph13404273458724350856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13404273458724350856.bin' '-l' '-1' '-v' '-w' '/tmp/graph13404273458724350856.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:04:28] [INFO ] Decomposing Gal with order
[2026-05-26 13:04:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:04:28] [INFO ] Removed a total of 461 redundant transitions.
[2026-05-26 13:04:28] [INFO ] Flatten gal took : 18 ms
[2026-05-26 13:04:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 9 ms.
[2026-05-26 13:04:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11672462163048763512.gal : 5 ms
[2026-05-26 13:04:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15085038889717901837.ctl : 6 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/CTLFireability11672462163048763512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15085038889717901837.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.56308e+06,7.44195,146128,1735,187,210104,1891,615,594107,87,21111,0

Converting to forward existential form...Done !
original formula: EF(((AX(((i1.i2.u3.p12==1)&&(i4.u19.p53==1))) * ((AF(((i4.u2.p6==1)&&(i5.u28.p80==1))) * (((i3.i2.u1.p3==1)&&(i3.i1.u16.p47==1))||((i2.u9...436
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * !(EX(!(((i1.i2.u3.p12==1)&&(i4.u19.p53==1)))))) * (((i3.i2.u1.p3==1)&&(i3.i1.u16.p47==1)...611
Reverse transition relation is NOT exact ! Due to transitions t3, t44, t46, t47, t50, t51, t54, t59, t60, t65, t70, t75, t80, t94, t96, t136, t150, t152, t...720
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,18.192,298340,1,0,407955,5520,3111,1.33811e+06,393,40917,965129
FORMULA FireWire-PT-06-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 114 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 304
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 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 111 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 110 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 110 transition count 299
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 109 transition count 299
Applied a total of 10 rules in 15 ms. Remains 109 /115 variables (removed 6) and now considering 299/306 (removed 7) transitions.
[2026-05-26 13:04:46] [INFO ] Flow matrix only has 274 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12099683548476933834.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-363841924070941388.kers'
[2026-05-26 13:04:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12099683548476933834.kers, --Pflows, --basisKERS=/tmp/petrispot-output-363841924070941388.kers]
Normalized transition count is 273 out of 274 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 273 rows 108 cols 910 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 13:04:46] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-363841924070941388.kers
Total runtime 3 ms.
[2026-05-26 13:04:46] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-26 13:04:46] [INFO ] Flow matrix only has 274 transitions (discarded 25 similar events)
[2026-05-26 13:04:46] [INFO ] Invariant cache hit.
[2026-05-26 13:04:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 13:04:46] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 382 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 108/115 places, 299/306 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 401 ms. Remains : 108/115 places, 299/306 transitions.
[2026-05-26 13:04:46] [INFO ] Flatten gal took : 5 ms
[2026-05-26 13:04:46] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:04:46] [INFO ] Input system was already deterministic with 299 transitions.
[2026-05-26 13:04:46] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:04:46] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:04:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5167851648792461212.gal : 1 ms
[2026-05-26 13:04:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8452181048621091728.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/CTLFireability5167851648792461212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8452181048621091728.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,3.19284e+06,1.10297,32512,2,2731,5,77288,6,0,731,88219,0

Converting to forward existential form...Done !
original formula: EF(AG((p85==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p85==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t7, t8, t10, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t32, t34, t39,...573
(forward)formula 0,0,3.28042,78988,1,0,515,306807,617,271,6114,305177,605
FORMULA FireWire-PT-06-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-26 13:04:50] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:04:50] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:04:50] [INFO ] Applying decomposition
[2026-05-26 13:04:50] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10713678587509579401.txt' '-o' '/tmp/graph10713678587509579401.bin' '-w' '/tmp/graph10713678587509579401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10713678587509579401.bin' '-l' '-1' '-v' '-w' '/tmp/graph10713678587509579401.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:04:50] [INFO ] Decomposing Gal with order
[2026-05-26 13:04:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:04:50] [INFO ] Removed a total of 458 redundant transitions.
[2026-05-26 13:04:50] [INFO ] Flatten gal took : 18 ms
[2026-05-26 13:04:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 4 ms.
[2026-05-26 13:04:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14338613572730380158.gal : 2 ms
[2026-05-26 13:04:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12815689951616788000.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/CTLFireability14338613572730380158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12815689951616788000.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.68136e+06,7.70202,127764,1793,161,184099,1810,595,528382,89,12438,0

Converting to forward existential form...Done !
original formula: (EF(((i4.u2.p7==0)||(i5.u26.p77==0))) * (EG(!(E(EF(((i4.u16.p49==1)&&(i3.i1.u20.p62==1))) U ((i3.i0.u1.p3==1)&&(i1.u13.p41==1))))) + AF((...356
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((i4.u2.p7==0)||(i5.u26.p77==0)))))] = FALSE * [FwdG((Init * !(EG(!(E(E(TRUE U ((i4.u16.p49...456
Reverse transition relation is NOT exact ! Due to transitions t3, t46, t48, t49, t52, t53, t56, t61, t62, t67, t72, t77, t82, t96, t98, t138, t147, t152, t...738
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,82.4581,1121072,1,0,1.54994e+06,5933,3222,4.12291e+06,409,42372,3428968
FORMULA FireWire-PT-06-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF((((!(E(((i4.u2.p7==1)&&(i4.u16.p50==1)) U (i4.u19.p54==1))) + !(A(((i0.u3.p8==1)&&(i1.u33.p96==1)) U ((i1.u0.p2==1)&&(i2.u10.p15==1))...312
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((!(E(((i4.u2.p7==1)&&(i4.u16.p50==1)) U (i4.u19.p54==1))) + !(!((E(!(((i1.u0.p2==1)&&(i2....490
(forward)formula 1,0,118.367,1562936,1,0,2.11464e+06,6358,3241,5.13161e+06,412,45813,4878794
FORMULA FireWire-PT-06-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG(((i1.u0.p2==1)&&(i3.i0.u6.p19==1))) + E(((((AG(!(((i4.u2.p7==1)&&(i4.u19.p55==1)))) + EF(((i4.u2.p7==1)&&(i5.u27.p80==1)))) + (((i4.u...478
=> equivalent forward existential formula: ([FwdG(Init,((i1.u0.p2==1)&&(i3.i0.u6.p19==1)))] != FALSE + [(FwdU(Init,((((!(E(TRUE U !(!(((i4.u2.p7==1)&&(i4.u...566
(forward)formula 2,1,162.415,2118648,1,0,2.84895e+06,6512,3365,6.69291e+06,416,48122,6682064
FORMULA FireWire-PT-06-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(((AG((EG(((i2.u8.p5==0)||(i5.u26.p77==0))) + AG(((i3.i0.u1.p3==0)||(i1.u35.p99==0))))) * EX(EX(((i1.u0.p2==0)||(i0.u21.p63==0))))) * E...195
=> equivalent forward existential formula: (([(FwdU((FwdU(EY(Init),TRUE) * !(EG(((i2.u8.p5==0)||(i5.u26.p77==0))))),TRUE) * !(((i3.i0.u1.p3==0)||(i1.u35.p9...323
(forward)formula 3,0,190.354,2291896,1,0,3.08981e+06,6882,2209,7.15387e+06,260,50256,729990
FORMULA FireWire-PT-06-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG(EX(A(((i2.u8.p5==1)&&(i4.u19.p60==1)) U A((i5.u29.p85==1) U ((i4.u2.p7==1)&&(i4.u18.p59==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((E(!(!((E(!(((i4.u2.p7==1)&&(i4.u18.p59==1))) U (!((i5.u29.p85==1)) * !(((...599
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 4,0,204.89,2291896,1,0,3.08981e+06,6882,2679,7.15387e+06,283,50256,2038366
FORMULA FireWire-PT-06-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 858389 ms.

BK_STOP 1779800896208

--------------------
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="FireWire-PT-06"
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 FireWire-PT-06, 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 r130-smll-177955809000186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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