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.r338-smll-178021499100090.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 ErlangenMainframeV1-PT-bP06C06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 5.1K May 27 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 27 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 27 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.4K May 27 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 27 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 27 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 27 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.8M May 26 18:17 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 ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780268674787

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP06C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-31 23:04:37] [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-31 23:04:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 23:04:37] [INFO ] Load time of PNML (sax parser for PT used): 666 ms
[2026-05-31 23:04:37] [INFO ] Transformed 273 places.
[2026-05-31 23:04:38] [INFO ] Transformed 2487 transitions.
[2026-05-31 23:04:38] [INFO ] Found NUPN structural information;
[2026-05-31 23:04:38] [INFO ] Parsed PT model containing 273 places and 2487 transitions and 34329 arcs in 971 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Support contains 54 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 2487/2487 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 214 transition count 2428
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 214 transition count 2428
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 152 place count 180 transition count 2394
Iterating global reduction 0 with 34 rules applied. Total rules applied 186 place count 180 transition count 2394
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 189 place count 177 transition count 2391
Iterating global reduction 0 with 3 rules applied. Total rules applied 192 place count 177 transition count 2391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 193 place count 176 transition count 2382
Iterating global reduction 0 with 1 rules applied. Total rules applied 194 place count 176 transition count 2382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 195 place count 175 transition count 2381
Iterating global reduction 0 with 1 rules applied. Total rules applied 196 place count 175 transition count 2381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 174 transition count 2380
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 174 transition count 2380
Applied a total of 198 rules in 267 ms. Remains 174 /273 variables (removed 99) and now considering 2380/2487 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3886307944430348344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5355350994506849339.kers'
[2026-05-31 23:04:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3886307944430348344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5355350994506849339.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 2380 rows 174 cols 34079 entries
Finished phase 1 with 153 SingleSign rule and 3 generalized
[2026-05-31 23:04:38] [INFO ] Computed 18 invariants in 34 ms
Computed 18 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-5355350994506849339.kers
Total runtime 45 ms.
[2026-05-31 23:04:39] [INFO ] Implicit Places using invariants in 532 ms returned []
[2026-05-31 23:04:39] [INFO ] Invariant cache hit.
[2026-05-31 23:04:40] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
Running 2379 sub problems to find dead transitions.
[2026-05-31 23:04:40] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 173/2554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2379 unsolved in 30166 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 2379/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2379 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 173/2554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2379 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 2214/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64438ms problems are : Problem set: 0 solved, 2379 unsolved
Search for dead transitions found 0 dead transitions in 64540ms
Starting structural reductions in LTL mode, iteration 1 : 174/273 places, 2380/2487 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67150 ms. Remains : 174/273 places, 2380/2487 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Applied a total of 0 rules in 21 ms. Remains 174 /174 variables (removed 0) and now considering 2380/2380 (removed 0) transitions.
[2026-05-31 23:05:45] [INFO ] Invariant cache hit.
[2026-05-31 23:05:45] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-31 23:05:45] [INFO ] Invariant cache hit.
[2026-05-31 23:05:46] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1449 ms. Remains : 174/174 places, 2380/2380 transitions.
Support contains 54 out of 174 places after structural reductions.
[2026-05-31 23:05:48] [INFO ] Flatten gal took : 828 ms
[2026-05-31 23:05:48] [INFO ] Flatten gal took : 346 ms
[2026-05-31 23:05:49] [INFO ] Input system was already deterministic with 2380 transitions.
RANDOM walk for 40000 steps (8 resets) in 4928 ms. (8 steps per ms) remains 64/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 64/64 properties
Interrupted probabilistic random walk after 187624 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :2 out of 64
Probabilistic random walk after 187624 steps, saw 38549 distinct states, run finished after 3008 ms. (steps per millisecond=62 ) properties seen :2
[2026-05-31 23:05:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 58/102 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 45/147 variables, 3/12 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 27/174 variables, 6/18 constraints. Problems are: Problem set: 3 solved, 59 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/2554 variables, and 18 constraints, problems are : Problem set: 3 solved, 59 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 62/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 59 unsolved
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/102 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 45/147 variables, 3/12 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 27/174 variables, 6/18 constraints. Problems are: Problem set: 4 solved, 58 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 174/2554 variables, and 18 constraints, problems are : Problem set: 4 solved, 58 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 58/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10304ms problems are : Problem set: 4 solved, 58 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Graph (trivial) has 121 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 18 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 169 transition count 2339
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 45 rules applied. Total rules applied 77 place count 138 transition count 2325
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 85 place count 130 transition count 2325
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 85 place count 130 transition count 2315
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 105 place count 120 transition count 2315
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 116 transition count 2303
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 116 transition count 2303
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 113 place count 116 transition count 2301
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 114 transition count 2301
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 163 place count 91 transition count 2278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 165 place count 91 transition count 2276
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 168 place count 88 transition count 2269
Iterating global reduction 4 with 3 rules applied. Total rules applied 171 place count 88 transition count 2269
Performed 6 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 183 place count 82 transition count 2297
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 195 place count 82 transition count 2285
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 81 transition count 2281
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 81 transition count 2281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 203 place count 81 transition count 2275
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 210 place count 81 transition count 2268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 212 place count 80 transition count 2274
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 216 place count 80 transition count 2270
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 220 place count 76 transition count 2270
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 222 place count 76 transition count 2268
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 223 place count 76 transition count 2274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 224 place count 75 transition count 2274
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 230 place count 75 transition count 2274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 236 place count 75 transition count 2268
Applied a total of 236 rules in 2604 ms. Remains 75 /174 variables (removed 99) and now considering 2268/2380 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2605 ms. Remains : 75/174 places, 2268/2380 transitions.
RANDOM walk for 40000 steps (8 resets) in 2865 ms. (13 steps per ms) remains 48/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 154 ms. (25 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 106 ms. (37 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 108 ms. (36 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 118 ms. (33 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 104 ms. (38 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 111 ms. (35 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 83 ms. (47 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 99 ms. (40 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 130 ms. (30 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 121 ms. (32 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 104 ms. (38 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 81 ms. (48 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 87 ms. (45 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 86 ms. (45 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 87 ms. (45 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 84 ms. (47 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 84 ms. (47 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 80 ms. (49 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 78 ms. (50 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
[2026-05-31 23:06:09] [INFO ] Flow matrix only has 2264 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17709156936037151713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18336047453993253906.kers'
[2026-05-31 23:06:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17709156936037151713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18336047453993253906.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 2264 rows 75 cols 33850 entries
Finished phase 1 with 54 SingleSign rule and 3 generalized
[2026-05-31 23:06:09] [INFO ] Computed 18 invariants in 29 ms
Computed 18 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-18336047453993253906.kers
Total runtime 38 ms.
[2026-05-31 23:06:09] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 10/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 18/75 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 2264/2339 variables, 75/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2339 variables, 29/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2339 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/2339 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2339/2339 variables, and 122 constraints, problems are : Problem set: 0 solved, 47 unsolved in 16756 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 47/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 10/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 18/75 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 2264/2339 variables, 75/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2339 variables, 29/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2339 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/2339 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2339/2339 variables, and 122 constraints, problems are : Problem set: 0 solved, 47 unsolved in 29681 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 47/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46647ms problems are : Problem set: 0 solved, 47 unsolved
Parikh walk visited 16 properties in 2073 ms.
Support contains 41 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 2268/2268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 2267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 74 transition count 2267
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 4 place count 73 transition count 2266
Applied a total of 4 rules in 269 ms. Remains 73 /75 variables (removed 2) and now considering 2266/2268 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 73/75 places, 2266/2268 transitions.
RANDOM walk for 40000 steps (8 resets) in 2046 ms. (19 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 74 ms. (53 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 103 ms. (38 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (8 resets) in 72 ms. (54 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 73 ms. (54 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 167471 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :2 out of 29
Probabilistic random walk after 167471 steps, saw 33753 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :2
[2026-05-31 23:07:02] [INFO ] Flow matrix only has 2262 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17594488216731766369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12667914033152306053.kers'
[2026-05-31 23:07:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17594488216731766369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12667914033152306053.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 2262 rows 73 cols 33846 entries
Finished phase 1 with 52 SingleSign rule and 3 generalized
[2026-05-31 23:07:02] [INFO ] Computed 18 invariants in 35 ms
Computed 18 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-12667914033152306053.kers
Total runtime 40 ms.
[2026-05-31 23:07:02] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 10/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 16/73 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 2262/2335 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2335 variables, 29/120 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/2335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2335/2335 variables, and 120 constraints, problems are : Problem set: 0 solved, 27 unsolved in 8040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 73/73 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 27/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 10/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 16/73 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 2262/2335 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2335 variables, 29/120 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/2335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2335/2335 variables, and 120 constraints, problems are : Problem set: 0 solved, 27 unsolved in 17047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 73/73 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 27/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25218ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 3 properties in 1023 ms.
Support contains 41 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 2266/2266 transitions.
Applied a total of 0 rules in 146 ms. Remains 73 /73 variables (removed 0) and now considering 2266/2266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 73/73 places, 2266/2266 transitions.
RANDOM walk for 40000 steps (8 resets) in 1775 ms. (22 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 168222 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 24
Probabilistic random walk after 168222 steps, saw 33852 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2026-05-31 23:07:32] [INFO ] Flow matrix only has 2262 transitions (discarded 4 similar events)
[2026-05-31 23:07:32] [INFO ] Invariant cache hit.
[2026-05-31 23:07:32] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 10/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 16/73 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 2262/2335 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2335 variables, 29/120 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/2335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2335/2335 variables, and 120 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5191 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 73/73 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 10/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 16/73 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 2262/2335 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2335 variables, 29/120 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/2335 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2335/2335 variables, and 120 constraints, problems are : Problem set: 0 solved, 24 unsolved in 17048 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 73/73 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22307ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 5 properties in 876 ms.
Support contains 41 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 2266/2266 transitions.
Applied a total of 0 rules in 144 ms. Remains 73 /73 variables (removed 0) and now considering 2266/2266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 73/73 places, 2266/2266 transitions.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2026-05-31 23:07:56] [INFO ] Flatten gal took : 377 ms
[2026-05-31 23:07:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-31 23:07:56] [INFO ] Flatten gal took : 243 ms
[2026-05-31 23:07:57] [INFO ] Input system was already deterministic with 2380 transitions.
Support contains 50 out of 174 places (down from 51) after GAL structural reductions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 166 transition count 2122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 166 transition count 2122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 163 transition count 2119
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 163 transition count 2119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 161 transition count 2117
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 161 transition count 2117
Applied a total of 26 rules in 36 ms. Remains 161 /174 variables (removed 13) and now considering 2117/2380 (removed 263) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17903511439007742137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2713150718150738703.kers'
[2026-05-31 23:07:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17903511439007742137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2713150718150738703.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2117 rows 161 cols 30597 entries
Finished phase 1 with 140 SingleSign rule and 3 generalized
[2026-05-31 23:07:57] [INFO ] Computed 18 invariants in 19 ms
Computed 18 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-2713150718150738703.kers
Total runtime 25 ms.
[2026-05-31 23:07:57] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-31 23:07:57] [INFO ] Invariant cache hit.
[2026-05-31 23:07:59] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
Running 2116 sub problems to find dead transitions.
[2026-05-31 23:07:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2116 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2278 variables, and 6 constraints, problems are : Problem set: 0 solved, 2116 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/161 constraints, PredecessorRefiner: 2116/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2116 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 2116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 161/2278 variables, and 18 constraints, problems are : Problem set: 0 solved, 2116 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/161 constraints, PredecessorRefiner: 1971/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63045ms problems are : Problem set: 0 solved, 2116 unsolved
Search for dead transitions found 0 dead transitions in 63059ms
Starting structural reductions in LTL mode, iteration 1 : 161/174 places, 2117/2380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64780 ms. Remains : 161/174 places, 2117/2380 transitions.
[2026-05-31 23:09:02] [INFO ] Flatten gal took : 251 ms
[2026-05-31 23:09:02] [INFO ] Flatten gal took : 235 ms
[2026-05-31 23:09:03] [INFO ] Input system was already deterministic with 2117 transitions.
[2026-05-31 23:09:03] [INFO ] Flatten gal took : 185 ms
[2026-05-31 23:09:03] [INFO ] Flatten gal took : 189 ms
[2026-05-31 23:09:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9938960206448745036.gal : 93 ms
[2026-05-31 23:09:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12908348582176916550.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/CTLFireability9938960206448745036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12908348582176916550.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.85576e+11,10.4886,181744,2,22246,5,301364,6,0,2763,255871,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-31 23:09:33] [INFO ] Flatten gal took : 210 ms
[2026-05-31 23:09:33] [INFO ] Applying decomposition
[2026-05-31 23:09:34] [INFO ] Flatten gal took : 181 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/graph3840588743314030068.txt' '-o' '/tmp/graph3840588743314030068.bin' '-w' '/tmp/graph3840588743314030068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3840588743314030068.bin' '-l' '-1' '-v' '-w' '/tmp/graph3840588743314030068.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:09:35] [INFO ] Decomposing Gal with order
[2026-05-31 23:09:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:09:36] [INFO ] Removed a total of 11915 redundant transitions.
[2026-05-31 23:09:36] [INFO ] Flatten gal took : 897 ms
[2026-05-31 23:09:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 156 ms.
[2026-05-31 23:09:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4508015312466711235.gal : 18 ms
[2026-05-31 23:09:36] [INFO ] Time to serialize properties into /tmp/CTLFireability2389718474114936578.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/CTLFireability4508015312466711235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2389718474114936578.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Graph (trivial) has 127 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 168 transition count 2343
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 45 rules applied. Total rules applied 76 place count 138 transition count 2328
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 84 place count 130 transition count 2328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 84 place count 130 transition count 2317
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 119 transition count 2317
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 122 place count 103 transition count 1577
Ensure Unique test removed 5 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 143 place count 98 transition count 1577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 98 transition count 1576
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 97 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 96 transition count 1575
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 95 transition count 1575
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 198 place count 70 transition count 1550
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 200 place count 70 transition count 1548
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 203 place count 67 transition count 1541
Iterating global reduction 4 with 3 rules applied. Total rules applied 206 place count 67 transition count 1541
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 209 place count 67 transition count 1538
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 220 place count 67 transition count 1538
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 66 transition count 1537
Applied a total of 221 rules in 407 ms. Remains 66 /174 variables (removed 108) and now considering 1537/2380 (removed 843) transitions.
[2026-05-31 23:10:07] [INFO ] Flow matrix only has 1525 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-54080410179870784.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4784136038764305103.kers'
[2026-05-31 23:10:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-54080410179870784.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4784136038764305103.kers]
Normalized transition count is 1524 out of 1525 initially.
Culled 0 columns in 6 ms.
// Phase 1: matrix 1524 rows 66 cols 23548 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-31 23:10:07] [INFO ] Computed 12 invariants in 34 ms
Computed 12 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-4784136038764305103.kers
Total runtime 52 ms.
[2026-05-31 23:10:07] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-31 23:10:07] [INFO ] Flow matrix only has 1525 transitions (discarded 12 similar events)
[2026-05-31 23:10:07] [INFO ] Invariant cache hit.
[2026-05-31 23:10:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 23:10:08] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
[2026-05-31 23:10:08] [INFO ] Redundant transitions in 218 ms returned []
Running 1524 sub problems to find dead transitions.
[2026-05-31 23:10:08] [INFO ] Flow matrix only has 1525 transitions (discarded 12 similar events)
[2026-05-31 23:10:08] [INFO ] Invariant cache hit.
[2026-05-31 23:10:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 66/1591 variables, and 12 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/66 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1524/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 66/1591 variables, and 12 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/66 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1491/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62661ms problems are : Problem set: 0 solved, 1524 unsolved
Search for dead transitions found 0 dead transitions in 62675ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/174 places, 1537/2380 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64344 ms. Remains : 66/174 places, 1537/2380 transitions.
[2026-05-31 23:11:11] [INFO ] Flatten gal took : 164 ms
[2026-05-31 23:11:11] [INFO ] Flatten gal took : 273 ms
[2026-05-31 23:11:11] [INFO ] Input system was already deterministic with 1537 transitions.
[2026-05-31 23:11:11] [INFO ] Flatten gal took : 102 ms
[2026-05-31 23:11:12] [INFO ] Flatten gal took : 161 ms
[2026-05-31 23:11:12] [INFO ] Time to serialize gal into /tmp/CTLFireability782204955073534134.gal : 27 ms
[2026-05-31 23:11:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9701091170396230642.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/CTLFireability782204955073534134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9701091170396230642.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.03122e+08,6.60393,120148,2,3341,5,62716,6,0,1799,60629,0


Converting to forward existential form...Done !
original formula: AG((A(((((p13==1)&&(p32==1))&&((p51==1)&&(p74==1)))&&(((p93==1)&&(p119==1))&&((p159==1)&&(p266==1)))) U (!(((((p24==1)&&(p36==1))&&((p51=...429
=> equivalent forward existential formula: (([((FwdU((FwdU(Init,TRUE) * !(((((p24==1)&&(p43==1))&&((p55==1)&&(p70==1)))&&(((p89==1)&&(p112==1))&&((p159==1)...1518
Reverse transition relation is NOT exact ! Due to transitions t48, t65, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...173
(forward)formula 0,0,18.4049,267600,1,0,1600,537192,3100,1520,71655,400375,3118
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 158 transition count 1648
Ensure Unique test removed 4 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 36 place count 154 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 152 transition count 1161
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 152 transition count 1161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 151 transition count 1160
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 43 place count 150 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 44 place count 149 transition count 836
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 149 transition count 836
Applied a total of 45 rules in 37 ms. Remains 149 /174 variables (removed 25) and now considering 836/2380 (removed 1544) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12161260953379138603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2575582891341444399.kers'
[2026-05-31 23:11:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12161260953379138603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2575582891341444399.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 836 rows 149 cols 7670 entries
Finished phase 1 with 135 SingleSign rule and 1 generalized
[2026-05-31 23:11:30] [INFO ] Computed 13 invariants in 5 ms
Computed 13 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2575582891341444399.kers
Total runtime 7 ms.
[2026-05-31 23:11:30] [INFO ] Implicit Places using invariants in 168 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 173 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/174 places, 836/2380 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 836/836 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 216 ms. Remains : 148/174 places, 836/2380 transitions.
[2026-05-31 23:11:30] [INFO ] Flatten gal took : 80 ms
[2026-05-31 23:11:31] [INFO ] Flatten gal took : 84 ms
[2026-05-31 23:11:31] [INFO ] Input system was already deterministic with 836 transitions.
[2026-05-31 23:11:31] [INFO ] Flatten gal took : 84 ms
[2026-05-31 23:11:31] [INFO ] Flatten gal took : 85 ms
[2026-05-31 23:11:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17055507970393490877.gal : 15 ms
[2026-05-31 23:11:31] [INFO ] Time to serialize properties into /tmp/CTLFireability4279666055203691810.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/CTLFireability17055507970393490877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4279666055203691810.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.93929e+11,14.3156,316128,2,53062,5,1.06234e+06,6,0,1430,571758,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-31 23:12:01] [INFO ] Flatten gal took : 49 ms
[2026-05-31 23:12:01] [INFO ] Applying decomposition
[2026-05-31 23:12:01] [INFO ] Flatten gal took : 49 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/graph10582477918011025056.txt' '-o' '/tmp/graph10582477918011025056.bin' '-w' '/tmp/graph10582477918011025056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10582477918011025056.bin' '-l' '-1' '-v' '-w' '/tmp/graph10582477918011025056.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:12:01] [INFO ] Decomposing Gal with order
[2026-05-31 23:12:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:12:01] [INFO ] Removed a total of 1673 redundant transitions.
[2026-05-31 23:12:01] [INFO ] Flatten gal took : 186 ms
[2026-05-31 23:12:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 22 ms.
[2026-05-31 23:12:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8894244192372764906.gal : 6 ms
[2026-05-31 23:12:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17171440861301314784.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/CTLFireability8894244192372764906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17171440861301314784.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Graph (trivial) has 132 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 168 transition count 2343
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 45 rules applied. Total rules applied 76 place count 138 transition count 2328
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 84 place count 130 transition count 2328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 84 place count 130 transition count 2317
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 119 transition count 2317
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 122 place count 103 transition count 1577
Ensure Unique test removed 5 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 143 place count 98 transition count 1577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 98 transition count 1576
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 97 transition count 1576
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 95 transition count 1089
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 94 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 93 transition count 765
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 93 transition count 765
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 202 place count 68 transition count 740
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 204 place count 68 transition count 738
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 207 place count 65 transition count 731
Iterating global reduction 4 with 3 rules applied. Total rules applied 210 place count 65 transition count 731
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 215 place count 65 transition count 726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 219 place count 63 transition count 724
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 228 place count 63 transition count 724
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 62 transition count 723
Applied a total of 229 rules in 265 ms. Remains 62 /174 variables (removed 112) and now considering 723/2380 (removed 1657) transitions.
[2026-05-31 23:12:32] [INFO ] Flow matrix only has 711 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14982333417806539614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-475406432588277383.kers'
[2026-05-31 23:12:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14982333417806539614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-475406432588277383.kers]
Normalized transition count is 710 out of 711 initially.
Culled 0 columns in 3 ms.
// Phase 1: matrix 710 rows 62 cols 10570 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-31 23:12:32] [INFO ] Computed 12 invariants in 8 ms
Computed 12 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-475406432588277383.kers
Total runtime 11 ms.
[2026-05-31 23:12:32] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-31 23:12:32] [INFO ] Flow matrix only has 711 transitions (discarded 12 similar events)
[2026-05-31 23:12:32] [INFO ] Invariant cache hit.
[2026-05-31 23:12:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 23:12:32] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2026-05-31 23:12:33] [INFO ] Redundant transitions in 15 ms returned []
Running 710 sub problems to find dead transitions.
[2026-05-31 23:12:33] [INFO ] Flow matrix only has 711 transitions (discarded 12 similar events)
[2026-05-31 23:12:33] [INFO ] Invariant cache hit.
[2026-05-31 23:12:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (OVERLAPS) 4/62 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (OVERLAPS) 710/772 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 772/773 variables, and 74 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 710/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (OVERLAPS) 4/62 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (OVERLAPS) 710/772 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 31/105 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/773 variables, and 105 constraints, problems are : Problem set: 0 solved, 710 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 710/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60956ms problems are : Problem set: 0 solved, 710 unsolved
Search for dead transitions found 0 dead transitions in 60959ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/174 places, 723/2380 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61906 ms. Remains : 62/174 places, 723/2380 transitions.
[2026-05-31 23:13:34] [INFO ] Flatten gal took : 70 ms
[2026-05-31 23:13:34] [INFO ] Flatten gal took : 77 ms
[2026-05-31 23:13:34] [INFO ] Input system was already deterministic with 723 transitions.
[2026-05-31 23:13:34] [INFO ] Flatten gal took : 76 ms
[2026-05-31 23:13:34] [INFO ] Flatten gal took : 76 ms
[2026-05-31 23:13:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12538051354152369695.gal : 17 ms
[2026-05-31 23:13:34] [INFO ] Time to serialize properties into /tmp/CTLFireability12085009005025756263.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/CTLFireability12538051354152369695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12085009005025756263.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,1.79173e+08,5.60019,95596,2,3431,5,85341,6,0,969,87865,0


Converting to forward existential form...Done !
original formula: AG((EF(((((EF(((((p17==0)||(p36==0))||((p55==0)||(p74==0)))||(((p100==0)||(p119==0))||((p159==0)||(p266==0))))) * (p17==1)) * ((p32==1)&&...331
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((((p17==1)&&(p36==1))&&((p62==1)&&(p81==1)))&&(((p100==1)&&(p108==1))&&((p159==1)&&(p266...400
Reverse transition relation is NOT exact ! Due to transitions t46, t61, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Detected timeout of ITS tools.
[2026-05-31 23:14:04] [INFO ] Flatten gal took : 75 ms
[2026-05-31 23:14:04] [INFO ] Applying decomposition
[2026-05-31 23:14:04] [INFO ] Flatten gal took : 75 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/graph16672264448731260050.txt' '-o' '/tmp/graph16672264448731260050.bin' '-w' '/tmp/graph16672264448731260050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16672264448731260050.bin' '-l' '-1' '-v' '-w' '/tmp/graph16672264448731260050.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:14:04] [INFO ] Decomposing Gal with order
[2026-05-31 23:14:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:14:05] [INFO ] Removed a total of 5645 redundant transitions.
[2026-05-31 23:14:05] [INFO ] Flatten gal took : 164 ms
[2026-05-31 23:14:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 54 ms.
[2026-05-31 23:14:05] [INFO ] Time to serialize gal into /tmp/CTLFireability1937155773543092219.gal : 9 ms
[2026-05-31 23:14:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10463481157013358470.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/CTLFireability1937155773543092219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10463481157013358470.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,1.79173e+08,0.281081,7284,110,45,4085,324,1533,4587,75,1318,0


Converting to forward existential form...Done !
original formula: AG((EF(((((EF(((((i1.u2.p17==0)||(i1.u6.p36==0))||((i1.u3.p55==0)||(i1.u4.p74==0)))||(((i1.u9.p100==0)||(i1.u5.p119==0))||((i2.u10.p159==...478
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((((i1.u2.p17==1)&&(i1.u6.p36==1))&&((i1.u1.p62==1)&&(i1.u9.p81==1)))&&(((i1.u9.p100==1)&...547
Reverse transition relation is NOT exact ! Due to transitions i1.u1.t46, i2.t61, Intersection with reachable at each step enabled. (destroyed/reverse/inte...180
(forward)formula 0,0,0.708816,14360,1,0,16114,1059,11281,32723,347,3272,39541
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Graph (trivial) has 134 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 168 transition count 2343
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 45 rules applied. Total rules applied 76 place count 138 transition count 2328
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 84 place count 130 transition count 2328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 84 place count 130 transition count 2317
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 119 transition count 2317
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 122 place count 103 transition count 1577
Ensure Unique test removed 5 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 143 place count 98 transition count 1577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 98 transition count 1576
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 97 transition count 1576
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 95 transition count 1089
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 94 transition count 1089
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 200 place count 69 transition count 1064
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 202 place count 69 transition count 1062
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 205 place count 66 transition count 1055
Iterating global reduction 4 with 3 rules applied. Total rules applied 208 place count 66 transition count 1055
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 212 place count 66 transition count 1051
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 4 with 2 rules applied. Total rules applied 214 place count 65 transition count 1050
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 222 place count 65 transition count 1050
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 223 place count 64 transition count 1049
Applied a total of 223 rules in 265 ms. Remains 64 /174 variables (removed 110) and now considering 1049/2380 (removed 1331) transitions.
[2026-05-31 23:14:06] [INFO ] Flow matrix only has 1039 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15516503909314683655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8831780917102494599.kers'
[2026-05-31 23:14:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15516503909314683655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8831780917102494599.kers]
Normalized transition count is 1038 out of 1039 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 1038 rows 64 cols 15768 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-31 23:14:06] [INFO ] Computed 12 invariants in 7 ms
Computed 12 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8831780917102494599.kers
Total runtime 10 ms.
[2026-05-31 23:14:06] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-31 23:14:06] [INFO ] Flow matrix only has 1039 transitions (discarded 10 similar events)
[2026-05-31 23:14:06] [INFO ] Invariant cache hit.
[2026-05-31 23:14:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 23:14:06] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2026-05-31 23:14:06] [INFO ] Redundant transitions in 30 ms returned []
Running 1036 sub problems to find dead transitions.
[2026-05-31 23:14:06] [INFO ] Flow matrix only has 1039 transitions (discarded 10 similar events)
[2026-05-31 23:14:06] [INFO ] Invariant cache hit.
[2026-05-31 23:14:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 2 (OVERLAPS) 4/64 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 4 (OVERLAPS) 1038/1102 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1102/1103 variables, and 76 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1036/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1036 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 2 (OVERLAPS) 4/64 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 4 (OVERLAPS) 1038/1102 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 1036 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1102/1103 variables, and 110 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1036/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61833ms problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 61838ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/174 places, 1049/2380 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62826 ms. Remains : 64/174 places, 1049/2380 transitions.
[2026-05-31 23:15:08] [INFO ] Flatten gal took : 101 ms
[2026-05-31 23:15:09] [INFO ] Flatten gal took : 113 ms
[2026-05-31 23:15:09] [INFO ] Input system was already deterministic with 1049 transitions.
[2026-05-31 23:15:09] [INFO ] Flatten gal took : 113 ms
[2026-05-31 23:15:09] [INFO ] Flatten gal took : 112 ms
[2026-05-31 23:15:09] [INFO ] Time to serialize gal into /tmp/CTLFireability16308643333224415886.gal : 25 ms
[2026-05-31 23:15:09] [INFO ] Time to serialize properties into /tmp/CTLFireability3302167041212937899.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/CTLFireability16308643333224415886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3302167041212937899.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.68752e+08,4.19435,74792,2,3862,5,65548,6,0,1303,61951,0


Converting to forward existential form...Done !
original formula: (EF(((((p13==1)&&(p36==1))&&((p55==1)&&(p81==1)))&&(((p100==1)&&(p119==1))&&((p159==1)&&(p255==1))))) + AG(((((p17==1)&&(p32==1))&&((p55=...222
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U ((((p13==1)&&(p36==1))&&((p55==1)&&(p81==1)))&&(((p100==1)&&(p119==1))&&((p159==1)&&(p...285
Reverse transition relation is NOT exact ! Due to transitions t47, t48, t49, t65, Intersection with reachable at each step enabled. (destroyed/reverse/int...183
Detected timeout of ITS tools.
[2026-05-31 23:15:39] [INFO ] Flatten gal took : 65 ms
[2026-05-31 23:15:39] [INFO ] Applying decomposition
[2026-05-31 23:15:39] [INFO ] Flatten gal took : 65 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/graph14076676517385702123.txt' '-o' '/tmp/graph14076676517385702123.bin' '-w' '/tmp/graph14076676517385702123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14076676517385702123.bin' '-l' '-1' '-v' '-w' '/tmp/graph14076676517385702123.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:15:39] [INFO ] Decomposing Gal with order
[2026-05-31 23:15:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:15:40] [INFO ] Removed a total of 7798 redundant transitions.
[2026-05-31 23:15:40] [INFO ] Flatten gal took : 144 ms
[2026-05-31 23:15:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 40 ms.
[2026-05-31 23:15:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17823526861931985288.gal : 6 ms
[2026-05-31 23:15:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12397028682523559055.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/CTLFireability17823526861931985288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12397028682523559055.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,2.68752e+08,0.143662,7024,121,44,3540,516,1400,7043,75,2230,0


Converting to forward existential form...Done !
original formula: (EF(((((i0.i0.u0.p13==1)&&(i1.u10.p36==1))&&((i0.i0.u3.p55==1)&&(i0.u1.p81==1)))&&(((i0.i2.u4.p100==1)&&(i0.i0.u0.p119==1))&&((i1.u10.p15...344
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U ((((i0.i0.u0.p13==1)&&(i1.u10.p36==1))&&((i0.i0.u3.p55==1)&&(i0.u1.p81==1)))&&(((i0.i2...407
Reverse transition relation is NOT exact ! Due to transitions t65, i0.i0.u0.t47, i0.i0.u3.t48, i0.i2.t49, Intersection with reachable at each step enabled...205
(forward)formula 0,1,0.419909,10988,1,0,11918,885,7971,21503,376,2390,29157
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 161 transition count 1731
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 161 transition count 1731
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 155 transition count 702
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 155 transition count 702
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 152 transition count 668
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 152 transition count 668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 151 transition count 524
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 151 transition count 524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 150 transition count 522
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 150 transition count 522
Applied a total of 48 rules in 32 ms. Remains 150 /174 variables (removed 24) and now considering 522/2380 (removed 1858) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10889540960069425631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5268089518960471648.kers'
[2026-05-31 23:15:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10889540960069425631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5268089518960471648.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 522 rows 150 cols 5963 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-31 23:15:40] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5268089518960471648.kers
Total runtime 5 ms.
[2026-05-31 23:15:40] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-31 23:15:40] [INFO ] Invariant cache hit.
[2026-05-31 23:15:41] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2026-05-31 23:15:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (OVERLAPS) 522/672 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/672 variables, and 169 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 521/153 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (OVERLAPS) 522/672 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 153/322 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 13/335 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/672 variables, and 336 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 521/153 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60529ms
Starting structural reductions in LTL mode, iteration 1 : 150/174 places, 522/2380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61011 ms. Remains : 150/174 places, 522/2380 transitions.
[2026-05-31 23:16:41] [INFO ] Flatten gal took : 55 ms
[2026-05-31 23:16:41] [INFO ] Flatten gal took : 58 ms
[2026-05-31 23:16:41] [INFO ] Input system was already deterministic with 522 transitions.
[2026-05-31 23:16:41] [INFO ] Flatten gal took : 63 ms
[2026-05-31 23:16:41] [INFO ] Flatten gal took : 58 ms
[2026-05-31 23:16:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3692747702112056702.gal : 10 ms
[2026-05-31 23:16:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4481422779369786443.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/CTLFireability3692747702112056702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4481422779369786443.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37633e+11,2.79371,59156,2,14492,5,185856,6,0,1124,155605,0


Converting to forward existential form...Done !
original formula: EX((EX(((((p16==0)||(p31==0))||((p54==0)||(p80==0)))||(((p88==0)||(p111==0))||(p165==0)))) * AG(((((p13==0)||(p43==0))||((p55==0)||(p81==...212
=> equivalent forward existential formula: [((EY(Init) * EX(((((p16==0)||(p31==0))||((p54==0)||(p80==0)))||(((p88==0)||(p111==0))||(p165==0))))) * !(E(TRUE...269
Reverse transition relation is NOT exact ! Due to transitions t13, t17, t20, t28, t68, t71, t78, t84, t87, t90, t91, t94, t97, t99, t101, t104, t105, t109,...821
Detected timeout of ITS tools.
[2026-05-31 23:17:12] [INFO ] Flatten gal took : 34 ms
[2026-05-31 23:17:12] [INFO ] Applying decomposition
[2026-05-31 23:17:12] [INFO ] Flatten gal took : 34 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/graph8062333801168149735.txt' '-o' '/tmp/graph8062333801168149735.bin' '-w' '/tmp/graph8062333801168149735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8062333801168149735.bin' '-l' '-1' '-v' '-w' '/tmp/graph8062333801168149735.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:17:12] [INFO ] Decomposing Gal with order
[2026-05-31 23:17:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:17:12] [INFO ] Removed a total of 3139 redundant transitions.
[2026-05-31 23:17:12] [INFO ] Flatten gal took : 82 ms
[2026-05-31 23:17:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 18 ms.
[2026-05-31 23:17:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1422868005768802947.gal : 5 ms
[2026-05-31 23:17:12] [INFO ] Time to serialize properties into /tmp/CTLFireability10411148365224707871.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/CTLFireability1422868005768802947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10411148365224707871.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 166 transition count 2364
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 166 transition count 2364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 163 transition count 2361
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 163 transition count 2361
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 161 transition count 2359
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 161 transition count 2359
Applied a total of 26 rules in 37 ms. Remains 161 /174 variables (removed 13) and now considering 2359/2380 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8232493379079274817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3099670938662728027.kers'
[2026-05-31 23:17:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8232493379079274817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3099670938662728027.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2359 rows 161 cols 33997 entries
Finished phase 1 with 140 SingleSign rule and 3 generalized
[2026-05-31 23:17:42] [INFO ] Computed 18 invariants in 22 ms
Computed 18 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-3099670938662728027.kers
Total runtime 28 ms.
[2026-05-31 23:17:42] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-31 23:17:42] [INFO ] Invariant cache hit.
[2026-05-31 23:17:44] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
Running 2358 sub problems to find dead transitions.
[2026-05-31 23:17:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2358 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2520 variables, and 6 constraints, problems are : Problem set: 0 solved, 2358 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/161 constraints, PredecessorRefiner: 2358/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 160/2520 variables, and 6 constraints, problems are : Problem set: 0 solved, 2358 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/161 constraints, PredecessorRefiner: 2214/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63734ms problems are : Problem set: 0 solved, 2358 unsolved
Search for dead transitions found 0 dead transitions in 63748ms
Starting structural reductions in LTL mode, iteration 1 : 161/174 places, 2359/2380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65410 ms. Remains : 161/174 places, 2359/2380 transitions.
[2026-05-31 23:18:48] [INFO ] Flatten gal took : 299 ms
[2026-05-31 23:18:48] [INFO ] Flatten gal took : 322 ms
[2026-05-31 23:18:48] [INFO ] Input system was already deterministic with 2359 transitions.
[2026-05-31 23:18:49] [INFO ] Flatten gal took : 187 ms
[2026-05-31 23:18:49] [INFO ] Flatten gal took : 191 ms
[2026-05-31 23:18:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13569516191434383765.gal : 32 ms
[2026-05-31 23:18:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16272936340287993106.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/CTLFireability13569516191434383765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16272936340287993106.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.71577e+11,11.4482,197452,2,23696,5,318993,6,0,3005,263733,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-31 23:19:19] [INFO ] Flatten gal took : 192 ms
[2026-05-31 23:19:19] [INFO ] Applying decomposition
[2026-05-31 23:19:19] [INFO ] Flatten gal took : 228 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/graph8663160431386916111.txt' '-o' '/tmp/graph8663160431386916111.bin' '-w' '/tmp/graph8663160431386916111.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8663160431386916111.bin' '-l' '-1' '-v' '-w' '/tmp/graph8663160431386916111.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:19:20] [INFO ] Decomposing Gal with order
[2026-05-31 23:19:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:19:20] [INFO ] Removed a total of 9062 redundant transitions.
[2026-05-31 23:19:20] [INFO ] Flatten gal took : 453 ms
[2026-05-31 23:19:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 460 labels/synchronizations in 97 ms.
[2026-05-31 23:19:21] [INFO ] Time to serialize gal into /tmp/CTLFireability3424766081579295327.gal : 13 ms
[2026-05-31 23:19:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9182174594646133228.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/CTLFireability3424766081579295327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9182174594646133228.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 166 transition count 2364
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 166 transition count 2364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 163 transition count 2361
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 163 transition count 2361
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 161 transition count 2359
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 161 transition count 2359
Applied a total of 26 rules in 37 ms. Remains 161 /174 variables (removed 13) and now considering 2359/2380 (removed 21) transitions.
[2026-05-31 23:19:51] [INFO ] Invariant cache hit.
[2026-05-31 23:19:51] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-31 23:19:51] [INFO ] Invariant cache hit.
[2026-05-31 23:19:52] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 161/174 places, 2359/2380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1174 ms. Remains : 161/174 places, 2359/2380 transitions.
[2026-05-31 23:19:52] [INFO ] Flatten gal took : 260 ms
[2026-05-31 23:19:52] [INFO ] Flatten gal took : 301 ms
[2026-05-31 23:19:53] [INFO ] Input system was already deterministic with 2359 transitions.
[2026-05-31 23:19:53] [INFO ] Flatten gal took : 188 ms
[2026-05-31 23:19:53] [INFO ] Flatten gal took : 195 ms
[2026-05-31 23:19:53] [INFO ] Time to serialize gal into /tmp/CTLFireability11088818750559872780.gal : 32 ms
[2026-05-31 23:19:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15786658294372583809.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/CTLFireability11088818750559872780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15786658294372583809.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.71577e+11,11.4698,197628,2,23696,5,318993,6,0,3005,263733,0


Converting to forward existential form...Done !
original formula: (A(A(AG(E(((((p24==1)&&(p32==1))&&((p55==1)&&(p74==1)))&&(((p100==1)&&(p108==1))&&((p159==1)&&(p266==1)))) U ((((p23==1)&&(p35==1))&&((p5...2179
=> equivalent forward existential formula: ([((Init * !(EG(!(((E((((((((p13==1)&&(p43==1))&&((p51==1)&&(p74==1)))&&(((p100==1)&&(p108==1))&&((p159==1)&&(p2...6012
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-31 23:20:24] [INFO ] Flatten gal took : 186 ms
[2026-05-31 23:20:24] [INFO ] Applying decomposition
[2026-05-31 23:20:24] [INFO ] Flatten gal took : 189 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/graph4216445511364363609.txt' '-o' '/tmp/graph4216445511364363609.bin' '-w' '/tmp/graph4216445511364363609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4216445511364363609.bin' '-l' '-1' '-v' '-w' '/tmp/graph4216445511364363609.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:20:24] [INFO ] Decomposing Gal with order
[2026-05-31 23:20:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:20:25] [INFO ] Removed a total of 8800 redundant transitions.
[2026-05-31 23:20:25] [INFO ] Flatten gal took : 549 ms
[2026-05-31 23:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 1016 labels/synchronizations in 94 ms.
[2026-05-31 23:20:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3037144228411510561.gal : 14 ms
[2026-05-31 23:20:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15102675163240316639.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/CTLFireability3037144228411510561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15102675163240316639.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Graph (trivial) has 128 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 168 transition count 2345
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 42 rules applied. Total rules applied 71 place count 140 transition count 2331
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 79 place count 132 transition count 2331
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 79 place count 132 transition count 2320
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 101 place count 121 transition count 2320
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 117 place count 105 transition count 1580
Ensure Unique test removed 5 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 138 place count 100 transition count 1580
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 100 transition count 1579
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 99 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 98 transition count 1578
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 97 transition count 1578
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 193 place count 72 transition count 1553
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 195 place count 72 transition count 1551
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 198 place count 69 transition count 1544
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 69 transition count 1544
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 204 place count 69 transition count 1541
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 213 place count 69 transition count 1541
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 68 transition count 1540
Applied a total of 214 rules in 266 ms. Remains 68 /174 variables (removed 106) and now considering 1540/2380 (removed 840) transitions.
[2026-05-31 23:20:55] [INFO ] Flow matrix only has 1530 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16484514033388994286.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9813608311278880396.kers'
[2026-05-31 23:20:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16484514033388994286.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9813608311278880396.kers]
Normalized transition count is 1529 out of 1530 initially.
Culled 0 columns in 4 ms.
// Phase 1: matrix 1529 rows 68 cols 23558 entries
Finished phase 1 with 56 SingleSign rule and 0 generalized
[2026-05-31 23:20:55] [INFO ] Computed 12 invariants in 13 ms
Computed 12 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-9813608311278880396.kers
Total runtime 17 ms.
[2026-05-31 23:20:56] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-31 23:20:56] [INFO ] Flow matrix only has 1530 transitions (discarded 10 similar events)
[2026-05-31 23:20:56] [INFO ] Invariant cache hit.
[2026-05-31 23:20:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 23:20:56] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2026-05-31 23:20:56] [INFO ] Redundant transitions in 70 ms returned []
Running 1527 sub problems to find dead transitions.
[2026-05-31 23:20:56] [INFO ] Flow matrix only has 1530 transitions (discarded 10 similar events)
[2026-05-31 23:20:56] [INFO ] Invariant cache hit.
[2026-05-31 23:20:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1527 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1527 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1527 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/1598 variables, and 12 constraints, problems are : Problem set: 0 solved, 1527 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/68 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1527/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1527 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1527 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1527 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1527 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 68/1598 variables, and 12 constraints, problems are : Problem set: 0 solved, 1527 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/68 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1489/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62484ms problems are : Problem set: 0 solved, 1527 unsolved
Search for dead transitions found 0 dead transitions in 62490ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/174 places, 1540/2380 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63634 ms. Remains : 68/174 places, 1540/2380 transitions.
[2026-05-31 23:21:59] [INFO ] Flatten gal took : 160 ms
[2026-05-31 23:21:59] [INFO ] Flatten gal took : 175 ms
[2026-05-31 23:21:59] [INFO ] Input system was already deterministic with 1540 transitions.
[2026-05-31 23:22:00] [INFO ] Flatten gal took : 157 ms
[2026-05-31 23:22:00] [INFO ] Flatten gal took : 131 ms
[2026-05-31 23:22:00] [INFO ] Time to serialize gal into /tmp/CTLFireability1393712584410159364.gal : 22 ms
[2026-05-31 23:22:00] [INFO ] Time to serialize properties into /tmp/CTLFireability11840947368685635345.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/CTLFireability1393712584410159364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11840947368685635345.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.37496e+08,6.75483,121764,2,3451,5,67899,6,0,1810,65170,0


Converting to forward existential form...Done !
original formula: EF(!(A(AF((((((p13==1)&&(p36==1))&&((p51==1)&&(p74==1)))&&(((p100==1)&&(p119==1))&&((p159==1)&&(p255==1))))||(!((((p17==1)&&(p43==1))&&((...451
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(!((!(EG(!(((((p17==1)&&(p43==1))&&((p55==1)&&(p74==1)))&&(((p89==1)&&(p119==1))&&((p...1490
Reverse transition relation is NOT exact ! Due to transitions t51, t52, t53, t70, Intersection with reachable at each step enabled. (destroyed/reverse/int...183
Hit Full ! (commute/partial/dont) 47/6806/1493
(forward)formula 0,1,20.9528,294532,1,0,1652,657678,3120,1544,75888,497113,3212
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 163 transition count 1851
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 163 transition count 1851
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 160 transition count 1848
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 160 transition count 1848
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 158 transition count 1846
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 158 transition count 1846
Applied a total of 32 rules in 31 ms. Remains 158 /174 variables (removed 16) and now considering 1846/2380 (removed 534) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18318770439583395903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1351231324755551629.kers'
[2026-05-31 23:22:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18318770439583395903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1351231324755551629.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1846 rows 158 cols 26815 entries
Finished phase 1 with 137 SingleSign rule and 3 generalized
[2026-05-31 23:22:21] [INFO ] Computed 18 invariants in 16 ms
Computed 18 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-1351231324755551629.kers
Total runtime 20 ms.
[2026-05-31 23:22:21] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-31 23:22:21] [INFO ] Invariant cache hit.
[2026-05-31 23:22:22] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
Running 1845 sub problems to find dead transitions.
[2026-05-31 23:22:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1845 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/2004 variables, and 6 constraints, problems are : Problem set: 0 solved, 1845 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 1845/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1845 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1845 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1845 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1845 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/2004 variables, and 19 constraints, problems are : Problem set: 0 solved, 1845 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 1694/151 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62800ms problems are : Problem set: 0 solved, 1845 unsolved
Search for dead transitions found 0 dead transitions in 62808ms
Starting structural reductions in LTL mode, iteration 1 : 158/174 places, 1846/2380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64349 ms. Remains : 158/174 places, 1846/2380 transitions.
[2026-05-31 23:23:26] [INFO ] Flatten gal took : 253 ms
[2026-05-31 23:23:26] [INFO ] Flatten gal took : 234 ms
[2026-05-31 23:23:26] [INFO ] Input system was already deterministic with 1846 transitions.
[2026-05-31 23:23:26] [INFO ] Flatten gal took : 157 ms
[2026-05-31 23:23:26] [INFO ] Flatten gal took : 253 ms
[2026-05-31 23:23:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5445846428352243181.gal : 41 ms
[2026-05-31 23:23:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12360618221245805559.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/CTLFireability5445846428352243181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12360618221245805559.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.7107e+11,9.61259,166112,2,21385,5,274572,6,0,2480,238465,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-31 23:23:57] [INFO ] Flatten gal took : 157 ms
[2026-05-31 23:23:57] [INFO ] Applying decomposition
[2026-05-31 23:23:57] [INFO ] Flatten gal took : 262 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/graph724504683101456457.txt' '-o' '/tmp/graph724504683101456457.bin' '-w' '/tmp/graph724504683101456457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph724504683101456457.bin' '-l' '-1' '-v' '-w' '/tmp/graph724504683101456457.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:23:57] [INFO ] Decomposing Gal with order
[2026-05-31 23:23:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:23:58] [INFO ] Removed a total of 10789 redundant transitions.
[2026-05-31 23:23:58] [INFO ] Flatten gal took : 194 ms
[2026-05-31 23:23:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 60 ms.
[2026-05-31 23:23:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5598110208948590424.gal : 5 ms
[2026-05-31 23:23:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16483272090943119054.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/CTLFireability5598110208948590424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16483272090943119054.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Graph (trivial) has 130 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 168 transition count 2343
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 45 rules applied. Total rules applied 76 place count 138 transition count 2328
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 84 place count 130 transition count 2328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 84 place count 130 transition count 2317
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 119 transition count 2317
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 122 place count 103 transition count 1577
Ensure Unique test removed 5 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 143 place count 98 transition count 1577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 98 transition count 1576
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 97 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 96 transition count 1575
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 95 transition count 1575
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 198 place count 70 transition count 1550
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 200 place count 70 transition count 1548
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 203 place count 67 transition count 1541
Iterating global reduction 4 with 3 rules applied. Total rules applied 206 place count 67 transition count 1541
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 209 place count 67 transition count 1538
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 217 place count 67 transition count 1538
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 66 transition count 1537
Applied a total of 218 rules in 253 ms. Remains 66 /174 variables (removed 108) and now considering 1537/2380 (removed 843) transitions.
[2026-05-31 23:24:28] [INFO ] Flow matrix only has 1528 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7558382333580775523.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13953515239540614155.kers'
[2026-05-31 23:24:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7558382333580775523.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13953515239540614155.kers]
Normalized transition count is 1527 out of 1528 initially.
Culled 0 columns in 4 ms.
// Phase 1: matrix 1527 rows 66 cols 23554 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-31 23:24:28] [INFO ] Computed 12 invariants in 12 ms
Computed 12 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-13953515239540614155.kers
Total runtime 18 ms.
[2026-05-31 23:24:28] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-31 23:24:28] [INFO ] Flow matrix only has 1528 transitions (discarded 9 similar events)
[2026-05-31 23:24:28] [INFO ] Invariant cache hit.
[2026-05-31 23:24:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 23:24:29] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2026-05-31 23:24:29] [INFO ] Redundant transitions in 68 ms returned []
Running 1524 sub problems to find dead transitions.
[2026-05-31 23:24:29] [INFO ] Flow matrix only has 1528 transitions (discarded 9 similar events)
[2026-05-31 23:24:29] [INFO ] Invariant cache hit.
[2026-05-31 23:24:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 66/1594 variables, and 12 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/66 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1524/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 66/1594 variables, and 12 constraints, problems are : Problem set: 0 solved, 1524 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/66 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1488/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62540ms problems are : Problem set: 0 solved, 1524 unsolved
Search for dead transitions found 0 dead transitions in 62546ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/174 places, 1537/2380 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63817 ms. Remains : 66/174 places, 1537/2380 transitions.
[2026-05-31 23:25:32] [INFO ] Flatten gal took : 149 ms
[2026-05-31 23:25:32] [INFO ] Flatten gal took : 165 ms
[2026-05-31 23:25:32] [INFO ] Input system was already deterministic with 1537 transitions.
[2026-05-31 23:25:32] [INFO ] Flatten gal took : 94 ms
[2026-05-31 23:25:32] [INFO ] Flatten gal took : 97 ms
[2026-05-31 23:25:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9640187551590817313.gal : 22 ms
[2026-05-31 23:25:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4580034555913176797.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/CTLFireability9640187551590817313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4580034555913176797.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.03122e+08,5.9864,111272,2,4198,5,79373,6,0,1799,74827,0


Converting to forward existential form...Done !
original formula: E(((((p13==1)&&(p32==1))&&((p62==1)&&(p81==1)))&&(((p89==1)&&(p108==1))&&((p159==1)&&(p266==1)))) U AG(A(EG(((((p17==1)&&(p36==1))&&((p55...326
=> equivalent forward existential formula: [(FwdU(Init,((((p13==1)&&(p32==1))&&((p62==1)&&(p81==1)))&&(((p89==1)&&(p108==1))&&((p159==1)&&(p266==1))))) * !...609
Reverse transition relation is NOT exact ! Due to transitions t48, t49, t50, t51, t68, Intersection with reachable at each step enabled. (destroyed/revers...188
Detected timeout of ITS tools.
[2026-05-31 23:26:03] [INFO ] Flatten gal took : 102 ms
[2026-05-31 23:26:03] [INFO ] Applying decomposition
[2026-05-31 23:26:03] [INFO ] Flatten gal took : 105 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/graph2035584739890525538.txt' '-o' '/tmp/graph2035584739890525538.bin' '-w' '/tmp/graph2035584739890525538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2035584739890525538.bin' '-l' '-1' '-v' '-w' '/tmp/graph2035584739890525538.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:26:03] [INFO ] Decomposing Gal with order
[2026-05-31 23:26:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:26:03] [INFO ] Removed a total of 9482 redundant transitions.
[2026-05-31 23:26:03] [INFO ] Flatten gal took : 342 ms
[2026-05-31 23:26:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 47 ms.
[2026-05-31 23:26:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12434031260769170362.gal : 4 ms
[2026-05-31 23:26:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2398117804582486554.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/CTLFireability12434031260769170362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2398117804582486554.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,4.03122e+08,0.236989,8124,127,147,5113,2161,910,10394,121,17349,0


Converting to forward existential form...Done !
original formula: E(((((i0.u2.p13==1)&&(i0.u1.p32==1))&&((i0.u10.p62==1)&&(i0.u2.p81==1)))&&(((u6.p89==1)&&(i0.u3.p108==1))&&((u6.p159==1)&&(i0.u10.p266==1...454
=> equivalent forward existential formula: [(FwdU(Init,((((i0.u2.p13==1)&&(i0.u1.p32==1))&&((i0.u10.p62==1)&&(i0.u2.p81==1)))&&(((u6.p89==1)&&(i0.u3.p108==...825
Reverse transition relation is NOT exact ! Due to transitions t68, u6.t50, i0.u1.t48, i0.u3.t51, i0.u10.t49, Intersection with reachable at each step enab...208
Using saturation style SCC detection
Using saturation style SCC detection
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
(forward)formula 0,0,0.684415,11076,1,0,9717,3702,6394,16556,619,17349,24373
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Graph (trivial) has 147 edges and 174 vertex of which 11 / 174 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 167 transition count 2341
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 46 rules applied. Total rules applied 78 place count 136 transition count 2326
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 86 place count 128 transition count 2326
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 86 place count 128 transition count 2317
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 104 place count 119 transition count 2317
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 114 place count 109 transition count 1671
Iterating global reduction 3 with 10 rules applied. Total rules applied 124 place count 109 transition count 1671
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 124 place count 109 transition count 1670
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 108 transition count 1670
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 132 place count 102 transition count 372
Iterating global reduction 3 with 6 rules applied. Total rules applied 138 place count 102 transition count 372
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 99 transition count 304
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 99 transition count 304
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 98 transition count 302
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 98 transition count 302
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 196 place count 73 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 198 place count 73 transition count 275
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 201 place count 70 transition count 268
Iterating global reduction 4 with 3 rules applied. Total rules applied 204 place count 70 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 210 place count 70 transition count 262
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 216 place count 67 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 66 transition count 258
Applied a total of 217 rules in 159 ms. Remains 66 /174 variables (removed 108) and now considering 258/2380 (removed 2122) transitions.
[2026-05-31 23:26:04] [INFO ] Flow matrix only has 253 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3015697236509461228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6544356071016230399.kers'
[2026-05-31 23:26:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3015697236509461228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6544356071016230399.kers]
Normalized transition count is 252 out of 253 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 252 rows 66 cols 3106 entries
Finished phase 1 with 46 SingleSign rule and 2 generalized
[2026-05-31 23:26:04] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6544356071016230399.kers
Total runtime 3 ms.
[2026-05-31 23:26:05] [INFO ] Implicit Places using invariants in 204 ms returned []
[2026-05-31 23:26:05] [INFO ] Flow matrix only has 253 transitions (discarded 5 similar events)
[2026-05-31 23:26:05] [INFO ] Invariant cache hit.
[2026-05-31 23:26:05] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2026-05-31 23:26:05] [INFO ] Redundant transitions in 2 ms returned []
Running 238 sub problems to find dead transitions.
[2026-05-31 23:26:05] [INFO ] Flow matrix only has 253 transitions (discarded 5 similar events)
[2026-05-31 23:26:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 252/318 variables, 66/84 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/318 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/319 variables, and 84 constraints, problems are : Problem set: 0 solved, 238 unsolved in 15237 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 238/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 252/318 variables, 66/84 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 46/130 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 0/318 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/319 variables, and 130 constraints, problems are : Problem set: 0 solved, 238 unsolved in 21160 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 238/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36677ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 36678ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/174 places, 258/2380 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37286 ms. Remains : 66/174 places, 258/2380 transitions.
[2026-05-31 23:26:42] [INFO ] Flatten gal took : 15 ms
[2026-05-31 23:26:42] [INFO ] Flatten gal took : 15 ms
[2026-05-31 23:26:42] [INFO ] Input system was already deterministic with 258 transitions.
[2026-05-31 23:26:42] [INFO ] Flatten gal took : 15 ms
[2026-05-31 23:26:42] [INFO ] Flatten gal took : 15 ms
[2026-05-31 23:26:42] [INFO ] Time to serialize gal into /tmp/CTLFireability1412000557742476728.gal : 3 ms
[2026-05-31 23:26:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14328856045583973110.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/CTLFireability1412000557742476728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14328856045583973110.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,1.82477e+07,0.540038,11724,2,2010,5,17359,6,0,520,16463,0


Converting to forward existential form...Done !
original formula: AG(AF(((((p12==0)||(p31==0))||((p54==0)||(p73==0)))||(((p88==0)||(p118==0))||(p165==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((((p12==0)||(p31==0))||((p54==0)||(p73==0)))||(((p88==0)||(p118==0))||(p165==0)))))] = ...160
Hit Full ! (commute/partial/dont) 67/696/191
(forward)formula 0,0,1.16533,22092,1,0,6,45559,20,0,8634,16463,8
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Graph (trivial) has 139 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 168 transition count 2343
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 45 rules applied. Total rules applied 76 place count 138 transition count 2328
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 84 place count 130 transition count 2328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 84 place count 130 transition count 2317
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 119 transition count 2317
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 122 place count 103 transition count 1577
Ensure Unique test removed 5 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 143 place count 98 transition count 1577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 98 transition count 1576
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 97 transition count 1576
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 151 place count 91 transition count 309
Ensure Unique test removed 1 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 158 place count 90 transition count 309
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 162 place count 86 transition count 239
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 86 transition count 239
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 216 place count 61 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 218 place count 61 transition count 212
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 221 place count 58 transition count 205
Iterating global reduction 4 with 3 rules applied. Total rules applied 224 place count 58 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 230 place count 58 transition count 199
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 236 place count 55 transition count 196
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 239 place count 55 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 54 transition count 195
Applied a total of 240 rules in 134 ms. Remains 54 /174 variables (removed 120) and now considering 195/2380 (removed 2185) transitions.
[2026-05-31 23:26:43] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13218442888589162830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1698285878260774583.kers'
[2026-05-31 23:26:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13218442888589162830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1698285878260774583.kers]
Normalized transition count is 187 out of 188 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 54 cols 2238 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-31 23:26:43] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1698285878260774583.kers
Total runtime 3 ms.
[2026-05-31 23:26:43] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-31 23:26:43] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2026-05-31 23:26:43] [INFO ] Invariant cache hit.
[2026-05-31 23:26:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 23:26:43] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2026-05-31 23:26:43] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2026-05-31 23:26:43] [INFO ] Flow matrix only has 188 transitions (discarded 7 similar events)
[2026-05-31 23:26:43] [INFO ] Invariant cache hit.
[2026-05-31 23:26:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 187/241 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 1/242 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 67 constraints, problems are : Problem set: 0 solved, 182 unsolved in 12185 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 187/241 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 182/248 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 1/242 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 249 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42458ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 42459ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/174 places, 195/2380 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42812 ms. Remains : 54/174 places, 195/2380 transitions.
[2026-05-31 23:27:26] [INFO ] Flatten gal took : 9 ms
[2026-05-31 23:27:26] [INFO ] Flatten gal took : 10 ms
[2026-05-31 23:27:26] [INFO ] Input system was already deterministic with 195 transitions.
[2026-05-31 23:27:26] [INFO ] Flatten gal took : 9 ms
[2026-05-31 23:27:26] [INFO ] Flatten gal took : 10 ms
[2026-05-31 23:27:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7044916163657428023.gal : 2 ms
[2026-05-31 23:27:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7685208840449720199.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/CTLFireability7044916163657428023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7685208840449720199.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.54033e+07,0.317848,11804,2,1665,5,13636,6,0,409,13303,0


Converting to forward existential form...Done !
original formula: EF(EG(((((p17==1)&&(p43==1))&&((p51==1)&&(p70==1)))&&(((p100==1)&&(p108==1))&&((p159==1)&&(p266==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((p17==1)&&(p43==1))&&((p51==1)&&(p70==1)))&&(((p100==1)&&(p108==1))&&((p159==1)&&(p266=...172
Hit Full ! (commute/partial/dont) 38/651/157
(forward)formula 0,1,1.11811,22428,1,0,7,55458,19,1,6519,27606,8
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Graph (trivial) has 139 edges and 174 vertex of which 9 / 174 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 168 transition count 2343
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 45 rules applied. Total rules applied 76 place count 138 transition count 2328
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 84 place count 130 transition count 2328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 84 place count 130 transition count 2317
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 119 transition count 2317
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 122 place count 103 transition count 1577
Ensure Unique test removed 5 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 143 place count 98 transition count 1577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 143 place count 98 transition count 1576
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 97 transition count 1576
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 152 place count 90 transition count 245
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 160 place count 89 transition count 245
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 164 place count 85 transition count 237
Iterating global reduction 3 with 4 rules applied. Total rules applied 168 place count 85 transition count 237
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 218 place count 60 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 220 place count 60 transition count 210
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 223 place count 57 transition count 203
Iterating global reduction 4 with 3 rules applied. Total rules applied 226 place count 57 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 231 place count 57 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 235 place count 55 transition count 196
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 55 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 54 transition count 195
Applied a total of 238 rules in 130 ms. Remains 54 /174 variables (removed 120) and now considering 195/2380 (removed 2185) transitions.
[2026-05-31 23:27:27] [INFO ] Flow matrix only has 190 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11453414777561784023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1381565898909107622.kers'
[2026-05-31 23:27:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11453414777561784023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1381565898909107622.kers]
Normalized transition count is 189 out of 190 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 54 cols 2248 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-31 23:27:27] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1381565898909107622.kers
Total runtime 3 ms.
[2026-05-31 23:27:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-31 23:27:27] [INFO ] Flow matrix only has 190 transitions (discarded 5 similar events)
[2026-05-31 23:27:27] [INFO ] Invariant cache hit.
[2026-05-31 23:27:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 23:27:27] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2026-05-31 23:27:27] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2026-05-31 23:27:27] [INFO ] Flow matrix only has 190 transitions (discarded 5 similar events)
[2026-05-31 23:27:27] [INFO ] Invariant cache hit.
[2026-05-31 23:27:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 189/243 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 1/244 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/244 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 67 constraints, problems are : Problem set: 0 solved, 182 unsolved in 11775 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 189/243 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 182/248 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 1/244 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/244 variables, and 249 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42285ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 42286ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/174 places, 195/2380 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42644 ms. Remains : 54/174 places, 195/2380 transitions.
[2026-05-31 23:28:09] [INFO ] Flatten gal took : 16 ms
[2026-05-31 23:28:10] [INFO ] Flatten gal took : 17 ms
[2026-05-31 23:28:10] [INFO ] Input system was already deterministic with 195 transitions.
[2026-05-31 23:28:10] [INFO ] Flatten gal took : 16 ms
[2026-05-31 23:28:10] [INFO ] Flatten gal took : 19 ms
[2026-05-31 23:28:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2920954984260094947.gal : 4 ms
[2026-05-31 23:28:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17952811233607007751.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2920954984260094947.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17952811233607007751.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17952811233607007751.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 608
RANDOM walk for 40000 steps (8 resets) in 1226 ms. (32 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :608 after 704
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :704 after 2992
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2992 after 12032
BEST_FIRST walk for 40002 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.54033e+07,0.285678,8272,2,420,11,6033,7,0,419,4464,0
Total reachable state count : 35403264

Verifying 1 reachability properties.
Reachability property ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-14 is true.
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-14,1,0.28792,8520,2,55,11,6033,7,0,434,4464,0
Interrupted probabilistic random walk after 1802311 steps, run timeout after 3001 ms. (steps per millisecond=600 ) properties seen :0 out of 1
Probabilistic random walk after 1802311 steps, saw 259942 distinct states, run finished after 3001 ms. (steps per millisecond=600 ) properties seen :0
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 2380/2380 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 161 transition count 1731
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 161 transition count 1731
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 153 transition count 462
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 153 transition count 462
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 148 transition count 424
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 148 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 147 transition count 360
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 147 transition count 360
Applied a total of 54 rules in 34 ms. Remains 147 /174 variables (removed 27) and now considering 360/2380 (removed 2020) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9558068634413061014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11667316569919744345.kers'
[2026-05-31 23:28:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9558068634413061014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11667316569919744345.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 360 rows 147 cols 3399 entries
Finished phase 1 with 127 SingleSign rule and 2 generalized
[2026-05-31 23:28:13] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11667316569919744345.kers
Total runtime 6 ms.
[2026-05-31 23:28:13] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-31 23:28:13] [INFO ] Invariant cache hit.
[2026-05-31 23:28:14] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2026-05-31 23:28:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/507 variables, 147/166 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/507 variables, and 166 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 359/295 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/507 variables, 147/166 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 295/461 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 7/468 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 507/507 variables, and 468 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 359/295 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60611ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 60614ms
Starting structural reductions in LTL mode, iteration 1 : 147/174 places, 360/2380 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61311 ms. Remains : 147/174 places, 360/2380 transitions.
[2026-05-31 23:29:14] [INFO ] Flatten gal took : 18 ms
[2026-05-31 23:29:14] [INFO ] Flatten gal took : 19 ms
[2026-05-31 23:29:14] [INFO ] Input system was already deterministic with 360 transitions.
[2026-05-31 23:29:14] [INFO ] Flatten gal took : 18 ms
[2026-05-31 23:29:14] [INFO ] Flatten gal took : 18 ms
[2026-05-31 23:29:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4308575497745942770.gal : 3 ms
[2026-05-31 23:29:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3899015530455396555.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/CTLFireability4308575497745942770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3899015530455396555.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.21666e+10,1.83014,46912,2,13585,5,159157,6,0,950,127578,0


Converting to forward existential form...Done !
original formula: AX(AX(EF(((((p12==1)&&(p35==1))&&((p50==1)&&(p73==1)))&&(((p99==1)&&(p111==1))&&(p165==1))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U ((((p12==1)&&(p35==1))&&((p50==1)&&(p73==1)))&&(((p99==1)&&(p111==1))&&(p165==1)))))...165
Reverse transition relation is NOT exact ! Due to transitions t13, t17, t20, t28, t68, t71, t78, t84, t87, t90, t91, t93, t95, t96, t97, t100, t101, t104, ...723
Detected timeout of ITS tools.
[2026-05-31 23:29:44] [INFO ] Flatten gal took : 18 ms
[2026-05-31 23:29:44] [INFO ] Applying decomposition
[2026-05-31 23:29:44] [INFO ] Flatten gal took : 18 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/graph15699055008630764985.txt' '-o' '/tmp/graph15699055008630764985.bin' '-w' '/tmp/graph15699055008630764985.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15699055008630764985.bin' '-l' '-1' '-v' '-w' '/tmp/graph15699055008630764985.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:29:45] [INFO ] Decomposing Gal with order
[2026-05-31 23:29:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:29:45] [INFO ] Removed a total of 156 redundant transitions.
[2026-05-31 23:29:45] [INFO ] Flatten gal took : 31 ms
[2026-05-31 23:29:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 2 ms.
[2026-05-31 23:29:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17866036668088187446.gal : 4 ms
[2026-05-31 23:29:45] [INFO ] Time to serialize properties into /tmp/CTLFireability435103527378760350.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/CTLFireability17866036668088187446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability435103527378760350.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-31 23:30:15] [INFO ] Flatten gal took : 288 ms
[2026-05-31 23:30:15] [INFO ] Flatten gal took : 298 ms
[2026-05-31 23:30:15] [INFO ] Applying decomposition
[2026-05-31 23:30:16] [INFO ] Flatten gal took : 194 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/graph16952265315041046084.txt' '-o' '/tmp/graph16952265315041046084.bin' '-w' '/tmp/graph16952265315041046084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16952265315041046084.bin' '-l' '-1' '-v' '-w' '/tmp/graph16952265315041046084.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:30:16] [INFO ] Decomposing Gal with order
[2026-05-31 23:30:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:30:17] [INFO ] Removed a total of 8303 redundant transitions.
[2026-05-31 23:30:17] [INFO ] Flatten gal took : 507 ms
[2026-05-31 23:30:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 734 labels/synchronizations in 57 ms.
[2026-05-31 23:30:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15764458775113504272.gal : 10 ms
[2026-05-31 23:30:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7124575942960803060.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/CTLFireability15764458775113504272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7124575942960803060.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 7 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.08307e+11,882.224,8509932,9869,14602,770731,814097,3880,8.25668e+07,775,5.38773e+07,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-31 23:58:50] [INFO ] Applying decomposition
[2026-05-31 23:58:50] [INFO ] Flatten gal took : 189 ms
[2026-05-31 23:58:50] [INFO ] Decomposing Gal with order
[2026-05-31 23:58:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:58:51] [INFO ] Removed a total of 16805 redundant transitions.
[2026-05-31 23:58:51] [INFO ] Flatten gal took : 405 ms
[2026-05-31 23:58:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 44 ms.
[2026-05-31 23:58:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1322262212976372163.gal : 2 ms
[2026-05-31 23:58:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8171896214803574894.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/CTLFireability1322262212976372163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8171896214803574894.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 7 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.08307e+11,0.188497,10696,432,332,12055,1866,265,33710,222,8219,0


Converting to forward existential form...Done !
original formula: EF((E((!(((((i0.i0.i0.i0.i0.i0.u7.p17==1)&&(i0.i0.i0.i0.i0.i0.u8.p36==1))&&((i0.i0.i0.i0.i0.u9.p51==1)&&(i0.i0.i0.i0.u10.p70==1)))&&(((i0...1294
=> equivalent forward existential formula: ([(FwdU(((((FwdU(FwdU(Init,TRUE),(!(((((i0.i0.i0.i0.i0.i0.u7.p17==1)&&(i0.i0.i0.i0.i0.i0.u8.p36==1))&&((i0.i0.i0...1397
Reverse transition relation is NOT exact ! Due to transitions i0.t1774, i0.i0.u12.t98, i0.i0.u12.t1605, i0.i0.u12.t1606, i0.i0.i0.t99, i0.i0.i0.u11.t102, i...898
(forward)formula 0,1,0.457931,17452,1,0,23195,5848,3000,60239,1484,20013,44602
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EG(((EF(((((i0.i0.i0.i0.i0.i0.u7.p17==1)&&(i0.i0.i0.i0.i0.i0.u8.p36==1))&&((i0.i0.i0.i0.i0.u9.p62==1)&&(i0.i0.i0.i0.u10.p74==1)))&&(((...559
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((E(TRUE U ((((i0.i0.i0.i0.i0.i0.u7.p17==1)&&(i0.i0.i0.i0.i0.i0.u8.p36==1))&&((i0.i0.i0.i0...621
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 1,1,0.579364,21980,1,0,29449,9267,3159,80943,1520,45156,49091
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((EX(((((i0.i0.i0.i0.i0.i0.u7.p16==0)||(i0.i0.i0.i0.i0.i0.u8.p31==0))||((i0.i0.i0.i0.i0.u9.p54==0)||(i0.i0.i0.i0.u10.p80==0)))||(((i0.i...437
=> equivalent forward existential formula: [((EY(Init) * EX(((((i0.i0.i0.i0.i0.i0.u7.p16==0)||(i0.i0.i0.i0.i0.i0.u8.p31==0))||((i0.i0.i0.i0.i0.u9.p54==0)||...494
(forward)formula 2,0,9.43229,244836,1,0,399335,17546,3453,1.62218e+06,1662,83060,193324
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((E(A(EX(((((i0.i0.i0.i0.i0.i0.u7.p12==1)&&(i0.i0.i0.i0.i0.i0.u8.p31==1))&&((i0.i0.i0.i0.i0.u9.p54==1)&&(i0.i0.i0.i0.u10.p73==1)))&&(((...1121
=> equivalent forward existential formula: [FwdG(Init,(E(!((E(!(!(E(TRUE U !((i0.i0.i0.u11.p103==1))))) U (!(EX(((((i0.i0.i0.i0.i0.i0.u7.p12==1)&&(i0.i0.i0...1293
(forward)formula 3,1,250.459,2207612,1,0,2.95436e+06,67555,482,1.66425e+07,576,500315,210699
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (A(A(AG(E(((((i0.i0.i0.i0.i0.i0.u7.p24==1)&&(i0.i0.i0.i0.i0.i0.u8.p32==1))&&((i0.i0.i0.i0.i0.u9.p55==1)&&(i0.i0.i0.i0.u10.p74==1)))&&(((i...4696
=> equivalent forward existential formula: ([((Init * !(EG(!(((E((((((((i0.i0.i0.i0.i0.i0.u7.p13==1)&&(i0.i0.i0.i0.i0.i0.u8.p43==1))&&((i0.i0.i0.i0.i0.u9.p...13759
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 1
Fast SCC detection found an SCC at level 2
(forward)formula 4,1,252.264,2207612,1,0,2.95436e+06,89172,2231,1.66425e+07,1053,584416,243644
FORMULA ErlangenMainframeV1-PT-bP06C06-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ErlangenMainframeV1-PT-bP06C06"
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 ErlangenMainframeV1-PT-bP06C06, 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 r338-smll-178021499100090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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