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-178021499300457.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-N05I10B10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 7.8K May 27 10:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 27 10:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 27 10:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 27 10:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 43K May 27 10:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 150K May 27 10:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 27 10:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 27 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 27 10:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 27 10:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K May 27 10:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K May 27 10:50 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 236K 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-N05I10B10-CTLCardinality-2024-00
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-01
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-02
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-03
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-04
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-05
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-06
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-07
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-08
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-09
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-10
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-11
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-12
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-13
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-14
FORMULA_NAME FileSystem-PT-N05I10B10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781108241695

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-N05I10B10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 16:17:24] [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 16:17:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 16:17:24] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2026-06-10 16:17:24] [INFO ] Transformed 561 places.
[2026-06-10 16:17:24] [INFO ] Transformed 520 transitions.
[2026-06-10 16:17:24] [INFO ] Parsed PT model containing 561 places and 520 transitions and 1850 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Reduce places removed 10 places and 0 transitions.
Support contains 124 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 520/520 transitions.
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 474 transition count 520
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 129 place count 422 transition count 468
Iterating global reduction 1 with 52 rules applied. Total rules applied 181 place count 422 transition count 468
Applied a total of 181 rules in 171 ms. Remains 422 /551 variables (removed 129) and now considering 468/520 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7855585870640660588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8351968215863476081.kers'
[2026-06-10 16:17:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7855585870640660588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8351968215863476081.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 1 ms.
// Phase 1: matrix 468 rows 412 cols 1317 entries
Finished phase 1 with 400 SingleSign rule and 0 generalized
[2026-06-10 16:17:25] [INFO ] Computed 22 invariants in 9 ms
Computed 22 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-8351968215863476081.kers
Total runtime 12 ms.
[2026-06-10 16:17:26] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2026-06-10 16:17:26] [INFO ] Invariant cache hit.
[2026-06-10 16:17:27] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:17:29] [INFO ] Implicit Places using invariants and state equation in 3012 ms returned []
Implicit Place search using SMT with State Equation took 4339 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2026-06-10 16:17:29] [INFO ] Invariant cache hit.
[2026-06-10 16:17:29] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (OVERLAPS) 11/399 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 458 unsolved
SMT process timed out in 30713ms, After SMT, problems are : Problem set: 0 solved, 458 unsolved
Search for dead transitions found 0 dead transitions in 30753ms
Starting structural reductions in LTL mode, iteration 1 : 422/551 places, 468/520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35354 ms. Remains : 422/551 places, 468/520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 422/422 places, 468/468 transitions.
Applied a total of 0 rules in 21 ms. Remains 422 /422 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2026-06-10 16:18:00] [INFO ] Invariant cache hit.
[2026-06-10 16:18:00] [INFO ] Implicit Places using invariants in 398 ms returned []
[2026-06-10 16:18:00] [INFO ] Invariant cache hit.
[2026-06-10 16:18:01] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:18:03] [INFO ] Implicit Places using invariants and state equation in 2528 ms returned []
Implicit Place search using SMT with State Equation took 2937 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2963 ms. Remains : 422/422 places, 468/468 transitions.
Support contains 124 out of 422 places after structural reductions.
[2026-06-10 16:18:03] [INFO ] Flatten gal took : 142 ms
[2026-06-10 16:18:04] [INFO ] Flatten gal took : 85 ms
[2026-06-10 16:18:04] [INFO ] Input system was already deterministic with 468 transitions.
RANDOM walk for 40000 steps (604 resets) in 3941 ms. (10 steps per ms) remains 68/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (9 resets) in 39 ms. (100 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
[2026-06-10 16:18:05] [INFO ] Invariant cache hit.
[2026-06-10 16:18:05] [INFO ] State equation strengthened by 100 read => feed constraints.
Problem AtomicPropp8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 67 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 1 (OVERLAPS) 313/413 variables, 15/15 constraints. Problems are: Problem set: 24 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/15 constraints. Problems are: Problem set: 24 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 7/420 variables, 7/22 constraints. Problems are: Problem set: 24 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/22 constraints. Problems are: Problem set: 24 solved, 44 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 5 (OVERLAPS) 468/888 variables, 420/442 constraints. Problems are: Problem set: 45 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 100/542 constraints. Problems are: Problem set: 45 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 0/542 constraints. Problems are: Problem set: 45 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 2/890 variables, 2/544 constraints. Problems are: Problem set: 45 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/890 variables, 0/544 constraints. Problems are: Problem set: 45 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 890/890 variables, and 544 constraints, problems are : Problem set: 45 solved, 23 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 422/422 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 45 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 348/395 variables, 12/12 constraints. Problems are: Problem set: 45 solved, 23 unsolved
SMT process timed out in 10152ms, After SMT, problems are : Problem set: 45 solved, 23 unsolved
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 47 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 468/468 transitions.
Graph (complete) has 1007 edges and 422 vertex of which 405 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.4 ms
Discarding 17 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 405 transition count 459
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 396 transition count 459
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 43 place count 372 transition count 435
Iterating global reduction 2 with 24 rules applied. Total rules applied 67 place count 372 transition count 435
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 231 place count 290 transition count 353
Free-agglomeration rule (complex) applied 75 times.
Iterating global reduction 2 with 75 rules applied. Total rules applied 306 place count 290 transition count 278
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 382 place count 214 transition count 278
Applied a total of 382 rules in 199 ms. Remains 214 /422 variables (removed 208) and now considering 278/468 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 214/422 places, 278/468 transitions.
RANDOM walk for 40000 steps (1229 resets) in 1254 ms. (31 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (19 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (19 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (16 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (16 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (17 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (16 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (17 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (16 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (16 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 382199 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 23
Probabilistic random walk after 382199 steps, saw 66204 distinct states, run finished after 3007 ms. (steps per millisecond=127 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10283423775348736725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4813211148879271589.kers'
[2026-06-10 16:18:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10283423775348736725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4813211148879271589.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 278 rows 204 cols 793 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-06-10 16:18:19] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4813211148879271589.kers
Total runtime 3 ms.
[2026-06-10 16:18:19] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 158/205 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 9/214 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 278/492 variables, 214/235 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 100/335 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 335 constraints, problems are : Problem set: 0 solved, 23 unsolved in 2159 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 214/214 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 158/205 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 9/214 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 278/492 variables, 214/252 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 100/352 constraints. Problems are: Problem set: 17 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 6/358 constraints. Problems are: Problem set: 17 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 0/358 constraints. Problems are: Problem set: 17 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/492 variables, 0/358 constraints. Problems are: Problem set: 17 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 358 constraints, problems are : Problem set: 17 solved, 6 unsolved in 6200 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 214/214 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 6/23 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8379ms problems are : Problem set: 17 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 274 ms.
Support contains 15 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 278/278 transitions.
Graph (complete) has 716 edges and 214 vertex of which 211 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 209 transition count 276
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 209 transition count 276
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 55 place count 184 transition count 251
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 78 place count 184 transition count 228
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 103 place count 159 transition count 228
Applied a total of 103 rules in 88 ms. Remains 159 /214 variables (removed 55) and now considering 228/278 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 159/214 places, 228/278 transitions.
RANDOM walk for 40000 steps (1508 resets) in 343 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (228 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (232 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (228 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (228 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (228 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (228 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 616885 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 6
Probabilistic random walk after 616885 steps, saw 94895 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17891608360809450484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8481978584132625143.kers'
[2026-06-10 16:18:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17891608360809450484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8481978584132625143.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 228 rows 146 cols 598 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-06-10 16:18:31] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8481978584132625143.kers
Total runtime 2 ms.
[2026-06-10 16:18:31] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 132/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/159 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 228/387 variables, 159/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 100/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 278 constraints, problems are : Problem set: 0 solved, 6 unsolved in 738 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 159/159 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 132/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 12/159 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 228/387 variables, 159/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 100/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 298 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3261 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 159/159 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4014ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 289 ms.
Support contains 15 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 228/228 transitions.
Applied a total of 0 rules in 18 ms. Remains 159 /159 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 159/159 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 228/228 transitions.
Applied a total of 0 rules in 15 ms. Remains 159 /159 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2026-06-10 16:18:36] [INFO ] Invariant cache hit.
[2026-06-10 16:18:36] [INFO ] Implicit Places using invariants in 377 ms returned []
[2026-06-10 16:18:36] [INFO ] Invariant cache hit.
[2026-06-10 16:18:36] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:18:38] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
[2026-06-10 16:18:38] [INFO ] Redundant transitions in 10 ms returned []
Running 218 sub problems to find dead transitions.
[2026-06-10 16:18:38] [INFO ] Invariant cache hit.
[2026-06-10 16:18:38] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 11/156 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 228/384 variables, 156/190 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Problem TDEAD17 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 100/290 constraints. Problems are: Problem set: 21 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/290 constraints. Problems are: Problem set: 21 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 3/387 variables, 3/293 constraints. Problems are: Problem set: 21 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/293 constraints. Problems are: Problem set: 21 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/387 variables, and 293 constraints, problems are : Problem set: 21 solved, 197 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 159/159 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 16/16 constraints. Problems are: Problem set: 21 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 4/20 constraints. Problems are: Problem set: 21 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/20 constraints. Problems are: Problem set: 21 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 12/156 variables, 3/23 constraints. Problems are: Problem set: 21 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 11/34 constraints. Problems are: Problem set: 21 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/34 constraints. Problems are: Problem set: 21 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 228/384 variables, 156/190 constraints. Problems are: Problem set: 21 solved, 197 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 100/290 constraints. Problems are: Problem set: 179 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 24/314 constraints. Problems are: Problem set: 179 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/314 constraints. Problems are: Problem set: 179 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 3/387 variables, 3/317 constraints. Problems are: Problem set: 179 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 15/332 constraints. Problems are: Problem set: 179 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/332 constraints. Problems are: Problem set: 179 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/387 variables, 0/332 constraints. Problems are: Problem set: 179 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 332 constraints, problems are : Problem set: 179 solved, 39 unsolved in 20493 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 159/159 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 39/218 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50564ms problems are : Problem set: 179 solved, 39 unsolved
Search for dead transitions found 179 dead transitions in 50565ms
Found 179 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 179 transitions
Dead transitions reduction (with SMT) removed 179 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 159/159 places, 49/228 transitions.
Graph (complete) has 145 edges and 159 vertex of which 71 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.0 ms
Discarding 88 places :
Also discarding 0 output transitions
Reduce places removed 3 places and 8 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 68 transition count 41
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 62 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 15 place count 57 transition count 36
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 20 place count 57 transition count 36
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 53 transition count 28
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 53 transition count 28
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 49 transition count 24
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 49 transition count 24
Deduced a syphon composed of 14 places in 0 ms
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 49 transition count 18
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 43 transition count 18
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 48 rules in 9 ms. Remains 43 /159 variables (removed 116) and now considering 18/49 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3589496049009888728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4145544836485729292.kers'
[2026-06-10 16:19:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3589496049009888728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4145544836485729292.kers]
Culling trivial invariants: removing 14 columns.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 18 rows 23 cols 49 entries
Finished phase 1 with 12 SingleSign rule and 5 generalized
[2026-06-10 16:19:29] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4145544836485729292.kers
Total runtime 1 ms.
[2026-06-10 16:19:29] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-06-10 16:19:29] [INFO ] Invariant cache hit.
[2026-06-10 16:19:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-06-10 16:19:29] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [13, 16, 19, 22]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 167 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 39/159 places, 18/228 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 15
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 35 transition count 14
Graph (complete) has 30 edges and 35 vertex of which 23 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 23 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 23 transition count 6
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 17 rules in 13 ms. Remains 23 /39 variables (removed 16) and now considering 6/18 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10459543679007499407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6680616912277638029.kers'
[2026-06-10 16:19:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10459543679007499407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6680616912277638029.kers]
Culling trivial invariants: removing 14 columns.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 6 rows 7 cols 17 entries
Finished phase 1 with 4 SingleSign rule and 1 generalized
[2026-06-10 16:19:29] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6680616912277638029.kers
Total runtime 0 ms.
[2026-06-10 16:19:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-06-10 16:19:29] [INFO ] Invariant cache hit.
[2026-06-10 16:19:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-06-10 16:19:29] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [13]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 111 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 22/159 places, 5/228 transitions.
Graph (complete) has 12 edges and 22 vertex of which 18 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 18 transition count 4
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 18 /22 variables (removed 4) and now considering 4/5 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14776268699668758825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16248727934744925423.kers'
[2026-06-10 16:19:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14776268699668758825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16248727934744925423.kers]
Culling trivial invariants: removing 14 columns.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-06-10 16:19:29] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16248727934744925423.kers
Total runtime 0 ms.
[2026-06-10 16:19:29] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-06-10 16:19:29] [INFO ] Invariant cache hit.
[2026-06-10 16:19:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned [14]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 17/159 places, 2/228 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 2
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 1 rules in 9 ms. Remains 16 /17 variables (removed 1) and now considering 2/2 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3775435385630240375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4778375073937362778.kers'
[2026-06-10 16:19:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3775435385630240375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4778375073937362778.kers]
Culling trivial invariants: removing 14 columns.
Culled 14 columns in 0 ms.
// Phase 1: matrix 2 rows 2 cols 3 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-06-10 16:19:29] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4778375073937362778.kers
Total runtime 0 ms.
[2026-06-10 16:19:29] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-06-10 16:19:29] [INFO ] Invariant cache hit.
[2026-06-10 16:19:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 16/159 places, 2/228 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 53343 ms. Remains : 16/159 places, 2/228 transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Successfully simplified 68 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 16:19:29] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2026-06-10 16:19:29] [INFO ] Flatten gal took : 56 ms
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 16:19:29] [INFO ] Flatten gal took : 58 ms
[2026-06-10 16:19:29] [INFO ] Input system was already deterministic with 468 transitions.
Computed a total of 112 stabilizing places and 168 stable transitions
Graph (complete) has 1017 edges and 422 vertex of which 399 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 422/422 places, 468/468 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 399 transition count 468
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 61 place count 361 transition count 430
Iterating global reduction 1 with 38 rules applied. Total rules applied 99 place count 361 transition count 430
Applied a total of 99 rules in 37 ms. Remains 361 /422 variables (removed 61) and now considering 430/468 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5221878052734322236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-851069943004531382.kers'
[2026-06-10 16:19:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5221878052734322236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-851069943004531382.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 3 ms.
// Phase 1: matrix 430 rows 351 cols 1180 entries
Finished phase 1 with 339 SingleSign rule and 0 generalized
[2026-06-10 16:19:29] [INFO ] Computed 22 invariants in 10 ms
Computed 22 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-851069943004531382.kers
Total runtime 12 ms.
[2026-06-10 16:19:30] [INFO ] Implicit Places using invariants in 407 ms returned []
[2026-06-10 16:19:30] [INFO ] Invariant cache hit.
[2026-06-10 16:19:30] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:19:32] [INFO ] Implicit Places using invariants and state equation in 2653 ms returned []
Implicit Place search using SMT with State Equation took 3063 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-06-10 16:19:32] [INFO ] Invariant cache hit.
[2026-06-10 16:19:32] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 11/361 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/791 variables, and 40 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/361 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 11/361 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 430/791 variables, 361/403 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/791 variables, 100/503 constraints. Problems are: Problem set: 340 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/791 variables, 80/583 constraints. Problems are: Problem set: 340 solved, 80 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/791 variables, and 583 constraints, problems are : Problem set: 340 solved, 80 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 361/361 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 80/420 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 340 solved, 80 unsolved
Search for dead transitions found 340 dead transitions in 60167ms
Found 340 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 340 transitions
Dead transitions reduction (with SMT) removed 340 transitions
Starting structural reductions in LTL mode, iteration 1 : 361/422 places, 90/468 transitions.
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 255 place count 106 transition count 90
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 260 place count 101 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 265 place count 101 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 270 place count 96 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 275 place count 96 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 280 place count 91 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 285 place count 91 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 290 place count 86 transition count 65
Iterating global reduction 1 with 5 rules applied. Total rules applied 295 place count 86 transition count 65
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 300 place count 81 transition count 60
Iterating global reduction 1 with 5 rules applied. Total rules applied 305 place count 81 transition count 60
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 310 place count 76 transition count 55
Iterating global reduction 1 with 5 rules applied. Total rules applied 315 place count 76 transition count 55
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 320 place count 71 transition count 50
Iterating global reduction 1 with 5 rules applied. Total rules applied 325 place count 71 transition count 50
Applied a total of 325 rules in 11 ms. Remains 71 /361 variables (removed 290) and now considering 50/90 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2269863601711514304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4557456784832925124.kers'
[2026-06-10 16:20:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2269863601711514304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4557456784832925124.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 50 rows 66 cols 140 entries
Finished phase 1 with 45 SingleSign rule and 5 generalized
[2026-06-10 16:20:33] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4557456784832925124.kers
Total runtime 0 ms.
[2026-06-10 16:20:33] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-06-10 16:20:33] [INFO ] Invariant cache hit.
[2026-06-10 16:20:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:20:33] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [12, 15, 18, 21, 24, 47, 49, 51, 53, 55]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 265 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/422 places, 50/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 46
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 46
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 53 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 53 transition count 42
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 49 transition count 38
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 49 transition count 38
Applied a total of 24 rules in 5 ms. Remains 49 /61 variables (removed 12) and now considering 38/50 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18276228416243454741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17170936538792791419.kers'
[2026-06-10 16:20:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18276228416243454741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17170936538792791419.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 38 rows 44 cols 101 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-06-10 16:20:33] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17170936538792791419.kers
Total runtime 0 ms.
[2026-06-10 16:20:33] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-06-10 16:20:33] [INFO ] Invariant cache hit.
[2026-06-10 16:20:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:20:33] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 49/422 places, 38/468 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63694 ms. Remains : 49/422 places, 38/468 transitions.
[2026-06-10 16:20:33] [INFO ] Flatten gal took : 3 ms
[2026-06-10 16:20:33] [INFO ] Flatten gal took : 4 ms
[2026-06-10 16:20:33] [INFO ] Input system was already deterministic with 38 transitions.
[2026-06-10 16:20:33] [INFO ] Flatten gal took : 2 ms
[2026-06-10 16:20:33] [INFO ] Flatten gal took : 2 ms
[2026-06-10 16:20:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality1125576480205385096.gal : 2 ms
[2026-06-10 16:20:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality450044694983668324.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/CTLCardinality1125576480205385096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality450044694983668324.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26727e+06,0.595201,15036,2,7725,5,60301,6,0,217,61653,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.597228,15064,1,0,6,60301,7,1,307,61653,1
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 422/422 places, 468/468 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 399 transition count 468
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 61 place count 361 transition count 430
Iterating global reduction 1 with 38 rules applied. Total rules applied 99 place count 361 transition count 430
Applied a total of 99 rules in 14 ms. Remains 361 /422 variables (removed 61) and now considering 430/468 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13977498120224332935.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13042136468844475405.kers'
[2026-06-10 16:20:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13977498120224332935.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13042136468844475405.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 1 ms.
// Phase 1: matrix 430 rows 351 cols 1180 entries
Finished phase 1 with 339 SingleSign rule and 0 generalized
[2026-06-10 16:20:34] [INFO ] Computed 22 invariants in 7 ms
Computed 22 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13042136468844475405.kers
Total runtime 9 ms.
[2026-06-10 16:20:34] [INFO ] Implicit Places using invariants in 321 ms returned []
[2026-06-10 16:20:34] [INFO ] Invariant cache hit.
[2026-06-10 16:20:34] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:20:36] [INFO ] Implicit Places using invariants and state equation in 2364 ms returned []
Implicit Place search using SMT with State Equation took 2697 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-06-10 16:20:36] [INFO ] Invariant cache hit.
[2026-06-10 16:20:36] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 11/361 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/791 variables, and 40 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/361 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 11/361 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 430/791 variables, 361/403 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/791 variables, 100/503 constraints. Problems are: Problem set: 340 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/791 variables, 80/583 constraints. Problems are: Problem set: 340 solved, 80 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/791 variables, and 583 constraints, problems are : Problem set: 340 solved, 80 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 361/361 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 80/420 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 340 solved, 80 unsolved
Search for dead transitions found 340 dead transitions in 60094ms
Found 340 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 340 transitions
Dead transitions reduction (with SMT) removed 340 transitions
Starting structural reductions in LTL mode, iteration 1 : 361/422 places, 90/468 transitions.
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 255 place count 106 transition count 90
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 260 place count 101 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 265 place count 101 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 270 place count 96 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 275 place count 96 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 280 place count 91 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 285 place count 91 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 290 place count 86 transition count 65
Iterating global reduction 1 with 5 rules applied. Total rules applied 295 place count 86 transition count 65
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 300 place count 81 transition count 60
Iterating global reduction 1 with 5 rules applied. Total rules applied 305 place count 81 transition count 60
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 310 place count 76 transition count 55
Iterating global reduction 1 with 5 rules applied. Total rules applied 315 place count 76 transition count 55
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 320 place count 71 transition count 50
Iterating global reduction 1 with 5 rules applied. Total rules applied 325 place count 71 transition count 50
Applied a total of 325 rules in 9 ms. Remains 71 /361 variables (removed 290) and now considering 50/90 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1935704619548642158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8721706020738552329.kers'
[2026-06-10 16:21:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1935704619548642158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8721706020738552329.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 50 rows 66 cols 140 entries
Finished phase 1 with 45 SingleSign rule and 5 generalized
[2026-06-10 16:21:36] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8721706020738552329.kers
Total runtime 1 ms.
[2026-06-10 16:21:37] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-06-10 16:21:37] [INFO ] Invariant cache hit.
[2026-06-10 16:21:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:21:37] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [12, 15, 18, 21, 24, 47, 49, 51, 53, 55]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 341 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/422 places, 50/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 46
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 46
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 53 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 53 transition count 42
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 49 transition count 38
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 49 transition count 38
Applied a total of 24 rules in 3 ms. Remains 49 /61 variables (removed 12) and now considering 38/50 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11290232883761457962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10576520536293145841.kers'
[2026-06-10 16:21:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11290232883761457962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10576520536293145841.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 38 rows 44 cols 101 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-06-10 16:21:37] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10576520536293145841.kers
Total runtime 1 ms.
[2026-06-10 16:21:37] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-06-10 16:21:37] [INFO ] Invariant cache hit.
[2026-06-10 16:21:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:21:37] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 49/422 places, 38/468 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63387 ms. Remains : 49/422 places, 38/468 transitions.
[2026-06-10 16:21:37] [INFO ] Flatten gal took : 4 ms
[2026-06-10 16:21:37] [INFO ] Flatten gal took : 3 ms
[2026-06-10 16:21:37] [INFO ] Input system was already deterministic with 38 transitions.
[2026-06-10 16:21:37] [INFO ] Flatten gal took : 3 ms
[2026-06-10 16:21:37] [INFO ] Flatten gal took : 3 ms
[2026-06-10 16:21:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality16902036532774216684.gal : 1 ms
[2026-06-10 16:21:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality14558025034698102201.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/CTLCardinality16902036532774216684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14558025034698102201.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26727e+06,0.587976,15144,2,7725,5,60301,6,0,217,61653,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.589402,15144,1,0,6,60301,7,1,307,61653,1
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 422/422 places, 468/468 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 400 transition count 468
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 57 place count 365 transition count 433
Iterating global reduction 1 with 35 rules applied. Total rules applied 92 place count 365 transition count 433
Applied a total of 92 rules in 20 ms. Remains 365 /422 variables (removed 57) and now considering 433/468 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2833483007067338630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1347776882928397133.kers'
[2026-06-10 16:21:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2833483007067338630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1347776882928397133.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 433 rows 355 cols 1190 entries
Finished phase 1 with 343 SingleSign rule and 0 generalized
[2026-06-10 16:21:38] [INFO ] Computed 22 invariants in 6 ms
Computed 22 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1347776882928397133.kers
Total runtime 7 ms.
[2026-06-10 16:21:38] [INFO ] Implicit Places using invariants in 384 ms returned []
[2026-06-10 16:21:38] [INFO ] Invariant cache hit.
[2026-06-10 16:21:38] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:21:41] [INFO ] Implicit Places using invariants and state equation in 3186 ms returned []
Implicit Place search using SMT with State Equation took 3576 ms to find 0 implicit places.
Running 423 sub problems to find dead transitions.
[2026-06-10 16:21:41] [INFO ] Invariant cache hit.
[2026-06-10 16:21:41] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 11/364 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/798 variables, and 44 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/365 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 11/364 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (OVERLAPS) 433/797 variables, 364/410 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/797 variables, 100/510 constraints. Problems are: Problem set: 78 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/798 variables, and 852 constraints, problems are : Problem set: 78 solved, 345 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 364/365 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 342/423 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 78 solved, 345 unsolved
Search for dead transitions found 78 dead transitions in 60138ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in LTL mode, iteration 1 : 365/422 places, 355/468 transitions.
Reduce places removed 155 places and 156 transitions.
Iterating post reduction 0 with 155 rules applied. Total rules applied 155 place count 210 transition count 199
Reduce places removed 77 places and 80 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 232 place count 133 transition count 119
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 237 place count 128 transition count 114
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 242 place count 128 transition count 114
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 247 place count 123 transition count 104
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 252 place count 123 transition count 104
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 256 place count 119 transition count 100
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 260 place count 119 transition count 100
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 264 place count 115 transition count 96
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 115 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 271 place count 112 transition count 90
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 274 place count 112 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 277 place count 109 transition count 87
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 280 place count 109 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 282 place count 107 transition count 85
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 284 place count 107 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 286 place count 105 transition count 83
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 288 place count 105 transition count 83
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 288 rules in 22 ms. Remains 105 /365 variables (removed 260) and now considering 83/355 (removed 272) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14620446841114414457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8181460776260736146.kers'
[2026-06-10 16:22:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14620446841114414457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8181460776260736146.kers]
Culling trivial invariants: removing 5 columns.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 83 rows 90 cols 222 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-06-10 16:22:41] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8181460776260736146.kers
Total runtime 2 ms.
[2026-06-10 16:22:42] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-06-10 16:22:42] [INFO ] Invariant cache hit.
[2026-06-10 16:22:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-06-10 16:22:42] [INFO ] Implicit Places using invariants and state equation in 362 ms returned [26, 30, 68, 70, 72]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 526 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/422 places, 83/468 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 95 transition count 78
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 95 transition count 78
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 10 rules in 5 ms. Remains 95 /100 variables (removed 5) and now considering 78/83 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15949013216411203537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2316475881073158262.kers'
[2026-06-10 16:22:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15949013216411203537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2316475881073158262.kers]
Culling trivial invariants: removing 5 columns.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 78 rows 82 cols 202 entries
Finished phase 1 with 72 SingleSign rule and 2 generalized
[2026-06-10 16:22:42] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2316475881073158262.kers
Total runtime 2 ms.
[2026-06-10 16:22:42] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-06-10 16:22:42] [INFO ] Invariant cache hit.
[2026-06-10 16:22:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-06-10 16:22:42] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 95/422 places, 78/468 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 64617 ms. Remains : 95/422 places, 78/468 transitions.
[2026-06-10 16:22:42] [INFO ] Found a total of 5 fixed domain variables (out of 95 variables) in GAL type petri
[2026-06-10 16:22:42] [INFO ] Found a total of 5 constant array cells/variables (out of 95 variables) in type petri
[2026-06-10 16:22:42] [INFO ] inode_10_14,loop_6_20,testbusy_6_20,loop_10_16,endloop_9_13,
[2026-06-10 16:22:42] [INFO ] Removed 5 constant variables :inode_10_14=0, loop_6_20=0, testbusy_6_20=0, loop_10_16=0, endloop_9_13=0
[2026-06-10 16:22:42] [INFO ] Simplified 5 expressions due to constant valuations.
[2026-06-10 16:22:42] [INFO ] Flatten gal took : 14 ms
[2026-06-10 16:22:42] [INFO ] Flatten gal took : 7 ms
[2026-06-10 16:22:42] [INFO ] Input system was already deterministic with 78 transitions.
Support contains 4 out of 90 places (down from 9) after GAL structural reductions.
[2026-06-10 16:22:42] [INFO ] Flatten gal took : 6 ms
[2026-06-10 16:22:42] [INFO ] Flatten gal took : 6 ms
[2026-06-10 16:22:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality558153650924280664.gal : 3 ms
[2026-06-10 16:22:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality16404075448657511074.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/CTLCardinality558153650924280664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16404075448657511074.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,6.83084e+06,0.171945,7456,2,3648,5,19254,6,0,404,12390,0


Converting to forward existential form...Done !
original formula: A((loop_4_17<=0) U A(AG((beginloop_7_14<=0)) U !(A(!(((endloop_4_17>=0)&&(testbusy_1_11<=0))) U EX(TRUE)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!(!((E(!(EX(TRUE)) U (!(!(((endloop_4_17>=0)&&(testbusy_1_11<=0)))) * !(EX(TRUE)))) + EG...1261
Reverse transition relation is NOT exact ! Due to transitions t45, t46, t48, t49, t69, t70, t71, t72, t73, t74, t75, t76, t77, Intersection with reachable...225
(forward)formula 0,0,6.60541,144260,1,0,285,889981,183,153,2467,720851,335
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 422/422 places, 468/468 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 399 transition count 468
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 61 place count 361 transition count 430
Iterating global reduction 1 with 38 rules applied. Total rules applied 99 place count 361 transition count 430
Applied a total of 99 rules in 21 ms. Remains 361 /422 variables (removed 61) and now considering 430/468 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7755119663884410633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7541738980188557805.kers'
[2026-06-10 16:22:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7755119663884410633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7541738980188557805.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 430 rows 351 cols 1180 entries
Finished phase 1 with 339 SingleSign rule and 0 generalized
[2026-06-10 16:22:49] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7541738980188557805.kers
Total runtime 5 ms.
[2026-06-10 16:22:50] [INFO ] Implicit Places using invariants in 484 ms returned []
[2026-06-10 16:22:50] [INFO ] Invariant cache hit.
[2026-06-10 16:22:50] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:22:51] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 2298 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-06-10 16:22:51] [INFO ] Invariant cache hit.
[2026-06-10 16:22:51] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 11/361 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/791 variables, and 40 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/361 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 11/361 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 430/791 variables, 361/403 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/791 variables, 100/503 constraints. Problems are: Problem set: 340 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/791 variables, 80/583 constraints. Problems are: Problem set: 340 solved, 80 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/791 variables, and 583 constraints, problems are : Problem set: 340 solved, 80 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 361/361 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 80/420 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60076ms problems are : Problem set: 340 solved, 80 unsolved
Search for dead transitions found 340 dead transitions in 60079ms
Found 340 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 340 transitions
Dead transitions reduction (with SMT) removed 340 transitions
Starting structural reductions in LTL mode, iteration 1 : 361/422 places, 90/468 transitions.
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 255 place count 106 transition count 90
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 260 place count 101 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 265 place count 101 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 270 place count 96 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 275 place count 96 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 280 place count 91 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 285 place count 91 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 290 place count 86 transition count 65
Iterating global reduction 1 with 5 rules applied. Total rules applied 295 place count 86 transition count 65
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 300 place count 81 transition count 60
Iterating global reduction 1 with 5 rules applied. Total rules applied 305 place count 81 transition count 60
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 310 place count 76 transition count 55
Iterating global reduction 1 with 5 rules applied. Total rules applied 315 place count 76 transition count 55
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 320 place count 71 transition count 50
Iterating global reduction 1 with 5 rules applied. Total rules applied 325 place count 71 transition count 50
Applied a total of 325 rules in 17 ms. Remains 71 /361 variables (removed 290) and now considering 50/90 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4395216301568926262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7440116543127873797.kers'
[2026-06-10 16:23:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4395216301568926262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7440116543127873797.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 50 rows 66 cols 140 entries
Finished phase 1 with 45 SingleSign rule and 5 generalized
[2026-06-10 16:23:51] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7440116543127873797.kers
Total runtime 1 ms.
[2026-06-10 16:23:52] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-06-10 16:23:52] [INFO ] Invariant cache hit.
[2026-06-10 16:23:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:23:52] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [12, 15, 18, 21, 24, 47, 49, 51, 53, 55]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 292 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/422 places, 50/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 46
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 46
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 53 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 53 transition count 42
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 49 transition count 38
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 49 transition count 38
Applied a total of 24 rules in 4 ms. Remains 49 /61 variables (removed 12) and now considering 38/50 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-148011656185648569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9722545528569482956.kers'
[2026-06-10 16:23:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-148011656185648569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9722545528569482956.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 38 rows 44 cols 101 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-06-10 16:23:52] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9722545528569482956.kers
Total runtime 1 ms.
[2026-06-10 16:23:52] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-06-10 16:23:52] [INFO ] Invariant cache hit.
[2026-06-10 16:23:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:23:52] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 49/422 places, 38/468 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62912 ms. Remains : 49/422 places, 38/468 transitions.
[2026-06-10 16:23:52] [INFO ] Flatten gal took : 4 ms
[2026-06-10 16:23:52] [INFO ] Flatten gal took : 3 ms
[2026-06-10 16:23:52] [INFO ] Input system was already deterministic with 38 transitions.
[2026-06-10 16:23:52] [INFO ] Flatten gal took : 3 ms
[2026-06-10 16:23:52] [INFO ] Flatten gal took : 3 ms
[2026-06-10 16:23:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8358742461347047322.gal : 2 ms
[2026-06-10 16:23:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality8148097225682231146.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/CTLCardinality8358742461347047322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8148097225682231146.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26727e+06,0.599614,15140,2,7725,5,60301,6,0,217,61653,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.601729,15140,1,0,6,60301,7,1,307,61653,1
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 422/422 places, 468/468 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 399 transition count 468
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 61 place count 361 transition count 430
Iterating global reduction 1 with 38 rules applied. Total rules applied 99 place count 361 transition count 430
Applied a total of 99 rules in 21 ms. Remains 361 /422 variables (removed 61) and now considering 430/468 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7753289397220055692.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9727276919781064087.kers'
[2026-06-10 16:23:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7753289397220055692.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9727276919781064087.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 430 rows 351 cols 1180 entries
Finished phase 1 with 339 SingleSign rule and 0 generalized
[2026-06-10 16:23:53] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9727276919781064087.kers
Total runtime 5 ms.
[2026-06-10 16:23:53] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-06-10 16:23:53] [INFO ] Invariant cache hit.
[2026-06-10 16:23:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:23:55] [INFO ] Implicit Places using invariants and state equation in 2273 ms returned []
Implicit Place search using SMT with State Equation took 2597 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-06-10 16:23:55] [INFO ] Invariant cache hit.
[2026-06-10 16:23:55] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 11/361 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/791 variables, and 40 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/361 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 11/361 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 430/791 variables, 361/403 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/791 variables, 100/503 constraints. Problems are: Problem set: 340 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/791 variables, 80/583 constraints. Problems are: Problem set: 340 solved, 80 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/791 variables, and 583 constraints, problems are : Problem set: 340 solved, 80 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 361/361 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 80/420 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 340 solved, 80 unsolved
Search for dead transitions found 340 dead transitions in 60124ms
Found 340 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 340 transitions
Dead transitions reduction (with SMT) removed 340 transitions
Starting structural reductions in LTL mode, iteration 1 : 361/422 places, 90/468 transitions.
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 255 place count 106 transition count 90
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 260 place count 101 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 265 place count 101 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 270 place count 96 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 275 place count 96 transition count 80
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 280 place count 91 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 285 place count 91 transition count 75
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 290 place count 86 transition count 65
Iterating global reduction 1 with 5 rules applied. Total rules applied 295 place count 86 transition count 65
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 300 place count 81 transition count 60
Iterating global reduction 1 with 5 rules applied. Total rules applied 305 place count 81 transition count 60
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 310 place count 76 transition count 55
Iterating global reduction 1 with 5 rules applied. Total rules applied 315 place count 76 transition count 55
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 320 place count 71 transition count 50
Iterating global reduction 1 with 5 rules applied. Total rules applied 325 place count 71 transition count 50
Applied a total of 325 rules in 16 ms. Remains 71 /361 variables (removed 290) and now considering 50/90 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3422045222310156213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8109385842680729235.kers'
[2026-06-10 16:24:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3422045222310156213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8109385842680729235.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 50 rows 66 cols 140 entries
Finished phase 1 with 45 SingleSign rule and 5 generalized
[2026-06-10 16:24:55] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8109385842680729235.kers
Total runtime 1 ms.
[2026-06-10 16:24:55] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-06-10 16:24:55] [INFO ] Invariant cache hit.
[2026-06-10 16:24:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:24:56] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [12, 15, 18, 21, 24, 47, 49, 51, 53, 55]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 351 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/422 places, 50/468 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 46
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 46
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 53 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 53 transition count 42
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 49 transition count 38
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 49 transition count 38
Applied a total of 24 rules in 5 ms. Remains 49 /61 variables (removed 12) and now considering 38/50 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11359012053453686821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8354880591233921627.kers'
[2026-06-10 16:24:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11359012053453686821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8354880591233921627.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 38 rows 44 cols 101 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-06-10 16:24:56] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8354880591233921627.kers
Total runtime 1 ms.
[2026-06-10 16:24:56] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-06-10 16:24:56] [INFO ] Invariant cache hit.
[2026-06-10 16:24:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:24:56] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 49/422 places, 38/468 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63330 ms. Remains : 49/422 places, 38/468 transitions.
[2026-06-10 16:24:56] [INFO ] Flatten gal took : 4 ms
[2026-06-10 16:24:56] [INFO ] Flatten gal took : 4 ms
[2026-06-10 16:24:56] [INFO ] Input system was already deterministic with 38 transitions.
[2026-06-10 16:24:56] [INFO ] Flatten gal took : 4 ms
[2026-06-10 16:24:56] [INFO ] Flatten gal took : 4 ms
[2026-06-10 16:24:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality4539230333244237641.gal : 1 ms
[2026-06-10 16:24:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality12306944657637326230.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/CTLCardinality4539230333244237641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12306944657637326230.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26727e+06,0.631855,15140,2,7725,5,60301,6,0,217,61653,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, Intersection with reachable at each s...215
(forward)formula 0,0,2.74356,65456,1,0,93,368246,91,43,1252,392278,82
FORMULA FileSystem-PT-N05I10B10-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-06-10 16:24:59] [INFO ] Flatten gal took : 26 ms
[2026-06-10 16:24:59] [INFO ] Flatten gal took : 25 ms
Total runtime 454839 ms.

BK_STOP 1781108699283

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

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