fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r338-smll-178021499300409
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for FileSystem-PT-N02I10B08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16199.892 3600000.00 3660145.00 32399.80 TTFFTFFFFFTTF??T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499300409.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 FileSystem-PT-N02I10B08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300409
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 5.8K May 27 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 27 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 27 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 32K May 27 10:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 27 10:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 27 10:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 27 10:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 21K May 27 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K May 27 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 27 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 27 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 27 10:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K May 27 10:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 191K Jun 10 11:57 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 FileSystem-PT-N02I10B08-CTLCardinality-2024-00
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-01
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-02
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-03
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-04
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-05
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-06
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-07
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-08
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-09
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-10
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-11
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-12
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-13
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-14
FORMULA_NAME FileSystem-PT-N02I10B08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781100333080

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N02I10B08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 14:05:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 14:05:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 14:05:36] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2026-06-10 14:05:36] [INFO ] Transformed 455 places.
[2026-06-10 14:05:36] [INFO ] Transformed 420 transitions.
[2026-06-10 14:05:36] [INFO ] Parsed PT model containing 455 places and 420 transitions and 1490 arcs in 474 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Reduce places removed 10 places and 0 transitions.
Support contains 82 out of 445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 420/420 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 384 transition count 420
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 105 place count 340 transition count 376
Iterating global reduction 1 with 44 rules applied. Total rules applied 149 place count 340 transition count 376
Applied a total of 149 rules in 142 ms. Remains 340 /445 variables (removed 105) and now considering 376/420 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3208375773769067116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2768143782446762119.kers'
[2026-06-10 14:05:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3208375773769067116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2768143782446762119.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 376 rows 332 cols 1057 entries
Finished phase 1 with 322 SingleSign rule and 0 generalized
[2026-06-10 14:05:36] [INFO ] Computed 18 invariants in 7 ms
Computed 18 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2768143782446762119.kers
Total runtime 9 ms.
[2026-06-10 14:05:37] [INFO ] Implicit Places using invariants in 974 ms returned []
[2026-06-10 14:05:37] [INFO ] Invariant cache hit.
[2026-06-10 14:05:38] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:05:39] [INFO ] Implicit Places using invariants and state equation in 1784 ms returned []
Implicit Place search using SMT with State Equation took 2825 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2026-06-10 14:05:39] [INFO ] Invariant cache hit.
[2026-06-10 14:05:39] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 11/321 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 366 unsolved
SMT process timed out in 30312ms, After SMT, problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 30343ms
Starting structural reductions in LTL mode, iteration 1 : 340/445 places, 376/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33389 ms. Remains : 340/445 places, 376/420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Applied a total of 0 rules in 16 ms. Remains 340 /340 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2026-06-10 14:06:09] [INFO ] Invariant cache hit.
[2026-06-10 14:06:10] [INFO ] Implicit Places using invariants in 640 ms returned []
[2026-06-10 14:06:10] [INFO ] Invariant cache hit.
[2026-06-10 14:06:10] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:06:11] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2173 ms. Remains : 340/340 places, 376/376 transitions.
Support contains 82 out of 340 places after structural reductions.
[2026-06-10 14:06:12] [INFO ] Flatten gal took : 135 ms
[2026-06-10 14:06:12] [INFO ] Flatten gal took : 72 ms
[2026-06-10 14:06:12] [INFO ] Input system was already deterministic with 376 transitions.
Support contains 76 out of 340 places (down from 82) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2561 ms. (15 steps per ms) remains 31/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 111 ms. (35 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 99 ms. (40 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 27/27 properties
[2026-06-10 14:06:14] [INFO ] Invariant cache hit.
[2026-06-10 14:06:14] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 287/326 variables, 11/11 constraints. Problems are: Problem set: 14 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/11 constraints. Problems are: Problem set: 14 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 7/333 variables, 7/18 constraints. Problems are: Problem set: 14 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/18 constraints. Problems are: Problem set: 14 solved, 13 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 5 (OVERLAPS) 376/709 variables, 333/351 constraints. Problems are: Problem set: 20 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 80/431 constraints. Problems are: Problem set: 20 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/709 variables, 0/431 constraints. Problems are: Problem set: 20 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 7/716 variables, 7/438 constraints. Problems are: Problem set: 20 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/716 variables, 0/438 constraints. Problems are: Problem set: 20 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/716 variables, 0/438 constraints. Problems are: Problem set: 20 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 716/716 variables, and 438 constraints, problems are : Problem set: 20 solved, 7 unsolved in 1714 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 340/340 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 301/316 variables, 7/7 constraints. Problems are: Problem set: 20 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/716 variables, and 24 constraints, problems are : Problem set: 20 solved, 7 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/18 constraints, State Equation: 0/340 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/27 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6764ms problems are : Problem set: 20 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 340/340 places, 376/376 transitions.
Graph (complete) has 805 edges and 340 vertex of which 327 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.3 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 327 transition count 366
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 317 transition count 366
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 41 place count 297 transition count 346
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 297 transition count 346
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 231 place count 212 transition count 261
Free-agglomeration rule (complex) applied 75 times.
Iterating global reduction 2 with 75 rules applied. Total rules applied 306 place count 212 transition count 186
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 382 place count 136 transition count 186
Applied a total of 382 rules in 142 ms. Remains 136 /340 variables (removed 204) and now considering 186/376 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 136/340 places, 186/376 transitions.
RANDOM walk for 40000 steps (8 resets) in 788 ms. (50 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 349 ms. (114 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 194 ms. (205 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 208 ms. (191 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 5/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-770528555093873711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14423992084599009399.kers'
[2026-06-10 14:06:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-770528555093873711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14423992084599009399.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 186 rows 127 cols 501 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-06-10 14:06:21] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14423992084599009399.kers
Total runtime 3 ms.
[2026-06-10 14:06:21] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/133 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 186/319 variables, 133/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 80/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 3/322 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 233 constraints, problems are : Problem set: 0 solved, 5 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 136/136 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 113/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 10/133 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 186/319 variables, 133/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 80/253 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 4/257 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/257 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3/322 variables, 3/260 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/322 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 260 constraints, problems are : Problem set: 1 solved, 4 unsolved in 4383 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 136/136 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4845ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 0 properties in 854 ms.
Support contains 8 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 186/186 transitions.
Graph (complete) has 501 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 14 place count 126 transition count 180
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 126 transition count 178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 124 transition count 178
Applied a total of 18 rules in 26 ms. Remains 124 /136 variables (removed 12) and now considering 178/186 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 124/136 places, 178/186 transitions.
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
Probably explored full state space saw : 64085 states, properties seen :2
Probabilistic random walk after 229303 steps, saw 64085 distinct states, run finished after 1420 ms. (steps per millisecond=161 ) properties seen :2
Explored full state space saw : 64085 states, properties seen :0
Exhaustive walk after 229303 steps, saw 64085 distinct states, run finished after 1000 ms. (steps per millisecond=229 ) properties seen :0
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 14:06:29] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-06-10 14:06:29] [INFO ] Flatten gal took : 31 ms
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 14:06:29] [INFO ] Flatten gal took : 33 ms
[2026-06-10 14:06:30] [INFO ] Input system was already deterministic with 376 transitions.
Support contains 31 out of 340 places (down from 34) after GAL structural reductions.
Computed a total of 92 stabilizing places and 136 stable transitions
Graph (complete) has 813 edges and 340 vertex of which 321 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Graph (complete) has 813 edges and 340 vertex of which 322 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 322 transition count 366
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 312 transition count 366
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 48 place count 285 transition count 339
Iterating global reduction 2 with 27 rules applied. Total rules applied 75 place count 285 transition count 339
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 243 place count 201 transition count 255
Applied a total of 243 rules in 51 ms. Remains 201 /340 variables (removed 139) and now considering 255/376 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12644920312933031910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11717321396302205854.kers'
[2026-06-10 14:06:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12644920312933031910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11717321396302205854.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 255 rows 193 cols 841 entries
Finished phase 1 with 183 SingleSign rule and 0 generalized
[2026-06-10 14:06:30] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11717321396302205854.kers
Total runtime 2 ms.
[2026-06-10 14:06:30] [INFO ] Implicit Places using invariants in 420 ms returned []
[2026-06-10 14:06:30] [INFO ] Invariant cache hit.
[2026-06-10 14:06:30] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:06:31] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2026-06-10 14:06:31] [INFO ] Redundant transitions in 14 ms returned []
Running 245 sub problems to find dead transitions.
[2026-06-10 14:06:31] [INFO ] Invariant cache hit.
[2026-06-10 14:06:31] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 11/200 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 200/456 variables, and 58 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/201 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 11/200 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 38/58 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 11 (OVERLAPS) 255/455 variables, 200/271 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 80/351 constraints. Problems are: Problem set: 12 solved, 233 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/455 variables, 222/573 constraints. Problems are: Problem set: 12 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/456 variables, and 573 constraints, problems are : Problem set: 12 solved, 233 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 200/201 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 222/245 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 12 solved, 233 unsolved
Search for dead transitions found 12 dead transitions in 60124ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 201/340 places, 243/376 transitions.
Applied a total of 0 rules in 13 ms. Remains 201 /201 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2026-06-10 14:07:31] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61498 ms. Remains : 201/340 places, 243/376 transitions.
[2026-06-10 14:07:31] [INFO ] Flatten gal took : 20 ms
[2026-06-10 14:07:31] [INFO ] Flatten gal took : 18 ms
[2026-06-10 14:07:31] [INFO ] Input system was already deterministic with 243 transitions.
[2026-06-10 14:07:31] [INFO ] Flatten gal took : 16 ms
[2026-06-10 14:07:31] [INFO ] Flatten gal took : 15 ms
[2026-06-10 14:07:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality17640645047632374744.gal : 13 ms
[2026-06-10 14:07:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality8344333983898601793.ctl : 4 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/CTLCardinality17640645047632374744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8344333983898601793.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,212005,2.48714,63208,2,13489,5,152519,6,0,1013,249132,0


Converting to forward existential form...Done !
original formula: EG(((beginloop_5_13<1)&&((loop_6_14<=loop_6_11)||(loop_4_15<=inode_10_12))))
=> equivalent forward existential formula: [FwdG(Init,((beginloop_5_13<1)&&((loop_6_14<=loop_6_11)||(loop_4_15<=inode_10_12))))] != FALSE
Hit Full ! (commute/partial/dont) 234/9/9
(forward)formula 0,1,21.1615,430524,1,0,66,1.74564e+06,19,2,5630,1.57702e+06,65
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 321 transition count 376
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 47 place count 293 transition count 348
Iterating global reduction 1 with 28 rules applied. Total rules applied 75 place count 293 transition count 348
Applied a total of 75 rules in 17 ms. Remains 293 /340 variables (removed 47) and now considering 348/376 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9939358867108092748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15532865664543717504.kers'
[2026-06-10 14:07:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9939358867108092748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15532865664543717504.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 348 rows 285 cols 954 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-06-10 14:07:53] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15532865664543717504.kers
Total runtime 5 ms.
[2026-06-10 14:07:53] [INFO ] Implicit Places using invariants in 672 ms returned []
[2026-06-10 14:07:53] [INFO ] Invariant cache hit.
[2026-06-10 14:07:54] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:07:55] [INFO ] Implicit Places using invariants and state equation in 2067 ms returned []
Implicit Place search using SMT with State Equation took 2742 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-06-10 14:07:55] [INFO ] Invariant cache hit.
[2026-06-10 14:07:55] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 11/293 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/641 variables, and 58 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 11/293 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 35/58 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/641 variables, and 86 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/338 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 293/340 places, 348/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62875 ms. Remains : 293/340 places, 348/376 transitions.
[2026-06-10 14:08:55] [INFO ] Flatten gal took : 17 ms
[2026-06-10 14:08:55] [INFO ] Flatten gal took : 17 ms
[2026-06-10 14:08:56] [INFO ] Input system was already deterministic with 348 transitions.
[2026-06-10 14:08:56] [INFO ] Flatten gal took : 14 ms
[2026-06-10 14:08:56] [INFO ] Flatten gal took : 14 ms
[2026-06-10 14:08:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality14544231541864154624.gal : 6 ms
[2026-06-10 14:08:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality10484652133626166888.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/CTLCardinality14544231541864154624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10484652133626166888.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,533227,5.65762,103100,2,34480,5,267949,6,0,1489,443225,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 14:09:26] [INFO ] Flatten gal took : 22 ms
[2026-06-10 14:09:26] [INFO ] Applying decomposition
[2026-06-10 14:09:26] [INFO ] Flatten gal took : 25 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/graph17723981327867617699.txt' '-o' '/tmp/graph17723981327867617699.bin' '-w' '/tmp/graph17723981327867617699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17723981327867617699.bin' '-l' '-1' '-v' '-w' '/tmp/graph17723981327867617699.weights' '-q' '0' '-e' '0.001'
[2026-06-10 14:09:26] [INFO ] Decomposing Gal with order
[2026-06-10 14:09:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 14:09:26] [INFO ] Removed a total of 334 redundant transitions.
[2026-06-10 14:09:26] [INFO ] Flatten gal took : 172 ms
[2026-06-10 14:09:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 23 ms.
[2026-06-10 14:09:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality10235166659336190028.gal : 10 ms
[2026-06-10 14:09:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality11843649166332489604.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/CTLCardinality10235166659336190028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11843649166332489604.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,533227,5.65818,134420,2,48350,5,355204,6,0,1495,576411,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Graph (complete) has 813 edges and 340 vertex of which 321 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.3 ms
Discarding 19 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 321 transition count 366
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 311 transition count 366
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 49 place count 283 transition count 338
Iterating global reduction 2 with 28 rules applied. Total rules applied 77 place count 283 transition count 338
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 249 place count 197 transition count 252
Applied a total of 249 rules in 40 ms. Remains 197 /340 variables (removed 143) and now considering 252/376 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4420643168210705677.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16450885666828485047.kers'
[2026-06-10 14:09:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4420643168210705677.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16450885666828485047.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 252 rows 189 cols 834 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-06-10 14:09:56] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16450885666828485047.kers
Total runtime 3 ms.
[2026-06-10 14:09:57] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-06-10 14:09:57] [INFO ] Invariant cache hit.
[2026-06-10 14:09:57] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:09:58] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
[2026-06-10 14:09:58] [INFO ] Redundant transitions in 5 ms returned []
Running 242 sub problems to find dead transitions.
[2026-06-10 14:09:58] [INFO ] Invariant cache hit.
[2026-06-10 14:09:58] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 11/197 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 252/449 variables, 197/229 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 80/309 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/449 variables, and 309 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 11/197 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 252/449 variables, 197/229 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD152 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 80/309 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 230/539 constraints. Problems are: Problem set: 12 solved, 230 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/449 variables, and 539 constraints, problems are : Problem set: 12 solved, 230 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 230/242 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 12 solved, 230 unsolved
Search for dead transitions found 12 dead transitions in 60100ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 197/340 places, 240/376 transitions.
Applied a total of 0 rules in 30 ms. Remains 197 /197 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2026-06-10 14:10:58] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61590 ms. Remains : 197/340 places, 240/376 transitions.
[2026-06-10 14:10:58] [INFO ] Flatten gal took : 30 ms
[2026-06-10 14:10:58] [INFO ] Flatten gal took : 30 ms
[2026-06-10 14:10:58] [INFO ] Input system was already deterministic with 240 transitions.
[2026-06-10 14:10:58] [INFO ] Flatten gal took : 45 ms
RANDOM walk for 20152 steps (4 resets) in 116 ms. (172 steps per ms) remains 0/1 properties
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-10 14:10:58] [INFO ] Flatten gal took : 24 ms
[2026-06-10 14:10:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5802555058499685173.gal : 5 ms
[2026-06-10 14:10:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality86718779821801885.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/ReachabilityCardinality5802555058499685173.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality86718779821801885.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Graph (complete) has 813 edges and 340 vertex of which 322 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 322 transition count 366
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 312 transition count 366
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 46 place count 287 transition count 341
Iterating global reduction 2 with 25 rules applied. Total rules applied 71 place count 287 transition count 341
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 247 place count 199 transition count 253
Applied a total of 247 rules in 64 ms. Remains 199 /340 variables (removed 141) and now considering 253/376 (removed 123) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11673475538214131836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1846693220215319113.kers'
[2026-06-10 14:10:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11673475538214131836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1846693220215319113.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 253 rows 191 cols 837 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-06-10 14:10:58] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1846693220215319113.kers
Total runtime 4 ms.
[2026-06-10 14:10:59] [INFO ] Implicit Places using invariants in 463 ms returned []
[2026-06-10 14:10:59] [INFO ] Invariant cache hit.
[2026-06-10 14:10:59] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:10:59] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2026-06-10 14:10:59] [INFO ] Redundant transitions in 2 ms returned []
Running 243 sub problems to find dead transitions.
[2026-06-10 14:11:00] [INFO ] Invariant cache hit.
[2026-06-10 14:11:00] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 11/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 198/452 variables, and 57 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/199 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 11/198 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 36/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 253/451 variables, 198/269 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD152 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 80/349 constraints. Problems are: Problem set: 12 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 220/569 constraints. Problems are: Problem set: 12 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/452 variables, and 569 constraints, problems are : Problem set: 12 solved, 231 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 198/199 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 220/243 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 12 solved, 231 unsolved
Search for dead transitions found 12 dead transitions in 60065ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 199/340 places, 241/376 transitions.
Applied a total of 0 rules in 10 ms. Remains 199 /199 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2026-06-10 14:12:00] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61286 ms. Remains : 199/340 places, 241/376 transitions.
[2026-06-10 14:12:00] [INFO ] Flatten gal took : 9 ms
[2026-06-10 14:12:00] [INFO ] Flatten gal took : 9 ms
[2026-06-10 14:12:00] [INFO ] Input system was already deterministic with 241 transitions.
[2026-06-10 14:12:00] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:12:00] [INFO ] Flatten gal took : 9 ms
[2026-06-10 14:12:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality11627899545328512140.gal : 2 ms
[2026-06-10 14:12:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality7326103211668809699.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/CTLCardinality11627899545328512140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7326103211668809699.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,253005,5.22368,98944,2,16069,5,220872,6,0,1003,428333,0


Converting to forward existential form...Done !
original formula: AF(AG(((inode_8_17<=0)||((endloop_1_13>1)&&(endloop_7_11<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((inode_8_17<=0)||((endloop_1_13>1)&&(endloop_7_11<1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t93, t94, t95, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108, t109...623
Detected timeout of ITS tools.
[2026-06-10 14:12:30] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:12:30] [INFO ] Applying decomposition
[2026-06-10 14:12:30] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5996310053564502301.txt' '-o' '/tmp/graph5996310053564502301.bin' '-w' '/tmp/graph5996310053564502301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5996310053564502301.bin' '-l' '-1' '-v' '-w' '/tmp/graph5996310053564502301.weights' '-q' '0' '-e' '0.001'
[2026-06-10 14:12:30] [INFO ] Decomposing Gal with order
[2026-06-10 14:12:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 14:12:30] [INFO ] Removed a total of 63 redundant transitions.
[2026-06-10 14:12:30] [INFO ] Flatten gal took : 33 ms
[2026-06-10 14:12:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 14 ms.
[2026-06-10 14:12:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7809666432532439517.gal : 9 ms
[2026-06-10 14:12:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality10609727373075430335.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/CTLCardinality7809666432532439517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10609727373075430335.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,253005,4.6381,112708,1663,5453,95586,172845,593,237103,353,759236,0


Converting to forward existential form...Done !
original formula: AF(AG(((i7.u6.inode_8_17<=0)||((i2.u4.endloop_1_13>1)&&(u12.endloop_7_11<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((i7.u6.inode_8_17<=0)||((i2.u4.endloop_1_13>1)&&(u12.endloop_7_11<1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t93, t105, t122, t126, t141, t150, t160, t176, t178, t208, t210, t220, t230, t240, u12.t94, u...367
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,20.3468,419324,1,0,522888,427958,2643,1.11534e+06,2688,2.54545e+06,829727
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Graph (complete) has 813 edges and 340 vertex of which 321 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 321 transition count 366
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 311 transition count 366
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 49 place count 283 transition count 338
Iterating global reduction 2 with 28 rules applied. Total rules applied 77 place count 283 transition count 338
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 251 place count 196 transition count 251
Applied a total of 251 rules in 37 ms. Remains 196 /340 variables (removed 144) and now considering 251/376 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-541424921136983773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2258766040656500830.kers'
[2026-06-10 14:12:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-541424921136983773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2258766040656500830.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 251 rows 188 cols 832 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-06-10 14:12:50] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2258766040656500830.kers
Total runtime 3 ms.
[2026-06-10 14:12:51] [INFO ] Implicit Places using invariants in 393 ms returned []
[2026-06-10 14:12:51] [INFO ] Invariant cache hit.
[2026-06-10 14:12:51] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:12:52] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
[2026-06-10 14:12:52] [INFO ] Redundant transitions in 1 ms returned []
Running 241 sub problems to find dead transitions.
[2026-06-10 14:12:52] [INFO ] Invariant cache hit.
[2026-06-10 14:12:52] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/447 variables, and 55 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/196 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 37/55 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 251/447 variables, 196/254 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 80/334 constraints. Problems are: Problem set: 12 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 229/563 constraints. Problems are: Problem set: 12 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 563 constraints, problems are : Problem set: 12 solved, 229 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/241 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60076ms problems are : Problem set: 12 solved, 229 unsolved
Search for dead transitions found 12 dead transitions in 60077ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 196/340 places, 239/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 196 /196 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-06-10 14:13:52] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61580 ms. Remains : 196/340 places, 239/376 transitions.
[2026-06-10 14:13:52] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:13:52] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:13:52] [INFO ] Input system was already deterministic with 239 transitions.
[2026-06-10 14:13:52] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:13:52] [INFO ] Flatten gal took : 7 ms
[2026-06-10 14:13:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality10763657640484316133.gal : 3 ms
[2026-06-10 14:13:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality11800843180841234516.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/CTLCardinality10763657640484316133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11800843180841234516.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,206690,2.98019,60040,2,12672,5,143967,6,0,992,234192,0


Converting to forward existential form...Done !
original formula: AG(EF((loop_9_17>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (loop_9_17>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t94, t95, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108,...622
(forward)formula 0,0,19.2254,352000,1,0,554,1.79177e+06,499,256,7156,1.22139e+06,521
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Graph (complete) has 813 edges and 340 vertex of which 321 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 321 transition count 366
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 311 transition count 366
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 49 place count 283 transition count 338
Iterating global reduction 2 with 28 rules applied. Total rules applied 77 place count 283 transition count 338
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 251 place count 196 transition count 251
Applied a total of 251 rules in 28 ms. Remains 196 /340 variables (removed 144) and now considering 251/376 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1528174499477661748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1885603755315766694.kers'
[2026-06-10 14:14:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1528174499477661748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1885603755315766694.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 251 rows 188 cols 832 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-06-10 14:14:11] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1885603755315766694.kers
Total runtime 3 ms.
[2026-06-10 14:14:12] [INFO ] Implicit Places using invariants in 395 ms returned []
[2026-06-10 14:14:12] [INFO ] Invariant cache hit.
[2026-06-10 14:14:12] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:14:13] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
[2026-06-10 14:14:13] [INFO ] Redundant transitions in 1 ms returned []
Running 241 sub problems to find dead transitions.
[2026-06-10 14:14:13] [INFO ] Invariant cache hit.
[2026-06-10 14:14:13] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 251/447 variables, 196/232 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 80/312 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 312 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 251/447 variables, 196/247 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 80/327 constraints. Problems are: Problem set: 12 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 229/556 constraints. Problems are: Problem set: 12 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 556 constraints, problems are : Problem set: 12 solved, 229 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/241 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 12 solved, 229 unsolved
Search for dead transitions found 12 dead transitions in 60075ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 196/340 places, 239/376 transitions.
Applied a total of 0 rules in 8 ms. Remains 196 /196 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-06-10 14:15:13] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61646 ms. Remains : 196/340 places, 239/376 transitions.
[2026-06-10 14:15:13] [INFO ] Flatten gal took : 7 ms
[2026-06-10 14:15:13] [INFO ] Flatten gal took : 7 ms
[2026-06-10 14:15:13] [INFO ] Input system was already deterministic with 239 transitions.
[2026-06-10 14:15:13] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:15:13] [INFO ] Flatten gal took : 12 ms
[2026-06-10 14:15:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2316502963558903189.gal : 3 ms
[2026-06-10 14:15:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality8704574976819865198.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/CTLCardinality2316502963558903189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8704574976819865198.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,206764,2.75751,61024,2,13091,5,144818,6,0,992,240513,0


Converting to forward existential form...Done !
original formula: EG(EF(AG((testbusy_3_18>beginloop_9_17))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !((testbusy_3_18>beginloop_9_17))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t92, t93, t94, t95, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108,...622
(forward)formula 0,0,20.6491,422988,1,0,591,1.81417e+06,506,244,7289,1.609e+06,549
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Graph (complete) has 813 edges and 340 vertex of which 321 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 321 transition count 366
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 311 transition count 366
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 49 place count 283 transition count 338
Iterating global reduction 2 with 28 rules applied. Total rules applied 77 place count 283 transition count 338
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 251 place count 196 transition count 251
Applied a total of 251 rules in 23 ms. Remains 196 /340 variables (removed 144) and now considering 251/376 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7843159490019034673.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12582242765274587824.kers'
[2026-06-10 14:15:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7843159490019034673.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12582242765274587824.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 251 rows 188 cols 832 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-06-10 14:15:34] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12582242765274587824.kers
Total runtime 2 ms.
[2026-06-10 14:15:34] [INFO ] Implicit Places using invariants in 336 ms returned []
[2026-06-10 14:15:34] [INFO ] Invariant cache hit.
[2026-06-10 14:15:35] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:15:35] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2026-06-10 14:15:35] [INFO ] Redundant transitions in 0 ms returned []
Running 241 sub problems to find dead transitions.
[2026-06-10 14:15:35] [INFO ] Invariant cache hit.
[2026-06-10 14:15:35] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 251/447 variables, 196/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 80/322 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 322 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 251/447 variables, 196/255 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 80/335 constraints. Problems are: Problem set: 12 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 229/564 constraints. Problems are: Problem set: 12 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 564 constraints, problems are : Problem set: 12 solved, 229 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/241 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 12 solved, 229 unsolved
Search for dead transitions found 12 dead transitions in 60071ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 196/340 places, 239/376 transitions.
Applied a total of 0 rules in 7 ms. Remains 196 /196 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-06-10 14:16:35] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 61229 ms. Remains : 196/340 places, 239/376 transitions.
[2026-06-10 14:16:35] [INFO ] Flatten gal took : 9 ms
[2026-06-10 14:16:35] [INFO ] Flatten gal took : 9 ms
[2026-06-10 14:16:35] [INFO ] Input system was already deterministic with 239 transitions.
[2026-06-10 14:16:35] [INFO ] Flatten gal took : 10 ms
[2026-06-10 14:16:35] [INFO ] Flatten gal took : 9 ms
[2026-06-10 14:16:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality14337799434660790393.gal : 4 ms
[2026-06-10 14:16:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality227589228837993790.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/CTLCardinality14337799434660790393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality227589228837993790.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,207140,2.55954,60028,2,13035,5,142245,6,0,992,235407,0


Converting to forward existential form...Done !
original formula: AF((loop_9_15>=1))
=> equivalent forward existential formula: [FwdG(Init,!((loop_9_15>=1)))] = FALSE
Hit Full ! (commute/partial/dont) 237/0/2
(forward)formula 0,0,17.4085,363056,1,0,65,1.48191e+06,20,2,5520,1.24369e+06,64
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 322 transition count 376
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 45 place count 295 transition count 349
Iterating global reduction 1 with 27 rules applied. Total rules applied 72 place count 295 transition count 349
Applied a total of 72 rules in 7 ms. Remains 295 /340 variables (removed 45) and now considering 349/376 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17621155762459498459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8110033186731237925.kers'
[2026-06-10 14:16:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17621155762459498459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8110033186731237925.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 349 rows 287 cols 958 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-06-10 14:16:53] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8110033186731237925.kers
Total runtime 4 ms.
[2026-06-10 14:16:54] [INFO ] Implicit Places using invariants in 662 ms returned []
[2026-06-10 14:16:54] [INFO ] Invariant cache hit.
[2026-06-10 14:16:54] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:16:55] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-06-10 14:16:55] [INFO ] Invariant cache hit.
[2026-06-10 14:16:55] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 11/294 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 339 unsolved
SMT process timed out in 30089ms, After SMT, problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 30092ms
Starting structural reductions in LTL mode, iteration 1 : 295/340 places, 349/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32345 ms. Remains : 295/340 places, 349/376 transitions.
[2026-06-10 14:17:25] [INFO ] Flatten gal took : 15 ms
[2026-06-10 14:17:25] [INFO ] Flatten gal took : 14 ms
[2026-06-10 14:17:25] [INFO ] Input system was already deterministic with 349 transitions.
[2026-06-10 14:17:25] [INFO ] Flatten gal took : 15 ms
[2026-06-10 14:17:25] [INFO ] Flatten gal took : 18 ms
[2026-06-10 14:17:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality2171452979815821073.gal : 5 ms
[2026-06-10 14:17:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality16097533025149215509.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/CTLCardinality2171452979815821073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16097533025149215509.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,547028,5.7624,123552,2,38733,5,321642,6,0,1495,563319,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 14:17:55] [INFO ] Flatten gal took : 9 ms
[2026-06-10 14:17:55] [INFO ] Applying decomposition
[2026-06-10 14:17:55] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8375715413154435583.txt' '-o' '/tmp/graph8375715413154435583.bin' '-w' '/tmp/graph8375715413154435583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8375715413154435583.bin' '-l' '-1' '-v' '-w' '/tmp/graph8375715413154435583.weights' '-q' '0' '-e' '0.001'
[2026-06-10 14:17:55] [INFO ] Decomposing Gal with order
[2026-06-10 14:17:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 14:17:56] [INFO ] Removed a total of 334 redundant transitions.
[2026-06-10 14:17:56] [INFO ] Flatten gal took : 28 ms
[2026-06-10 14:17:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 13 ms.
[2026-06-10 14:17:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality11858420580108386940.gal : 5 ms
[2026-06-10 14:17:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality6121270956641046831.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/CTLCardinality11858420580108386940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6121270956641046831.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,547028,15.4765,344776,2,166686,5,1.0418e+06,6,0,1511,1.15332e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 323 transition count 376
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 43 place count 297 transition count 350
Iterating global reduction 1 with 26 rules applied. Total rules applied 69 place count 297 transition count 350
Applied a total of 69 rules in 8 ms. Remains 297 /340 variables (removed 43) and now considering 350/376 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14853797497146793824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15466903213219648041.kers'
[2026-06-10 14:18:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14853797497146793824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15466903213219648041.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 350 rows 289 cols 962 entries
Finished phase 1 with 279 SingleSign rule and 0 generalized
[2026-06-10 14:18:26] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15466903213219648041.kers
Total runtime 4 ms.
[2026-06-10 14:18:26] [INFO ] Implicit Places using invariants in 368 ms returned []
[2026-06-10 14:18:26] [INFO ] Invariant cache hit.
[2026-06-10 14:18:26] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:18:27] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2026-06-10 14:18:27] [INFO ] Invariant cache hit.
[2026-06-10 14:18:27] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 11/295 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/647 variables, and 58 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/297 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (OVERLAPS) 11/295 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 32/58 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/647 variables, and 82 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/297 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/340 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 297/340 places, 350/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61591 ms. Remains : 297/340 places, 350/376 transitions.
[2026-06-10 14:19:27] [INFO ] Flatten gal took : 13 ms
[2026-06-10 14:19:27] [INFO ] Flatten gal took : 14 ms
[2026-06-10 14:19:27] [INFO ] Input system was already deterministic with 350 transitions.
[2026-06-10 14:19:27] [INFO ] Flatten gal took : 13 ms
[2026-06-10 14:19:27] [INFO ] Flatten gal took : 15 ms
[2026-06-10 14:19:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality17384624681857620723.gal : 3 ms
[2026-06-10 14:19:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality9803893041214128693.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/CTLCardinality17384624681857620723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9803893041214128693.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,567666,5.96893,123824,2,35313,5,329009,6,0,1501,549701,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 14:19:57] [INFO ] Flatten gal took : 9 ms
[2026-06-10 14:19:57] [INFO ] Applying decomposition
[2026-06-10 14:19:57] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14632247310147537115.txt' '-o' '/tmp/graph14632247310147537115.bin' '-w' '/tmp/graph14632247310147537115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14632247310147537115.bin' '-l' '-1' '-v' '-w' '/tmp/graph14632247310147537115.weights' '-q' '0' '-e' '0.001'
[2026-06-10 14:19:57] [INFO ] Decomposing Gal with order
[2026-06-10 14:19:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 14:19:58] [INFO ] Removed a total of 338 redundant transitions.
[2026-06-10 14:19:58] [INFO ] Flatten gal took : 27 ms
[2026-06-10 14:19:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 13 ms.
[2026-06-10 14:19:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality8135219168721656091.gal : 5 ms
[2026-06-10 14:19:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality2366387803477507752.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/CTLCardinality8135219168721656091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2366387803477507752.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,567666,8.47231,181720,2,55010,5,496199,6,0,1521,734513,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 321 transition count 376
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 46 place count 294 transition count 349
Iterating global reduction 1 with 27 rules applied. Total rules applied 73 place count 294 transition count 349
Applied a total of 73 rules in 6 ms. Remains 294 /340 variables (removed 46) and now considering 349/376 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12633656911567710283.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13923826680133104179.kers'
[2026-06-10 14:20:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12633656911567710283.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13923826680133104179.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 349 rows 286 cols 957 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-06-10 14:20:28] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13923826680133104179.kers
Total runtime 3 ms.
[2026-06-10 14:20:28] [INFO ] Implicit Places using invariants in 488 ms returned []
[2026-06-10 14:20:28] [INFO ] Invariant cache hit.
[2026-06-10 14:20:28] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:20:30] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-06-10 14:20:30] [INFO ] Invariant cache hit.
[2026-06-10 14:20:30] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 11/294 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 339 unsolved
SMT process timed out in 30085ms, After SMT, problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 30086ms
Starting structural reductions in LTL mode, iteration 1 : 294/340 places, 349/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31924 ms. Remains : 294/340 places, 349/376 transitions.
[2026-06-10 14:21:00] [INFO ] Flatten gal took : 7 ms
[2026-06-10 14:21:00] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:21:00] [INFO ] Input system was already deterministic with 349 transitions.
[2026-06-10 14:21:00] [INFO ] Flatten gal took : 13 ms
[2026-06-10 14:21:00] [INFO ] Flatten gal took : 14 ms
[2026-06-10 14:21:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17018414588210959772.gal : 5 ms
[2026-06-10 14:21:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality12641678441347653656.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/CTLCardinality17018414588210959772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12641678441347653656.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,533722,4.84915,107640,2,35705,5,280610,6,0,1494,483236,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 14:21:30] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:21:30] [INFO ] Applying decomposition
[2026-06-10 14:21:30] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15599254989618333452.txt' '-o' '/tmp/graph15599254989618333452.bin' '-w' '/tmp/graph15599254989618333452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15599254989618333452.bin' '-l' '-1' '-v' '-w' '/tmp/graph15599254989618333452.weights' '-q' '0' '-e' '0.001'
[2026-06-10 14:21:30] [INFO ] Decomposing Gal with order
[2026-06-10 14:21:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 14:21:30] [INFO ] Removed a total of 345 redundant transitions.
[2026-06-10 14:21:30] [INFO ] Flatten gal took : 24 ms
[2026-06-10 14:21:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 9 ms.
[2026-06-10 14:21:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality8183931741249507820.gal : 4 ms
[2026-06-10 14:21:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11601704037200279264.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/CTLCardinality8183931741249507820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11601704037200279264.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,533722,6.63631,157632,2,61427,5,503146,6,0,1514,611254,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 376/376 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 322 transition count 376
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 45 place count 295 transition count 349
Iterating global reduction 1 with 27 rules applied. Total rules applied 72 place count 295 transition count 349
Applied a total of 72 rules in 12 ms. Remains 295 /340 variables (removed 45) and now considering 349/376 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1871380577787000702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2713738917960074337.kers'
[2026-06-10 14:22:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1871380577787000702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2713738917960074337.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 349 rows 287 cols 958 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-06-10 14:22:00] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2713738917960074337.kers
Total runtime 4 ms.
[2026-06-10 14:22:00] [INFO ] Implicit Places using invariants in 477 ms returned []
[2026-06-10 14:22:00] [INFO ] Invariant cache hit.
[2026-06-10 14:22:01] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-10 14:22:02] [INFO ] Implicit Places using invariants and state equation in 1556 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-06-10 14:22:02] [INFO ] Invariant cache hit.
[2026-06-10 14:22:02] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 11/294 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 294/644 variables, and 58 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/295 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (OVERLAPS) 11/294 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 294/644 variables, and 82 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/295 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/339 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 295/340 places, 349/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62118 ms. Remains : 295/340 places, 349/376 transitions.
[2026-06-10 14:23:02] [INFO ] Flatten gal took : 7 ms
[2026-06-10 14:23:02] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:23:02] [INFO ] Input system was already deterministic with 349 transitions.
[2026-06-10 14:23:02] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:23:02] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:23:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality4190275533984125966.gal : 2 ms
[2026-06-10 14:23:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality8161604873738436861.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/CTLCardinality4190275533984125966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8161604873738436861.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,671829,5.7415,120060,2,40800,5,318734,6,0,1495,529325,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 14:23:32] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:23:32] [INFO ] Applying decomposition
[2026-06-10 14:23:32] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10500455485562983595.txt' '-o' '/tmp/graph10500455485562983595.bin' '-w' '/tmp/graph10500455485562983595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10500455485562983595.bin' '-l' '-1' '-v' '-w' '/tmp/graph10500455485562983595.weights' '-q' '0' '-e' '0.001'
[2026-06-10 14:23:32] [INFO ] Decomposing Gal with order
[2026-06-10 14:23:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 14:23:32] [INFO ] Removed a total of 341 redundant transitions.
[2026-06-10 14:23:32] [INFO ] Flatten gal took : 30 ms
[2026-06-10 14:23:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2026-06-10 14:23:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality16573282447856069312.gal : 7 ms
[2026-06-10 14:23:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality7664633048205844572.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/CTLCardinality16573282447856069312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7664633048205844572.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,671829,10.0603,220672,9529,25,244315,331,818,1.68491e+06,30,686,0


Converting to forward existential form...Done !
original formula: EG(AX(E((i1.u0.testbusy_10_11>0) U ((i1.u13.beginloop_3_11<=0)||(i2.u58.inode_7_16>=2)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E((i1.u0.testbusy_10_11>0) U ((i1.u13.beginloop_3_11<=0)||(i2.u58.inode_7_16>=2)))))))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions t197, t199, t205, t211, t212, t219, t225, t231, t246, t252, t261, t275, t277, t287, t297, t30...853
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-06-10 14:24:02] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:24:02] [INFO ] Flatten gal took : 8 ms
[2026-06-10 14:24:02] [INFO ] Applying decomposition
[2026-06-10 14:24:02] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9814241890756690442.txt' '-o' '/tmp/graph9814241890756690442.bin' '-w' '/tmp/graph9814241890756690442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9814241890756690442.bin' '-l' '-1' '-v' '-w' '/tmp/graph9814241890756690442.weights' '-q' '0' '-e' '0.001'
[2026-06-10 14:24:02] [INFO ] Decomposing Gal with order
[2026-06-10 14:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 14:24:02] [INFO ] Removed a total of 351 redundant transitions.
[2026-06-10 14:24:03] [INFO ] Flatten gal took : 26 ms
[2026-06-10 14:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 6 ms.
[2026-06-10 14:24:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality8247047523254091421.gal : 4 ms
[2026-06-10 14:24:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality5190148408485383030.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/CTLCardinality8247047523254091421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5190148408485383030.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.15244e+06,80.5686,1547632,2,408004,5,4.62863e+06,6,0,1694,6.01588e+06,0


Converting to forward existential form...Done !
original formula: AF(EX((gu34.beginloop_7_15>gu34.loop_5_14)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((gu34.beginloop_7_15>gu34.loop_5_14))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions gi2.gi0.gi0.t227, gi2.gi0.gi0.t226, gi2.gi0.gi0.t225, gi2.gi0.gi0.t223, gi2.gi0.gi0.t222, gi2...1334
(forward)formula 0,0,681.83,10658004,1,0,763,3.63705e+07,13,340,4875,2.99859e+07,204
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(EG(EF((gu117.testbusy_4_15<=gu117.inode_6_18))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U (gu117.testbusy_4_15<=gu117.inode_6_18)))))] = FALSE
(forward)formula 1,1,803.008,10729684,1,0,763,4.5304e+07,20,340,6394,2.99859e+07,215
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((EX(((gi2.gi0.gi0.gu121.loop_8_15>=1) + EF((gi2.gi0.gi1.gu80.lockb_16<1)))) + A(EX(TRUE) U AG(!(EX(TRUE))))) + AG(((AX((gi2.gi0.gi0.gu14...252
=> equivalent forward existential formula: [(EY(((FwdU((Init * !((EX(((gi2.gi0.gi0.gu121.loop_8_15>=1) + E(TRUE U (gi2.gi0.gi1.gu80.lockb_16<1)))) + !((E(!...416
(forward)formula 2,1,1266.08,11912740,1,0,763,8.50676e+07,22,340,5772,4.0975e+07,24
FORMULA FileSystem-PT-N02I10B08-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((EG(EX(((gi0.gu21.inodelist_5<2)&&(gi2.gi1.gi4.gu114.endloop_6_18<1)))) * EX(EX((gi0.gu6.beginloop_1_15<=gi0.gu6.beginloop_5_11)))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(EX(((gi0.gu21.inodelist_5<2)&&(gi2.gi1.gi4.gu114.endloop_6_18<1)))) * EX(EX((gi0.gu6.beginloop_...198
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-06-10 14:50:12] [INFO ] Flatten gal took : 13 ms
[2026-06-10 14:50:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality1218189006405984151.gal : 2 ms
[2026-06-10 14:50:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality2572213081934052152.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/CTLCardinality1218189006405984151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2572213081934052152.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 2 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.15244e+06,43.5082,869580,2,191475,5,1.84174e+06,6,0,1648,3.68837e+06,0


Converting to forward existential form...Done !
original formula: AF((EG(EX(((inodelist_5<2)&&(endloop_6_18<1)))) * EX(EX((beginloop_1_15<=beginloop_5_11)))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(EX(((inodelist_5<2)&&(endloop_6_18<1)))) * EX(EX((beginloop_1_15<=beginloop_5_11))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t181, t183, t184, t185, t186, t188, t189, t191, t193, t194, t195, t198, t200, t202, t206, t21...679
Using saturation style SCC detection

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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="FileSystem-PT-N02I10B08"
export BK_EXAMINATION="CTLCardinality"
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 FileSystem-PT-N02I10B08, examination is CTLCardinality"
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-178021499300409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N02I10B08.tgz
mv FileSystem-PT-N02I10B08 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;