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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 7 05:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 7 05:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 7 05:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 7 05:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 05:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 7 05:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 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 97K 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-07-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779801506711

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-26 13:18:29] [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 13:18:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 13:18:29] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2026-05-26 13:18:29] [INFO ] Transformed 126 places.
[2026-05-26 13:18:29] [INFO ] Transformed 396 transitions.
[2026-05-26 13:18:29] [INFO ] Found NUPN structural information;
[2026-05-26 13:18:29] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 68 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 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 126 transition count 337
Applied a total of 6 rules in 51 ms. Remains 126 /126 variables (removed 0) and now considering 337/343 (removed 6) transitions.
[2026-05-26 13:18:29] [INFO ] Flow matrix only has 311 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-1456507456446551293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1126544679170597838.kers'
[2026-05-26 13:18:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1456507456446551293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1126544679170597838.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 126 cols 1055 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-26 13:18:29] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-1126544679170597838.kers
Total runtime 11 ms.
[2026-05-26 13:18:30] [INFO ] Implicit Places using invariants in 708 ms returned []
[2026-05-26 13:18:30] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2026-05-26 13:18:30] [INFO ] Invariant cache hit.
[2026-05-26 13:18:30] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 13:18:31] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2026-05-26 13:18:31] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2026-05-26 13:18:31] [INFO ] Invariant cache hit.
[2026-05-26 13:18:31] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (OVERLAPS) 310/436 variables, 126/267 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 44/311 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (OVERLAPS) 1/437 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (OVERLAPS) 0/437 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 312 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30039 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (OVERLAPS) 310/436 variables, 126/268 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 44/312 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 336/648 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/437 variables, and 648 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30036 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60861ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 60923ms
Starting structural reductions in LTL mode, iteration 1 : 126/126 places, 337/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62619 ms. Remains : 126/126 places, 337/343 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 337/337 (removed 0) transitions.
[2026-05-26 13:19:32] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2026-05-26 13:19:32] [INFO ] Invariant cache hit.
[2026-05-26 13:19:32] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-26 13:19:32] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2026-05-26 13:19:32] [INFO ] Invariant cache hit.
[2026-05-26 13:19:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 13:19:32] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 126/126 places, 337/337 transitions.
Support contains 68 out of 126 places after structural reductions.
[2026-05-26 13:19:33] [INFO ] Flatten gal took : 119 ms
[2026-05-26 13:19:33] [INFO ] Flatten gal took : 60 ms
[2026-05-26 13:19:33] [INFO ] Input system was already deterministic with 337 transitions.
Support contains 67 out of 126 places (down from 68) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 49 to 47
RANDOM walk for 40000 steps (2188 resets) in 3661 ms. (10 steps per ms) remains 26/47 properties
BEST_FIRST walk for 4003 steps (96 resets) in 48 ms. (81 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (21 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (52 resets) in 43 ms. (90 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (46 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (44 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (102 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (54 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (61 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (65 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (145 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (150 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (48 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (106 resets) in 56 ms. (70 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (115 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (81 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (76 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (68 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (111 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
[2026-05-26 13:19:35] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2026-05-26 13:19:35] [INFO ] Invariant cache hit.
[2026-05-26 13:19:35] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 2 (OVERLAPS) 82/122 variables, 7/47 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 82/129 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/131 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/131 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/124 variables, 1/132 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 2/134 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/134 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 310/434 variables, 124/258 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 44/302 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/302 constraints. Problems are: Problem set: 5 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/436 variables, 2/304 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 2/306 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 0/306 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 1/437 variables, 1/307 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/437 variables, 0/307 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 0/437 variables, 0/307 constraints. Problems are: Problem set: 5 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 307 constraints, problems are : Problem set: 5 solved, 20 unsolved in 3534 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 89/117 variables, 5/33 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 89/122 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/124 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/124 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 7/124 variables, 3/127 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 7/134 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 3/137 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/137 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 310/434 variables, 124/261 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 44/305 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 20/325 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/434 variables, 1/326 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/434 variables, 0/326 constraints. Problems are: Problem set: 5 solved, 20 unsolved
SMT process timed out in 8595ms, After SMT, problems are : Problem set: 5 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 337/337 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 126 transition count 334
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 123 transition count 327
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 123 transition count 327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 122 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 122 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 121 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 121 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 120 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 120 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 119 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 119 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 118 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 118 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 117 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 117 transition count 311
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 2 with 2 rules applied. Total rules applied 24 place count 116 transition count 310
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 114 transition count 314
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 114 transition count 310
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 34 place count 114 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 113 transition count 307
Applied a total of 35 rules in 166 ms. Remains 113 /126 variables (removed 13) and now considering 307/337 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 113/126 places, 307/337 transitions.
RANDOM walk for 40000 steps (2375 resets) in 973 ms. (41 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (99 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (66 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (61 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (103 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (53 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (74 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (60 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (36 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (154 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (158 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (107 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (38 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (51 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (59 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 644472 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :17 out of 19
Probabilistic random walk after 644472 steps, saw 140345 distinct states, run finished after 3018 ms. (steps per millisecond=213 ) properties seen :17
[2026-05-26 13:19:47] [INFO ] Flow matrix only has 281 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-8611183234535800803.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5585603279179122321.kers'
[2026-05-26 13:19:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8611183234535800803.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5585603279179122321.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 281 rows 111 cols 940 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-26 13:19:47] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5585603279179122321.kers
Total runtime 2 ms.
[2026-05-26 13:19:47] [INFO ] State equation strengthened by 41 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) 56/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 227/287 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 98/385 variables, 46/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 21/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/386 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/394 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/394 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 227/287 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 98/385 variables, 46/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 21/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/386 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/394 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/394 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 164 constraints, problems are : Problem set: 0 solved, 2 unsolved in 783 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1229ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 705 ms.
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 307/307 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 298
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 109 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 108 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 108 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 14 place count 107 transition count 296
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 107 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 107 transition count 293
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 107 transition count 295
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 106 transition count 293
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 23 place count 106 transition count 291
Applied a total of 23 rules in 93 ms. Remains 106 /113 variables (removed 7) and now considering 291/307 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 106/113 places, 291/307 transitions.
RANDOM walk for 40000 steps (2305 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (57 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (547 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 676066 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 2
Probabilistic random walk after 676066 steps, saw 150772 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
[2026-05-26 13:19:52] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9315658346162437324.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10850772957693399609.kers'
[2026-05-26 13:19:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9315658346162437324.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10850772957693399609.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 262 rows 104 cols 875 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 13:19:52] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10850772957693399609.kers
Total runtime 2 ms.
[2026-05-26 13:19:52] [INFO ] State equation strengthened by 40 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) 53/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 210/267 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/359 variables, 42/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/360 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/368 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/368 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 210/267 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/359 variables, 42/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/360 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/368 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/368 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/368 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 156 constraints, problems are : Problem set: 0 solved, 2 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1010ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 927 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 291/291 transitions.
Applied a total of 0 rules in 12 ms. Remains 106 /106 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 106/106 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 291/291 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2026-05-26 13:19:54] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2026-05-26 13:19:54] [INFO ] Invariant cache hit.
[2026-05-26 13:19:54] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-26 13:19:54] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2026-05-26 13:19:54] [INFO ] Invariant cache hit.
[2026-05-26 13:19:54] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 13:19:54] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2026-05-26 13:19:54] [INFO ] Redundant transitions in 17 ms returned []
Running 289 sub problems to find dead transitions.
[2026-05-26 13:19:54] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
[2026-05-26 13:19:54] [INFO ] Invariant cache hit.
[2026-05-26 13:19:54] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 163 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 40/162 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 289/451 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/368 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 453 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60210ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60716 ms. Remains : 106/106 places, 291/291 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 106 vertex of which 29 / 106 are part of one of the 4 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
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 3 place count 80 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 80 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 79 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 79 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 78 transition count 158
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 78 transition count 153
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 75 transition count 152
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 75 transition count 152
Applied a total of 20 rules in 58 ms. Remains 75 /106 variables (removed 31) and now considering 152/291 (removed 139) transitions.
Running SMT prover for 2 properties.
[2026-05-26 13:20:55] [INFO ] Flow matrix only has 150 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1320636737829044001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7559548139093775035.kers'
[2026-05-26 13:20:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1320636737829044001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7559548139093775035.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 150 rows 73 cols 543 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-26 13:20:55] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7559548139093775035.kers
Total runtime 2 ms.
[2026-05-26 13:20:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-26 13:20:55] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 13:20:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-26 13:20:55] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-26 13:20:55] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-26 13:20:55] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 574 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-07-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 13:20:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-26 13:20:55] [INFO ] Flatten gal took : 43 ms
[2026-05-26 13:20:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-07-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 13:20:55] [INFO ] Flatten gal took : 44 ms
[2026-05-26 13:20:55] [INFO ] Input system was already deterministic with 337 transitions.
Support contains 47 out of 126 places (down from 56) after GAL structural reductions.
Computed a total of 22 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 106 transition count 287
Applied a total of 43 rules in 36 ms. Remains 106 /126 variables (removed 20) and now considering 287/337 (removed 50) transitions.
[2026-05-26 13:20:55] [INFO ] Flow matrix only has 261 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-17965086846468558927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9241837152352338773.kers'
[2026-05-26 13:20:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17965086846468558927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9241837152352338773.kers]
Normalized transition count is 260 out of 261 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 106 cols 871 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 13:20:55] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9241837152352338773.kers
Total runtime 3 ms.
[2026-05-26 13:20:56] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-26 13:20:56] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 13:20:56] [INFO ] Invariant cache hit.
[2026-05-26 13:20:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:20:56] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-26 13:20:56] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 13:20:56] [INFO ] Invariant cache hit.
[2026-05-26 13:20:56] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 158 constraints, problems are : Problem set: 0 solved, 286 unsolved in 22876 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
SMT process timed out in 53021ms, After SMT, problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 53023ms
Starting structural reductions in LTL mode, iteration 1 : 106/126 places, 287/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53635 ms. Remains : 106/126 places, 287/337 transitions.
[2026-05-26 13:21:49] [INFO ] Flatten gal took : 20 ms
[2026-05-26 13:21:49] [INFO ] Flatten gal took : 18 ms
[2026-05-26 13:21:49] [INFO ] Input system was already deterministic with 287 transitions.
[2026-05-26 13:21:49] [INFO ] Flatten gal took : 15 ms
[2026-05-26 13:21:49] [INFO ] Flatten gal took : 20 ms
[2026-05-26 13:21:49] [INFO ] Time to serialize gal into /tmp/CTLFireability12242925641158728425.gal : 11 ms
[2026-05-26 13:21:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10017591144724776125.ctl : 7 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/CTLFireability12242925641158728425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10017591144724776125.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,6.23367e+06,7.78529,169984,2,6179,5,456345,6,0,710,596611,0


Converting to forward existential form...Done !
original formula: EX(AX(AG(((p10==0)||(p44==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(E(TRUE U !(((p10==0)||(p44==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...612
Detected timeout of ITS tools.
[2026-05-26 13:22:19] [INFO ] Flatten gal took : 15 ms
[2026-05-26 13:22:19] [INFO ] Applying decomposition
[2026-05-26 13:22:19] [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/graph17332509742507445546.txt' '-o' '/tmp/graph17332509742507445546.bin' '-w' '/tmp/graph17332509742507445546.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17332509742507445546.bin' '-l' '-1' '-v' '-w' '/tmp/graph17332509742507445546.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:22:20] [INFO ] Decomposing Gal with order
[2026-05-26 13:22:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:22:20] [INFO ] Removed a total of 440 redundant transitions.
[2026-05-26 13:22:20] [INFO ] Flatten gal took : 168 ms
[2026-05-26 13:22:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 31 ms.
[2026-05-26 13:22:20] [INFO ] Time to serialize gal into /tmp/CTLFireability12028461059918840423.gal : 12 ms
[2026-05-26 13:22:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6506083391314468409.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/CTLFireability12028461059918840423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6506083391314468409.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.23367e+06,8.30759,162800,1855,72,223303,715,610,855206,81,3624,0


Converting to forward existential form...Done !
original formula: EX(AX(AG(((i1.i1.u3.p10==0)||(i1.i0.u13.p44==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(E(TRUE U !(((i1.i1.u3.p10==0)||(i1.i0.u13.p44==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...807
(forward)formula 0,0,21.2851,347484,1,0,450231,1735,3145,2.1553e+06,363,5987,945111
FORMULA FireWire-PT-07-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 118 transition count 315
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Applied a total of 21 rules in 8 ms. Remains 117 /126 variables (removed 9) and now considering 313/337 (removed 24) transitions.
[2026-05-26 13:22:41] [INFO ] Flow matrix only has 287 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-12931482822274022561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11244306647013058354.kers'
[2026-05-26 13:22:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12931482822274022561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11244306647013058354.kers]
Normalized transition count is 286 out of 287 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 286 rows 117 cols 967 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-26 13:22:41] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11244306647013058354.kers
Total runtime 2 ms.
[2026-05-26 13:22:41] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-26 13:22:41] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
[2026-05-26 13:22:41] [INFO ] Invariant cache hit.
[2026-05-26 13:22:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-26 13:22:42] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2026-05-26 13:22:42] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
[2026-05-26 13:22:42] [INFO ] Invariant cache hit.
[2026-05-26 13:22:42] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 286/403 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 41/173 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 174 constraints, problems are : Problem set: 0 solved, 312 unsolved in 26039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 286/403 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 41/173 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 312/485 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 1/404 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 486 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56151ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 56154ms
Starting structural reductions in LTL mode, iteration 1 : 117/126 places, 313/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56775 ms. Remains : 117/126 places, 313/337 transitions.
[2026-05-26 13:23:38] [INFO ] Flatten gal took : 26 ms
[2026-05-26 13:23:38] [INFO ] Flatten gal took : 25 ms
[2026-05-26 13:23:38] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-26 13:23:38] [INFO ] Flatten gal took : 24 ms
[2026-05-26 13:23:38] [INFO ] Flatten gal took : 24 ms
[2026-05-26 13:23:38] [INFO ] Time to serialize gal into /tmp/CTLFireability14846320050213338254.gal : 5 ms
[2026-05-26 13:23:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1316135297945152465.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/CTLFireability14846320050213338254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1316135297945152465.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,6.50142e+06,0.858119,19480,2,2376,5,58415,6,0,780,51801,0


Converting to forward existential form...Done !
original formula: E(EX(AG(EF(((p10==1)&&(p18==1))))) U E(EG(EX(((p100==1)||(p34==1)))) U (((p8==1)&&(p125==1)) + ((AG(((p8==1)&&(p27==1))) * ((!(((p4==1)&&...325
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,EX(!(E(TRUE U !(E(TRUE U ((p10==1)&&(p18==1)))))))),EG(EX(((p100==1)||(p34==1))))) * ((p8==1)&...515
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...672
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,23.6595,518568,1,0,687,2.64286e+06,664,356,6767,2.05436e+06,786
FORMULA FireWire-PT-07-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 120 transition count 325
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 120 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 120 transition count 322
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 118 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 108 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 108 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 107 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 107 transition count 291
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 1 with 2 rules applied. Total rules applied 41 place count 106 transition count 290
Applied a total of 41 rules in 73 ms. Remains 106 /126 variables (removed 20) and now considering 290/337 (removed 47) transitions.
[2026-05-26 13:24:02] [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-3203343071181398346.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-211172508513045499.kers'
[2026-05-26 13:24:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3203343071181398346.kers, --Pflows, --basisKERS=/tmp/petrispot-output-211172508513045499.kers]
Normalized transition count is 263 out of 264 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 263 rows 104 cols 869 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 13:24:02] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-211172508513045499.kers
Total runtime 6 ms.
[2026-05-26 13:24:02] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-26 13:24:02] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 13:24:02] [INFO ] Invariant cache hit.
[2026-05-26 13:24:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-26 13:24:03] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2026-05-26 13:24:03] [INFO ] Redundant transitions in 8 ms returned []
Running 287 sub problems to find dead transitions.
[2026-05-26 13:24:03] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 13:24:03] [INFO ] Invariant cache hit.
[2026-05-26 13:24:03] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 263/368 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (OVERLAPS) 1/369 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/370 variables, and 158 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 263/368 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/370 variables, and 446 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/126 places, 290/337 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60770 ms. Remains : 106/126 places, 290/337 transitions.
[2026-05-26 13:25:03] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:25:03] [INFO ] Flatten gal took : 12 ms
[2026-05-26 13:25:03] [INFO ] Input system was already deterministic with 290 transitions.
[2026-05-26 13:25:03] [INFO ] Flatten gal took : 12 ms
[2026-05-26 13:25:03] [INFO ] Flatten gal took : 11 ms
[2026-05-26 13:25:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3979663787475776809.gal : 4 ms
[2026-05-26 13:25:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13541280831411199401.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/CTLFireability3979663787475776809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13541280831411199401.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.47636e+06,1.42416,36196,2,2245,5,100148,6,0,713,111734,0


Converting to forward existential form...Done !
original formula: AG(((EG(((p3==0)||(p104==0))) * ((p8==0)||(p109==0))) * (EF(((p3==0)||(p41==0))) + ((p4==1)&&(p20==1)))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EG(((p3==0)||(p104==0)))))] = FALSE * [(FwdU(Init,TRUE) * !(((p8==0)||(p109==0))))] = FA...252
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...618
(forward)formula 0,0,3.16023,62036,1,0,521,271105,600,267,5902,256815,591
FORMULA FireWire-PT-07-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Applied a total of 39 rules in 14 ms. Remains 108 /126 variables (removed 18) and now considering 291/337 (removed 46) transitions.
[2026-05-26 13:25:06] [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-14809813527295115835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12778108553033031398.kers'
[2026-05-26 13:25:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14809813527295115835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12778108553033031398.kers]
Normalized transition count is 264 out of 265 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 108 cols 887 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 13:25:06] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12778108553033031398.kers
Total runtime 2 ms.
[2026-05-26 13:25:06] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-26 13:25:06] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2026-05-26 13:25:06] [INFO ] Invariant cache hit.
[2026-05-26 13:25:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:25:07] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-26 13:25:07] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2026-05-26 13:25:07] [INFO ] Invariant cache hit.
[2026-05-26 13:25:07] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 264/372 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 161 constraints, problems are : Problem set: 0 solved, 290 unsolved in 21855 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 264/372 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 290/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 451 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51960ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 51962ms
Starting structural reductions in LTL mode, iteration 1 : 108/126 places, 291/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52427 ms. Remains : 108/126 places, 291/337 transitions.
[2026-05-26 13:25:59] [INFO ] Flatten gal took : 9 ms
[2026-05-26 13:25:59] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:25:59] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-26 13:25:59] [INFO ] Flatten gal took : 9 ms
[2026-05-26 13:25:59] [INFO ] Flatten gal took : 9 ms
[2026-05-26 13:25:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2894528250372843316.gal : 3 ms
[2026-05-26 13:25:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17292719375691229690.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/CTLFireability2894528250372843316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17292719375691229690.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,6.2526e+06,8.26557,182664,2,7058,5,519041,6,0,722,685871,0


Converting to forward existential form...Done !
original formula: !(E(!(AF((((p7==1)&&(p35==1))||((p7==1)&&(p110==1))))) U ((AX(!(EX(((p5==1)&&(p107==1))))) * (p3==1)) * (p122==1))))
=> equivalent forward existential formula: [(((FwdU(Init,!(!(EG(!((((p7==1)&&(p35==1))||((p7==1)&&(p110==1)))))))) * (p122==1)) * (p3==1)) * !(EX(!(!(EX(((...188
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...624
Detected timeout of ITS tools.
[2026-05-26 13:26:29] [INFO ] Flatten gal took : 8 ms
[2026-05-26 13:26:29] [INFO ] Applying decomposition
[2026-05-26 13:26:29] [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/graph9870692539658106345.txt' '-o' '/tmp/graph9870692539658106345.bin' '-w' '/tmp/graph9870692539658106345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9870692539658106345.bin' '-l' '-1' '-v' '-w' '/tmp/graph9870692539658106345.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:26:29] [INFO ] Decomposing Gal with order
[2026-05-26 13:26:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:26:29] [INFO ] Removed a total of 439 redundant transitions.
[2026-05-26 13:26:29] [INFO ] Flatten gal took : 27 ms
[2026-05-26 13:26:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 13 ms.
[2026-05-26 13:26:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5588292336913345263.gal : 3 ms
[2026-05-26 13:26:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10920898545668973940.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/CTLFireability5588292336913345263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10920898545668973940.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.2526e+06,11.3374,233788,1562,245,285574,5690,621,1.49963e+06,102,45480,0


Converting to forward existential form...Done !
original formula: !(E(!(AF((((i3.u2.p7==1)&&(i1.u10.p35==1))||((i3.u2.p7==1)&&(i6.i1.u36.p110==1))))) U ((AX(!(EX(((i2.i0.u1.p5==1)&&(i5.u34.p107==1))))) *...194
=> equivalent forward existential formula: [(((FwdU(Init,!(!(EG(!((((i3.u2.p7==1)&&(i1.u10.p35==1))||((i3.u2.p7==1)&&(i6.i1.u36.p110==1)))))))) * (i2.i1.u3...248
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t81, t82, t94, t99, t136, t137, t138, t...801
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 119 transition count 319
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 116 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 111 transition count 300
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 1 with 2 rules applied. Total rules applied 33 place count 110 transition count 299
Applied a total of 33 rules in 27 ms. Remains 110 /126 variables (removed 16) and now considering 299/337 (removed 38) transitions.
[2026-05-26 13:26:59] [INFO ] Flow matrix only has 273 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-499009287423959117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12232650006732333654.kers'
[2026-05-26 13:26:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-499009287423959117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12232650006732333654.kers]
Normalized transition count is 272 out of 273 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 272 rows 108 cols 903 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 13:26:59] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12232650006732333654.kers
Total runtime 2 ms.
[2026-05-26 13:26:59] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-26 13:26:59] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2026-05-26 13:26:59] [INFO ] Invariant cache hit.
[2026-05-26 13:26:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:26:59] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2026-05-26 13:26:59] [INFO ] Redundant transitions in 5 ms returned []
Running 296 sub problems to find dead transitions.
[2026-05-26 13:26:59] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2026-05-26 13:26:59] [INFO ] Invariant cache hit.
[2026-05-26 13:26:59] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 272/381 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 1/382 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 0/382 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/383 variables, and 165 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 272/381 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 296/460 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 296 unsolved
SMT process timed out in 60120ms, After SMT, problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/126 places, 299/337 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60525 ms. Remains : 110/126 places, 299/337 transitions.
[2026-05-26 13:27:59] [INFO ] Flatten gal took : 12 ms
[2026-05-26 13:28:00] [INFO ] Flatten gal took : 13 ms
[2026-05-26 13:28:00] [INFO ] Input system was already deterministic with 299 transitions.
[2026-05-26 13:28:00] [INFO ] Flatten gal took : 13 ms
[2026-05-26 13:28:00] [INFO ] Flatten gal took : 12 ms
[2026-05-26 13:28:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15331537243089782159.gal : 4 ms
[2026-05-26 13:28:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2239665155113020436.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/CTLFireability15331537243089782159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2239665155113020436.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.24603e+06,1.79411,42180,2,2315,5,146382,6,0,738,139060,0


Converting to forward existential form...Done !
original formula: (E(((p9==1)&&(p84==1)) U ((p6==1)&&(p31==1))) + EG((AG(((p8==0)||(p99==0))) + (EG(((EF(((p6==1)&&(p59==1))) + ((p3==1)&&(p118==1))) + (p3...193
=> equivalent forward existential formula: ([(FwdU(Init,((p9==1)&&(p84==1))) * ((p6==1)&&(p31==1)))] != FALSE + [FwdG(Init,(!(E(TRUE U !(((p8==0)||(p99==0)...275
Hit Full ! (commute/partial/dont) 250/47/49
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...642
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,19.7132,408532,1,0,709,2.15667e+06,645,385,6421,1.60243e+06,853
FORMULA FireWire-PT-07-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 120 transition count 324
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 120 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 120 transition count 322
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 117 transition count 315
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 112 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 112 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 110 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 110 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 108 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 108 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 107 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 107 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 106 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 106 transition count 289
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 1 with 2 rules applied. Total rules applied 42 place count 105 transition count 288
Applied a total of 42 rules in 38 ms. Remains 105 /126 variables (removed 21) and now considering 288/337 (removed 49) transitions.
[2026-05-26 13:28:20] [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-16964243056753557160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-242358544837506266.kers'
[2026-05-26 13:28:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16964243056753557160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-242358544837506266.kers]
Normalized transition count is 261 out of 262 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 261 rows 103 cols 863 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-26 13:28:20] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-242358544837506266.kers
Total runtime 2 ms.
[2026-05-26 13:28:20] [INFO ] Implicit Places using invariants in 194 ms returned []
[2026-05-26 13:28:20] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 13:28:20] [INFO ] Invariant cache hit.
[2026-05-26 13:28:20] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 13:28:20] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2026-05-26 13:28:20] [INFO ] Redundant transitions in 3 ms returned []
Running 285 sub problems to find dead transitions.
[2026-05-26 13:28:20] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 13:28:20] [INFO ] Invariant cache hit.
[2026-05-26 13:28:20] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 261/365 variables, 104/118 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 36/154 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/367 variables, and 157 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 261/365 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 285/441 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/367 variables, and 443 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/126 places, 288/337 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60598 ms. Remains : 105/126 places, 288/337 transitions.
[2026-05-26 13:29:20] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:29:20] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:29:20] [INFO ] Input system was already deterministic with 288 transitions.
[2026-05-26 13:29:20] [INFO ] Flatten gal took : 12 ms
[2026-05-26 13:29:20] [INFO ] Flatten gal took : 11 ms
[2026-05-26 13:29:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14078196431555559754.gal : 3 ms
[2026-05-26 13:29:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13032476143538656037.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/CTLFireability14078196431555559754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13032476143538656037.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.29042e+06,5.04167,109568,2,5391,5,309002,6,0,707,397558,0


Converting to forward existential form...Done !
original formula: AG(EF(((p5==1)&&(p95==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p5==1)&&(p95==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...612
Detected timeout of ITS tools.
[2026-05-26 13:29:50] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:29:50] [INFO ] Applying decomposition
[2026-05-26 13:29: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/graph17433038352278959853.txt' '-o' '/tmp/graph17433038352278959853.bin' '-w' '/tmp/graph17433038352278959853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17433038352278959853.bin' '-l' '-1' '-v' '-w' '/tmp/graph17433038352278959853.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:29:50] [INFO ] Decomposing Gal with order
[2026-05-26 13:29:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:29:50] [INFO ] Removed a total of 440 redundant transitions.
[2026-05-26 13:29:50] [INFO ] Flatten gal took : 20 ms
[2026-05-26 13:29:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 15 ms.
[2026-05-26 13:29:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15346839146499566239.gal : 3 ms
[2026-05-26 13:29:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12202320533300238289.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/CTLFireability15346839146499566239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12202320533300238289.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.29042e+06,4.69497,99544,1611,119,128480,1168,616,581057,83,7843,0


Converting to forward existential form...Done !
original formula: AG(EF(((i1.i0.u1.p5==1)&&(i4.u23.p95==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.i0.u1.p5==1)&&(i4.u23.p95==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t58, t63, t68, t73, t78, t81, t93, t98, t137, t138, t139, t141, ...796
(forward)formula 0,0,11.6981,231820,1,0,300770,3385,2796,1.63797e+06,338,17645,548436
FORMULA FireWire-PT-07-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 119 transition count 319
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 116 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 105 transition count 286
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 1 with 2 rules applied. Total rules applied 45 place count 104 transition count 285
Applied a total of 45 rules in 37 ms. Remains 104 /126 variables (removed 22) and now considering 285/337 (removed 52) transitions.
[2026-05-26 13:30:02] [INFO ] Flow matrix only has 259 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-1986380715136376606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1903231606031761504.kers'
[2026-05-26 13:30:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1986380715136376606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1903231606031761504.kers]
Normalized transition count is 258 out of 259 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 258 rows 102 cols 851 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-26 13:30:02] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1903231606031761504.kers
Total runtime 2 ms.
[2026-05-26 13:30:02] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-26 13:30:02] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 13:30:02] [INFO ] Invariant cache hit.
[2026-05-26 13:30:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 13:30:03] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2026-05-26 13:30:03] [INFO ] Redundant transitions in 2 ms returned []
Running 282 sub problems to find dead transitions.
[2026-05-26 13:30:03] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 13:30:03] [INFO ] Invariant cache hit.
[2026-05-26 13:30:03] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/363 variables, and 156 constraints, problems are : Problem set: 0 solved, 282 unsolved in 28876 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 282/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/363 variables, and 440 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58960ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 58962ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/126 places, 285/337 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59442 ms. Remains : 104/126 places, 285/337 transitions.
[2026-05-26 13:31:02] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:31:02] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:31:02] [INFO ] Input system was already deterministic with 285 transitions.
[2026-05-26 13:31:02] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:31:02] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:31:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9695824759922877855.gal : 3 ms
[2026-05-26 13:31:02] [INFO ] Time to serialize properties into /tmp/CTLFireability15365923432506489570.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/CTLFireability9695824759922877855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15365923432506489570.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.1877e+06,4.77853,106776,2,5089,5,297543,6,0,700,382873,0


Converting to forward existential form...Done !
original formula: EG((EF(((p66==1)&&(p109==1))) * AF(((p11==0)||(p124==0)))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((p66==1)&&(p109==1))) * !(EG(!(((p11==0)||(p124==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...606
Detected timeout of ITS tools.
[2026-05-26 13:31:32] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:31:32] [INFO ] Applying decomposition
[2026-05-26 13:31:32] [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/graph5808648040544121794.txt' '-o' '/tmp/graph5808648040544121794.bin' '-w' '/tmp/graph5808648040544121794.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5808648040544121794.bin' '-l' '-1' '-v' '-w' '/tmp/graph5808648040544121794.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:31:32] [INFO ] Decomposing Gal with order
[2026-05-26 13:31:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:31:32] [INFO ] Removed a total of 440 redundant transitions.
[2026-05-26 13:31:32] [INFO ] Flatten gal took : 18 ms
[2026-05-26 13:31:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 9 ms.
[2026-05-26 13:31:32] [INFO ] Time to serialize gal into /tmp/CTLFireability8060850928426243038.gal : 2 ms
[2026-05-26 13:31:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1652324153712406388.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/CTLFireability8060850928426243038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1652324153712406388.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.1877e+06,7.35386,160576,1342,69,169610,617,569,1.12531e+06,73,3567,0


Converting to forward existential form...Done !
original formula: EG((EF(((i5.i0.u21.p66==1)&&(i5.i1.u37.p109==1))) * AF(((i1.i1.u3.p11==0)||(i1.i1.u3.p124==0)))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((i5.i0.u21.p66==1)&&(i5.i1.u37.p109==1))) * !(EG(!(((i1.i1.u3.p11==0)||(i1.i1.u3.p124==0))...170
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t58, t63, t68, t73, t78, t81, t90, t91, t92, t93, t98, t139, t14...764
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 a local 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 119 transition count 318
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 108 transition count 293
Applied a total of 39 rules in 35 ms. Remains 108 /126 variables (removed 18) and now considering 293/337 (removed 44) transitions.
[2026-05-26 13:32:02] [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-15865122648854190584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9199971857013548921.kers'
[2026-05-26 13:32:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15865122648854190584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9199971857013548921.kers]
Normalized transition count is 266 out of 267 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 108 cols 895 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 13:32:02] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9199971857013548921.kers
Total runtime 2 ms.
[2026-05-26 13:32:02] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-26 13:32:02] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2026-05-26 13:32:02] [INFO ] Invariant cache hit.
[2026-05-26 13:32:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-26 13:32:02] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2026-05-26 13:32:02] [INFO ] Redundant transitions in 3 ms returned []
Running 292 sub problems to find dead transitions.
[2026-05-26 13:32:02] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2026-05-26 13:32:02] [INFO ] Invariant cache hit.
[2026-05-26 13:32:02] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/374 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 38/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/375 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 0/375 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 162 constraints, problems are : Problem set: 0 solved, 292 unsolved in 22255 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 266/374 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 38/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 292/453 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 292 unsolved
SMT process timed out in 52356ms, After SMT, problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 52363ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/126 places, 293/337 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52904 ms. Remains : 108/126 places, 293/337 transitions.
[2026-05-26 13:32:55] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:32:55] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:32:55] [INFO ] Input system was already deterministic with 293 transitions.
[2026-05-26 13:32:55] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:32:55] [INFO ] Flatten gal took : 7 ms
[2026-05-26 13:32:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18191203243779209052.gal : 2 ms
[2026-05-26 13:32:55] [INFO ] Time to serialize properties into /tmp/CTLFireability14318035115941700829.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/CTLFireability18191203243779209052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14318035115941700829.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.48601e+06,7.25873,154496,2,6879,5,419652,6,0,724,542751,0


Converting to forward existential form...Done !
original formula: EG((EF(((p9==1)&&(p56==1))) + AG((((p62==0)||(p70==0))&&((p10==0)||(p123==0))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((p9==1)&&(p56==1))) + !(E(TRUE U !((((p62==0)||(p70==0))&&((p10==0)||(p123==0))))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...624
Detected timeout of ITS tools.
[2026-05-26 13:33:25] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:33:25] [INFO ] Applying decomposition
[2026-05-26 13:33:25] [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/graph5701317865564245521.txt' '-o' '/tmp/graph5701317865564245521.bin' '-w' '/tmp/graph5701317865564245521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5701317865564245521.bin' '-l' '-1' '-v' '-w' '/tmp/graph5701317865564245521.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:33:25] [INFO ] Decomposing Gal with order
[2026-05-26 13:33:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:33:25] [INFO ] Removed a total of 446 redundant transitions.
[2026-05-26 13:33:25] [INFO ] Flatten gal took : 31 ms
[2026-05-26 13:33:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 14 ms.
[2026-05-26 13:33:25] [INFO ] Time to serialize gal into /tmp/CTLFireability10699620991382737191.gal : 5 ms
[2026-05-26 13:33:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9430870059257028030.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/CTLFireability10699620991382737191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9430870059257028030.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.48601e+06,6.9187,157908,2918,260,203380,1807,621,1.01834e+06,99,18842,0


Converting to forward existential form...Done !
original formula: EG((EF(((i1.i1.u3.p9==1)&&(i3.u18.p56==1))) + AG((((i4.i0.u22.p62==0)||(i4.i0.u21.p70==0))&&((i1.i1.u3.p10==0)||(i1.i1.u3.p123==0))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((i1.i1.u3.p9==1)&&(i3.u18.p56==1))) + !(E(TRUE U !((((i4.i0.u22.p62==0)||(i4.i0.u21.p70==0...214
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...827
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 119 transition count 319
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 116 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 105 transition count 286
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 1 with 2 rules applied. Total rules applied 45 place count 104 transition count 285
Applied a total of 45 rules in 34 ms. Remains 104 /126 variables (removed 22) and now considering 285/337 (removed 52) transitions.
[2026-05-26 13:33:55] [INFO ] Flow matrix only has 259 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-8590769879797976787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3699348482397949282.kers'
[2026-05-26 13:33:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8590769879797976787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3699348482397949282.kers]
Normalized transition count is 258 out of 259 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 258 rows 102 cols 851 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-26 13:33:55] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3699348482397949282.kers
Total runtime 2 ms.
[2026-05-26 13:33:55] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-26 13:33:55] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 13:33:55] [INFO ] Invariant cache hit.
[2026-05-26 13:33:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 13:33:55] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2026-05-26 13:33:55] [INFO ] Redundant transitions in 3 ms returned []
Running 282 sub problems to find dead transitions.
[2026-05-26 13:33:55] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2026-05-26 13:33:55] [INFO ] Invariant cache hit.
[2026-05-26 13:33:55] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/363 variables, and 156 constraints, problems are : Problem set: 0 solved, 282 unsolved in 28983 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 282/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/363 variables, and 440 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59086ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 59087ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/126 places, 285/337 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59509 ms. Remains : 104/126 places, 285/337 transitions.
[2026-05-26 13:34:55] [INFO ] Flatten gal took : 9 ms
[2026-05-26 13:34:55] [INFO ] Flatten gal took : 9 ms
[2026-05-26 13:34:55] [INFO ] Input system was already deterministic with 285 transitions.
[2026-05-26 13:34:55] [INFO ] Flatten gal took : 9 ms
[2026-05-26 13:34:55] [INFO ] Flatten gal took : 9 ms
[2026-05-26 13:34:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15826751673967078172.gal : 3 ms
[2026-05-26 13:34:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12927945681360527690.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/CTLFireability15826751673967078172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12927945681360527690.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.1877e+06,4.88119,107012,2,5089,5,297543,6,0,700,382873,0


Converting to forward existential form...Done !
original formula: EG(AG(!(A(!(((p6==1)&&(p31==1))) U ((p10==1)&&(p44==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(!((E(!(((p10==1)&&(p44==1))) U (!(!(((p6==1)&&(p31==1)))) * !(((p10==1)&&(p44==1))))) ...201
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...606
Detected timeout of ITS tools.
[2026-05-26 13:35:25] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:35:25] [INFO ] Applying decomposition
[2026-05-26 13:35:25] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14784230713933824922.txt' '-o' '/tmp/graph14784230713933824922.bin' '-w' '/tmp/graph14784230713933824922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14784230713933824922.bin' '-l' '-1' '-v' '-w' '/tmp/graph14784230713933824922.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:35:25] [INFO ] Decomposing Gal with order
[2026-05-26 13:35:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:35:25] [INFO ] Removed a total of 432 redundant transitions.
[2026-05-26 13:35:25] [INFO ] Flatten gal took : 33 ms
[2026-05-26 13:35:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 5 ms.
[2026-05-26 13:35:25] [INFO ] Time to serialize gal into /tmp/CTLFireability121480252230539880.gal : 2 ms
[2026-05-26 13:35:25] [INFO ] Time to serialize properties into /tmp/CTLFireability7907252017338973207.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/CTLFireability121480252230539880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7907252017338973207.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 -...261
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.1877e+06,5.83982,146416,2604,159,219811,1287,527,790681,85,10870,0


Converting to forward existential form...Done !
original formula: EG(AG(!(A(!(((i7.i1.u35.p6==1)&&(i3.u11.p31==1))) U ((i1.u3.p10==1)&&(i1.u14.p44==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(!((E(!(((i1.u3.p10==1)&&(i1.u14.p44==1))) U (!(!(((i7.i1.u35.p6==1)&&(i3.u11.p31==1)))...257
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t58, t63, t68, t73, t78, t81, t93, t98, t135, t136, t137, t139, ...760
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 106 transition count 287
Applied a total of 43 rules in 15 ms. Remains 106 /126 variables (removed 20) and now considering 287/337 (removed 50) transitions.
[2026-05-26 13:35:55] [INFO ] Flow matrix only has 261 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-15958316477276040576.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9331629126244039388.kers'
[2026-05-26 13:35:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15958316477276040576.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9331629126244039388.kers]
Normalized transition count is 260 out of 261 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 106 cols 871 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 13:35:55] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9331629126244039388.kers
Total runtime 2 ms.
[2026-05-26 13:35:55] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-26 13:35:55] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 13:35:55] [INFO ] Invariant cache hit.
[2026-05-26 13:35:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:35:55] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2026-05-26 13:35:55] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 13:35:55] [INFO ] Invariant cache hit.
[2026-05-26 13:35:55] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 158 constraints, problems are : Problem set: 0 solved, 286 unsolved in 20096 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
SMT process timed out in 50161ms, After SMT, problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 50161ms
Starting structural reductions in LTL mode, iteration 1 : 106/126 places, 287/337 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50512 ms. Remains : 106/126 places, 287/337 transitions.
[2026-05-26 13:36:45] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:36:45] [INFO ] Flatten gal took : 5 ms
[2026-05-26 13:36:45] [INFO ] Input system was already deterministic with 287 transitions.
[2026-05-26 13:36:45] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:36:45] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:36:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17519760572966361459.gal : 2 ms
[2026-05-26 13:36:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7925232922516695820.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/CTLFireability17519760572966361459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7925232922516695820.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,6.23367e+06,8.65605,170028,2,6179,5,456345,6,0,710,596611,0


Converting to forward existential form...Done !
original formula: EX(AX(!(E(!(AX(((p7==1)&&(p27==1)))) U EG(((p8==1)&&(p102==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(E(!(!(EX(!(((p7==1)&&(p27==1)))))) U EG(((p8==1)&&(p102==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...612
Detected timeout of ITS tools.
[2026-05-26 13:37:15] [INFO ] Flatten gal took : 14 ms
[2026-05-26 13:37:15] [INFO ] Applying decomposition
[2026-05-26 13:37:15] [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/graph16425630116746523969.txt' '-o' '/tmp/graph16425630116746523969.bin' '-w' '/tmp/graph16425630116746523969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16425630116746523969.bin' '-l' '-1' '-v' '-w' '/tmp/graph16425630116746523969.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:37:15] [INFO ] Decomposing Gal with order
[2026-05-26 13:37:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:37:16] [INFO ] Removed a total of 452 redundant transitions.
[2026-05-26 13:37:16] [INFO ] Flatten gal took : 25 ms
[2026-05-26 13:37:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 7 ms.
[2026-05-26 13:37:16] [INFO ] Time to serialize gal into /tmp/CTLFireability1356234522861855089.gal : 4 ms
[2026-05-26 13:37:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11527304996972887009.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/CTLFireability1356234522861855089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11527304996972887009.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.23367e+06,7.24494,145572,1566,62,205543,686,573,708172,73,2782,0


Converting to forward existential form...Done !
original formula: EX(AX(!(E(!(AX(((i3.u2.p7==1)&&(i2.u10.p27==1)))) U EG(((i3.u2.p8==1)&&(i6.u39.p102==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(E(!(!(EX(!(((i3.u2.p7==1)&&(i2.u10.p27==1)))))) U EG(((i3.u2.p8==1)&&(i6.u39.p102==1))))))...168
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...789
Fast SCC detection found a local SCC at level 1
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 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
(forward)formula 0,0,14.7596,219864,1,0,322041,928,2727,1.14181e+06,285,2782,588547
FORMULA FireWire-PT-07-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 119 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 117 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 109 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 109 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 106 transition count 288
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 1 with 2 rules applied. Total rules applied 43 place count 105 transition count 287
Applied a total of 43 rules in 29 ms. Remains 105 /126 variables (removed 21) and now considering 287/337 (removed 50) transitions.
[2026-05-26 13:37:30] [INFO ] Flow matrix only has 261 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-15235678475087759292.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1398741407846840427.kers'
[2026-05-26 13:37:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15235678475087759292.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1398741407846840427.kers]
Normalized transition count is 260 out of 261 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 260 rows 103 cols 859 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-26 13:37:30] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1398741407846840427.kers
Total runtime 2 ms.
[2026-05-26 13:37:31] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-26 13:37:31] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 13:37:31] [INFO ] Invariant cache hit.
[2026-05-26 13:37:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 13:37:31] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2026-05-26 13:37:31] [INFO ] Redundant transitions in 3 ms returned []
Running 284 sub problems to find dead transitions.
[2026-05-26 13:37:31] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2026-05-26 13:37:31] [INFO ] Invariant cache hit.
[2026-05-26 13:37:31] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 260/364 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/366 variables, and 158 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 260/364 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 284/441 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/366 variables, and 442 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/126 places, 287/337 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60540 ms. Remains : 105/126 places, 287/337 transitions.
[2026-05-26 13:38:31] [INFO ] Flatten gal took : 5 ms
[2026-05-26 13:38:31] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:38:31] [INFO ] Input system was already deterministic with 287 transitions.
[2026-05-26 13:38:31] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:38:31] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:38:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14839969653180598409.gal : 1 ms
[2026-05-26 13:38:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7618199670574689388.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/CTLFireability14839969653180598409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7618199670574689388.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.32702e+06,4.76173,111056,2,5177,5,304455,6,0,706,393884,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((p4==1)&&(p18==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((p4==1)&&(p18==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...606
Detected timeout of ITS tools.
[2026-05-26 13:39:01] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:39:01] [INFO ] Applying decomposition
[2026-05-26 13:39:01] [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/graph10610579466503080758.txt' '-o' '/tmp/graph10610579466503080758.bin' '-w' '/tmp/graph10610579466503080758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10610579466503080758.bin' '-l' '-1' '-v' '-w' '/tmp/graph10610579466503080758.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:39:01] [INFO ] Decomposing Gal with order
[2026-05-26 13:39:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:39:01] [INFO ] Removed a total of 439 redundant transitions.
[2026-05-26 13:39:01] [INFO ] Flatten gal took : 17 ms
[2026-05-26 13:39:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 4 ms.
[2026-05-26 13:39:01] [INFO ] Time to serialize gal into /tmp/CTLFireability14941058116112601335.gal : 3 ms
[2026-05-26 13:39:01] [INFO ] Time to serialize properties into /tmp/CTLFireability8545029687527985207.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/CTLFireability14941058116112601335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8545029687527985207.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.32702e+06,2.80535,68648,1488,120,99001,1136,595,378195,80,6872,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((i0.i0.u1.p4==1)&&(i0.i0.u6.p18==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((i0.i0.u1.p4==1)&&(i0.i0.u6.p18==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t58, t63, t68, t73, t78, t81, t90, t91, t92, t93, t98, t139, t14...785
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 4
Fast SCC detection found an SCC at level 6
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
(forward)formula 0,0,21.7967,523552,1,0,674972,3852,2874,4.04481e+06,327,21926,712751
FORMULA FireWire-PT-07-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 119 transition count 319
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 116 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 111 transition count 300
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 1 with 2 rules applied. Total rules applied 33 place count 110 transition count 299
Applied a total of 33 rules in 17 ms. Remains 110 /126 variables (removed 16) and now considering 299/337 (removed 38) transitions.
[2026-05-26 13:39:23] [INFO ] Flow matrix only has 273 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-8675383107395035641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2170633290964831242.kers'
[2026-05-26 13:39:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8675383107395035641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2170633290964831242.kers]
Normalized transition count is 272 out of 273 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 272 rows 108 cols 903 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 13:39:23] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2170633290964831242.kers
Total runtime 3 ms.
[2026-05-26 13:39:23] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-26 13:39:23] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2026-05-26 13:39:23] [INFO ] Invariant cache hit.
[2026-05-26 13:39:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:39:24] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2026-05-26 13:39:24] [INFO ] Redundant transitions in 2 ms returned []
Running 296 sub problems to find dead transitions.
[2026-05-26 13:39:24] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2026-05-26 13:39:24] [INFO ] Invariant cache hit.
[2026-05-26 13:39:24] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 272/381 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 1/382 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/383 variables, and 164 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 272/381 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 296/460 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 1/382 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/383 variables, and 463 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/126 places, 299/337 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60620 ms. Remains : 110/126 places, 299/337 transitions.
[2026-05-26 13:40:24] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:40:24] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:40:24] [INFO ] Input system was already deterministic with 299 transitions.
[2026-05-26 13:40:24] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:40:24] [INFO ] Flatten gal took : 10 ms
[2026-05-26 13:40:24] [INFO ] Time to serialize gal into /tmp/CTLFireability13019374969561752378.gal : 3 ms
[2026-05-26 13:40:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11765264195613507934.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/CTLFireability13019374969561752378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11765264195613507934.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.24603e+06,1.84484,42304,2,2315,5,146382,6,0,738,139060,0


Converting to forward existential form...Done !
original formula: AG(AF(((A(((p3==1)&&(p45==1)) U (!(((p7==1)&&(p97==1))) * A(((p3==1)&&(p80==1)) U ((p7==1)&&(p26==1))))) + EF((p29==0))) + ((p8==1)&&(p98...163
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!((E(!((!(((p7==1)&&(p97==1))) * !((E(!(((p7==1)&&(p26==1))) U (!(((p3==1)&&(p80==1)))...593
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...642
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-26 13:40:54] [INFO ] Flatten gal took : 6 ms
[2026-05-26 13:40:54] [INFO ] Applying decomposition
[2026-05-26 13:40:54] [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/graph7483060399478627403.txt' '-o' '/tmp/graph7483060399478627403.bin' '-w' '/tmp/graph7483060399478627403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7483060399478627403.bin' '-l' '-1' '-v' '-w' '/tmp/graph7483060399478627403.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:40:54] [INFO ] Decomposing Gal with order
[2026-05-26 13:40:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:40:54] [INFO ] Removed a total of 438 redundant transitions.
[2026-05-26 13:40:54] [INFO ] Flatten gal took : 17 ms
[2026-05-26 13:40:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 5 ms.
[2026-05-26 13:40:54] [INFO ] Time to serialize gal into /tmp/CTLFireability10076396180846993131.gal : 3 ms
[2026-05-26 13:40:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7930181328483448153.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/CTLFireability10076396180846993131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7930181328483448153.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.24603e+06,2.7018,59304,1213,305,68430,3022,554,309969,121,23916,0


Converting to forward existential form...Done !
original formula: AG(AF(((A(((i0.u0.p3==1)&&(i3.u15.p45==1)) U (!(((i2.u2.p7==1)&&(i6.i1.u30.p97==1))) * A(((i0.u0.p3==1)&&(i0.u0.p80==1)) U ((i2.u2.p7==1)...239
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!((E(!((!(((i2.u2.p7==1)&&(i6.i1.u30.p97==1))) * !((E(!(((i2.u2.p7==1)&&(i2.u8.p26==1)...821
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t44, t47, t48, t50, t58, t63, t67, t68, t90, t91, t92, t93, t96, t98, t139, t14...824
Using 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 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
Detected timeout of ITS tools.
[2026-05-26 13:41:24] [INFO ] Flatten gal took : 11 ms
[2026-05-26 13:41:24] [INFO ] Flatten gal took : 13 ms
[2026-05-26 13:41:24] [INFO ] Applying decomposition
[2026-05-26 13:41:24] [INFO ] Flatten gal took : 11 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/graph12959621552524395239.txt' '-o' '/tmp/graph12959621552524395239.bin' '-w' '/tmp/graph12959621552524395239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12959621552524395239.bin' '-l' '-1' '-v' '-w' '/tmp/graph12959621552524395239.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:41:24] [INFO ] Decomposing Gal with order
[2026-05-26 13:41:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:41:24] [INFO ] Removed a total of 524 redundant transitions.
[2026-05-26 13:41:24] [INFO ] Flatten gal took : 33 ms
[2026-05-26 13:41:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 8 ms.
[2026-05-26 13:41:24] [INFO ] Time to serialize gal into /tmp/CTLFireability6326062417783915232.gal : 4 ms
[2026-05-26 13:41:24] [INFO ] Time to serialize properties into /tmp/CTLFireability2610475853633932263.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/CTLFireability6326062417783915232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2610475853633932263.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 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,8.03512e+06,2.8497,64616,1619,208,100179,1474,644,213166,92,12302,0


Converting to forward existential form...Done !
original formula: !(E(!(AF((((i3.u2.p7==1)&&(i3.u11.p35==1))||((i3.u2.p7==1)&&(i5.i0.u37.p110==1))))) U ((AX(!(EX(((i1.i0.u1.p5==1)&&(i7.u36.p107==1))))) *...191
=> equivalent forward existential formula: [(((FwdU(Init,!(!(EG(!((((i3.u2.p7==1)&&(i3.u11.p35==1))||((i3.u2.p7==1)&&(i5.i0.u37.p110==1)))))))) * (i2.u3.p1...245
Reverse transition relation is NOT exact ! Due to transitions t43, t45, t46, t49, t50, t58, t60, t65, t70, t75, t80, t84, t92, t93, t94, t95, t98, t100, t1...872
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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,50.0393,909196,1,0,1.46915e+06,7859,3243,3.29832e+06,395,83610,3066182
FORMULA FireWire-PT-07-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((EF(((i5.i1.u22.p66==1)&&(i5.i0.u37.p109==1))) * AF(((i2.u3.p11==0)||(i2.u3.p124==0)))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((i5.i1.u22.p66==1)&&(i5.i0.u37.p109==1))) * !(EG(!(((i2.u3.p11==0)||(i2.u3.p124==0)))))))]...164
(forward)formula 1,1,76.1491,1359060,1,0,2.19977e+06,8498,3382,4.47788e+06,401,94861,4784679
FORMULA FireWire-PT-07-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((EF(((i2.u3.p9==1)&&(i4.u19.p56==1))) + AG((((i5.i1.u21.p62==0)||(i5.i1.u22.p70==0))&&((i2.u3.p10==0)||(i2.u3.p123==0))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((i2.u3.p9==1)&&(i4.u19.p56==1))) + !(E(TRUE U !((((i5.i1.u21.p62==0)||(i5.i1.u22.p70==0))&...205
(forward)formula 2,1,108.623,1868148,1,0,2.99474e+06,9777,3415,5.98664e+06,407,108572,6762557
FORMULA FireWire-PT-07-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(AG(!(A(!(((i7.u33.p6==1)&&(i3.u10.p31==1))) U ((i2.u3.p10==1)&&(i1.i0.u15.p44==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(!((E(!(((i2.u3.p10==1)&&(i1.i0.u15.p44==1))) U (!(!(((i7.u33.p6==1)&&(i3.u10.p31==1)))...263
(forward)formula 3,0,147.636,2242068,1,0,3.58316e+06,10300,1826,7.22369e+06,231,114492,444290
FORMULA FireWire-PT-07-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AF(((A(((i0.u0.p3==1)&&(i1.i0.u15.p45==1)) U (!(((i3.u2.p7==1)&&(i7.u33.p97==1))) * A(((i0.u0.p3==1)&&(i0.u26.p80==1)) U ((i3.u2.p7==1...237
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!((E(!((!(((i3.u2.p7==1)&&(i7.u33.p97==1))) * !((E(!(((i3.u2.p7==1)&&(i3.u8.p26==1))) ...815
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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,1,159.645,2242068,1,0,3.58316e+06,10300,1951,7.22369e+06,234,114492,1496207
FORMULA FireWire-PT-07-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1535732 ms.

BK_STOP 1779803044881

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

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