fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
851.151 308930.00 384835.00 1036.70 FTFFFFFTFTFFTFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 940K
-rw-r--r-- 1 mcc users 8.1K May 27 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 27 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 27 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 27 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 50K May 27 10:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 161K May 27 10:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 27 10:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 27 10:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 27 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 27 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 27 10:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K May 27 10:49 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 349K 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-N03I10B15-CTLCardinality-2024-00
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-01
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-02
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-03
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-04
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-05
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-06
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-07
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-08
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-09
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-10
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-11
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-12
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-13
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-14
FORMULA_NAME FileSystem-PT-N03I10B15-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781107867469

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-N03I10B15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 16:11:09] [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:11:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 16:11:09] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2026-06-10 16:11:09] [INFO ] Transformed 826 places.
[2026-06-10 16:11:09] [INFO ] Transformed 770 transitions.
[2026-06-10 16:11:09] [INFO ] Parsed PT model containing 826 places and 770 transitions and 2750 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Reduce places removed 10 places and 0 transitions.
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 130 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 770/770 transitions.
Reduce places removed 123 places and 0 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 693 transition count 770
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 205 place count 611 transition count 688
Iterating global reduction 1 with 82 rules applied. Total rules applied 287 place count 611 transition count 688
Applied a total of 287 rules in 151 ms. Remains 611 /816 variables (removed 205) and now considering 688/770 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15157571352915505607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15858582940655545283.kers'
[2026-06-10 16:11:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15157571352915505607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15858582940655545283.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 688 rows 596 cols 1931 entries
Finished phase 1 with 579 SingleSign rule and 0 generalized
[2026-06-10 16:11:10] [INFO ] Computed 32 invariants in 8 ms
Computed 32 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-15858582940655545283.kers
Total runtime 10 ms.
[2026-06-10 16:11:11] [INFO ] Implicit Places using invariants in 1261 ms returned []
[2026-06-10 16:11:11] [INFO ] Invariant cache hit.
[2026-06-10 16:11:12] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-10 16:11:16] [INFO ] Implicit Places using invariants and state equation in 5454 ms returned []
Implicit Place search using SMT with State Equation took 6768 ms to find 0 implicit places.
Running 678 sub problems to find dead transitions.
[2026-06-10 16:11:16] [INFO ] Invariant cache hit.
[2026-06-10 16:11:16] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 678 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/1299 variables, and 30 constraints, problems are : Problem set: 0 solved, 678 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/611 constraints, ReadFeed: 0/150 constraints, PredecessorRefiner: 678/678 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 678 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 2 (OVERLAPS) 11/584 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 678 unsolved
SMT process timed out in 60852ms, After SMT, problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 60891ms
Starting structural reductions in LTL mode, iteration 1 : 611/816 places, 688/770 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67868 ms. Remains : 611/816 places, 688/770 transitions.
Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 688/688 transitions.
Applied a total of 0 rules in 26 ms. Remains 611 /611 variables (removed 0) and now considering 688/688 (removed 0) transitions.
[2026-06-10 16:12:17] [INFO ] Invariant cache hit.
[2026-06-10 16:12:18] [INFO ] Implicit Places using invariants in 601 ms returned []
[2026-06-10 16:12:18] [INFO ] Invariant cache hit.
[2026-06-10 16:12:19] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-10 16:12:24] [INFO ] Implicit Places using invariants and state equation in 6060 ms returned []
Implicit Place search using SMT with State Equation took 6665 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 6692 ms. Remains : 611/611 places, 688/688 transitions.
Support contains 130 out of 611 places after structural reductions.
[2026-06-10 16:12:24] [INFO ] Flatten gal took : 207 ms
[2026-06-10 16:12:25] [INFO ] Flatten gal took : 102 ms
[2026-06-10 16:12:25] [INFO ] Input system was already deterministic with 688 transitions.
RANDOM walk for 40000 steps (784 resets) in 3707 ms. (10 steps per ms) remains 71/74 properties
BEST_FIRST walk for 4004 steps (16 resets) in 72 ms. (54 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 56 ms. (70 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (16 resets) in 45 ms. (87 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (15 resets) in 42 ms. (93 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 24 ms. (160 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 47 ms. (83 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 26 ms. (148 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 21 ms. (182 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 37 ms. (105 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (16 resets) in 25 ms. (153 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (16 resets) in 29 ms. (133 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 29 ms. (133 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 25 ms. (154 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (16 resets) in 24 ms. (160 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (15 resets) in 44 ms. (88 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 38 ms. (102 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 35 ms. (111 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 41 ms. (95 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 39 ms. (100 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 74 ms. (53 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (16 resets) in 37 ms. (105 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 40 ms. (97 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (14 resets) in 40 ms. (97 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (16 resets) in 37 ms. (105 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 38 ms. (102 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (16 resets) in 33 ms. (117 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (16 resets) in 40 ms. (97 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 38 ms. (102 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (16 resets) in 39 ms. (100 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 32 ms. (121 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 29 ms. (133 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (16 resets) in 33 ms. (117 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 32 ms. (121 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 32 ms. (121 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 38 ms. (102 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (15 resets) in 35 ms. (111 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (16 resets) in 36 ms. (108 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (16 resets) in 40 ms. (97 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (16 resets) in 37 ms. (105 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (15 resets) in 61 ms. (64 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (16 resets) in 39 ms. (100 steps per ms) remains 71/71 properties
Interrupted probabilistic random walk after 170038 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 71
Probabilistic random walk after 170038 steps, saw 40567 distinct states, run finished after 3007 ms. (steps per millisecond=56 ) properties seen :0
[2026-06-10 16:12:30] [INFO ] Invariant cache hit.
[2026-06-10 16:12:30] [INFO ] State equation strengthened by 150 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (OVERLAPS) 475/599 variables, 21/21 constraints. Problems are: Problem set: 21 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/21 constraints. Problems are: Problem set: 21 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 11/610 variables, 11/32 constraints. Problems are: Problem set: 21 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 0/32 constraints. Problems are: Problem set: 21 solved, 50 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 5 (OVERLAPS) 688/1298 variables, 610/642 constraints. Problems are: Problem set: 39 solved, 32 unsolved
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 150/792 constraints. Problems are: Problem set: 41 solved, 30 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1298/1299 variables, and 792 constraints, problems are : Problem set: 41 solved, 30 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 610/611 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 41 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 41 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 518/584 variables, 18/18 constraints. Problems are: Problem set: 41 solved, 30 unsolved
SMT process timed out in 10306ms, After SMT, problems are : Problem set: 41 solved, 30 unsolved
Fused 30 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 66 out of 611 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 611/611 places, 688/688 transitions.
Graph (complete) has 1476 edges and 611 vertex of which 598 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.5 ms
Discarding 13 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 598 transition count 679
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 589 transition count 679
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 41 place count 567 transition count 657
Iterating global reduction 2 with 22 rules applied. Total rules applied 63 place count 567 transition count 657
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 365 place count 416 transition count 506
Free-agglomeration rule (complex) applied 127 times.
Iterating global reduction 2 with 127 rules applied. Total rules applied 492 place count 416 transition count 379
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 619 place count 289 transition count 379
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 620 place count 289 transition count 379
Applied a total of 620 rules in 286 ms. Remains 289 /611 variables (removed 322) and now considering 379/688 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 289/611 places, 379/688 transitions.
RANDOM walk for 40000 steps (1736 resets) in 986 ms. (40 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (28 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (28 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (28 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (28 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (28 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (28 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
Probably explored full state space saw : 47872 states, properties seen :0
Probabilistic random walk after 257280 steps, saw 47872 distinct states, run finished after 2374 ms. (steps per millisecond=108 ) properties seen :0
Explored full state space saw : 47872 states, properties seen :0
Exhaustive walk after 257280 steps, saw 47872 distinct states, run finished after 2222 ms. (steps per millisecond=115 ) properties seen :0
Successfully simplified 71 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 16:12:45] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-06-10 16:12:45] [INFO ] Flatten gal took : 42 ms
[2026-06-10 16:12:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 16:12:46] [INFO ] Flatten gal took : 42 ms
[2026-06-10 16:12:46] [INFO ] Input system was already deterministic with 688 transitions.
Computed a total of 146 stabilizing places and 238 stable transitions
Graph (complete) has 1491 edges and 611 vertex of which 584 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 688/688 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 584 transition count 688
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 80 place count 531 transition count 635
Iterating global reduction 1 with 53 rules applied. Total rules applied 133 place count 531 transition count 635
Applied a total of 133 rules in 34 ms. Remains 531 /611 variables (removed 80) and now considering 635/688 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8329093724388269056.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2140521935791455472.kers'
[2026-06-10 16:12:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8329093724388269056.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2140521935791455472.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 635 rows 516 cols 1745 entries
Finished phase 1 with 499 SingleSign rule and 0 generalized
[2026-06-10 16:12:46] [INFO ] Computed 32 invariants in 11 ms
Computed 32 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-2140521935791455472.kers
Total runtime 13 ms.
[2026-06-10 16:12:46] [INFO ] Implicit Places using invariants in 495 ms returned []
[2026-06-10 16:12:46] [INFO ] Invariant cache hit.
[2026-06-10 16:12:47] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-10 16:12:51] [INFO ] Implicit Places using invariants and state equation in 4914 ms returned []
Implicit Place search using SMT with State Equation took 5413 ms to find 0 implicit places.
Running 625 sub problems to find dead transitions.
[2026-06-10 16:12:51] [INFO ] Invariant cache hit.
[2026-06-10 16:12:51] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 11/531 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 625 unsolved
SMT process timed out in 30507ms, After SMT, problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 30516ms
Starting structural reductions in LTL mode, iteration 1 : 531/611 places, 635/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35969 ms. Remains : 531/611 places, 635/688 transitions.
[2026-06-10 16:13:22] [INFO ] Flatten gal took : 34 ms
[2026-06-10 16:13:22] [INFO ] Flatten gal took : 27 ms
[2026-06-10 16:13:22] [INFO ] Input system was already deterministic with 635 transitions.
[2026-06-10 16:13:22] [INFO ] Flatten gal took : 26 ms
[2026-06-10 16:13:22] [INFO ] Flatten gal took : 26 ms
[2026-06-10 16:13:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality16127109326490502455.gal : 25 ms
[2026-06-10 16:13:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality5700086470336796144.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/CTLCardinality16127109326490502455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5700086470336796144.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.18886e+06,1.21137,28076,2,13992,5,80816,6,0,2707,46158,0


Converting to forward existential form...Done !
original formula: AG(AX(FALSE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(FALSE))] = FALSE
(forward)formula 0,0,1.59243,28104,1,0,6,80816,7,1,3985,46158,1
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 688/688 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 584 transition count 688
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 80 place count 531 transition count 635
Iterating global reduction 1 with 53 rules applied. Total rules applied 133 place count 531 transition count 635
Applied a total of 133 rules in 23 ms. Remains 531 /611 variables (removed 80) and now considering 635/688 (removed 53) transitions.
[2026-06-10 16:13:23] [INFO ] Invariant cache hit.
[2026-06-10 16:13:24] [INFO ] Implicit Places using invariants in 572 ms returned []
[2026-06-10 16:13:24] [INFO ] Invariant cache hit.
[2026-06-10 16:13:25] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-10 16:13:29] [INFO ] Implicit Places using invariants and state equation in 4938 ms returned []
Implicit Place search using SMT with State Equation took 5513 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 531/611 places, 635/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5537 ms. Remains : 531/611 places, 635/688 transitions.
[2026-06-10 16:13:29] [INFO ] Flatten gal took : 20 ms
[2026-06-10 16:13:29] [INFO ] Flatten gal took : 20 ms
[2026-06-10 16:13:29] [INFO ] Input system was already deterministic with 635 transitions.
[2026-06-10 16:13:29] [INFO ] Flatten gal took : 18 ms
[2026-06-10 16:13:29] [INFO ] Flatten gal took : 19 ms
[2026-06-10 16:13:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15651977453853295659.gal : 11 ms
[2026-06-10 16:13:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality2814869960365792311.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/CTLCardinality15651977453853295659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2814869960365792311.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.18886e+06,1.15877,28224,2,13992,5,80816,6,0,2707,46158,0


Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t620, t621, t622, t623, t624, t626, t628, t630, t632, t634, Intersection with reachable at e...223
(forward)formula 0,1,13.543,314904,1,0,92,598884,700,55,9911,395646,691
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 688/688 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 584 transition count 688
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 80 place count 531 transition count 635
Iterating global reduction 1 with 53 rules applied. Total rules applied 133 place count 531 transition count 635
Applied a total of 133 rules in 34 ms. Remains 531 /611 variables (removed 80) and now considering 635/688 (removed 53) transitions.
[2026-06-10 16:13:43] [INFO ] Invariant cache hit.
[2026-06-10 16:13:44] [INFO ] Implicit Places using invariants in 880 ms returned []
[2026-06-10 16:13:44] [INFO ] Invariant cache hit.
[2026-06-10 16:13:44] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-10 16:13:49] [INFO ] Implicit Places using invariants and state equation in 5299 ms returned []
Implicit Place search using SMT with State Equation took 6185 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 531/611 places, 635/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6220 ms. Remains : 531/611 places, 635/688 transitions.
[2026-06-10 16:13:49] [INFO ] Flatten gal took : 16 ms
[2026-06-10 16:13:49] [INFO ] Flatten gal took : 20 ms
[2026-06-10 16:13:49] [INFO ] Input system was already deterministic with 635 transitions.
[2026-06-10 16:13:49] [INFO ] Flatten gal took : 27 ms
[2026-06-10 16:13:49] [INFO ] Flatten gal took : 30 ms
[2026-06-10 16:13:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality17532555748904479130.gal : 10 ms
[2026-06-10 16:13:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality16684393106612693480.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/CTLCardinality17532555748904479130.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16684393106612693480.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.18886e+06,1.08645,28160,2,13992,5,80816,6,0,2707,46158,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 t620, t621, t622, t623, t624, t626, t628, t630, t632, t634, Intersection with reachable at e...223
(forward)formula 0,0,13.3048,314464,1,0,92,598884,700,55,9948,395646,691
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 688/688 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 584 transition count 688
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 80 place count 531 transition count 635
Iterating global reduction 1 with 53 rules applied. Total rules applied 133 place count 531 transition count 635
Applied a total of 133 rules in 31 ms. Remains 531 /611 variables (removed 80) and now considering 635/688 (removed 53) transitions.
[2026-06-10 16:14:03] [INFO ] Invariant cache hit.
[2026-06-10 16:14:04] [INFO ] Implicit Places using invariants in 931 ms returned []
[2026-06-10 16:14:04] [INFO ] Invariant cache hit.
[2026-06-10 16:14:04] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-10 16:14:09] [INFO ] Implicit Places using invariants and state equation in 4986 ms returned []
Implicit Place search using SMT with State Equation took 5920 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 531/611 places, 635/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5953 ms. Remains : 531/611 places, 635/688 transitions.
[2026-06-10 16:14:09] [INFO ] Flatten gal took : 26 ms
[2026-06-10 16:14:09] [INFO ] Flatten gal took : 30 ms
[2026-06-10 16:14:09] [INFO ] Input system was already deterministic with 635 transitions.
[2026-06-10 16:14:09] [INFO ] Flatten gal took : 29 ms
[2026-06-10 16:14:09] [INFO ] Flatten gal took : 27 ms
[2026-06-10 16:14:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality4432506461866975767.gal : 9 ms
[2026-06-10 16:14:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality14151366953214848485.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/CTLCardinality4432506461866975767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14151366953214848485.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.18886e+06,1.18781,28196,2,13992,5,80816,6,0,2707,46158,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) + AG(AX(FALSE)))
=> equivalent forward existential formula: [(EY(FwdU((Init * !(!(EX(!(FALSE))))),TRUE)) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t620, t621, t622, t623, t624, t626, t628, t630, t632, t634, Intersection with reachable at e...223
(forward)formula 0,0,13.8175,326332,1,0,92,640024,701,55,11021,461824,694
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 688/688 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 584 transition count 688
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 80 place count 531 transition count 635
Iterating global reduction 1 with 53 rules applied. Total rules applied 133 place count 531 transition count 635
Applied a total of 133 rules in 19 ms. Remains 531 /611 variables (removed 80) and now considering 635/688 (removed 53) transitions.
[2026-06-10 16:14:23] [INFO ] Invariant cache hit.
[2026-06-10 16:14:24] [INFO ] Implicit Places using invariants in 747 ms returned []
[2026-06-10 16:14:24] [INFO ] Invariant cache hit.
[2026-06-10 16:14:24] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-10 16:14:30] [INFO ] Implicit Places using invariants and state equation in 5760 ms returned []
Implicit Place search using SMT with State Equation took 6515 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 531/611 places, 635/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6536 ms. Remains : 531/611 places, 635/688 transitions.
[2026-06-10 16:14:30] [INFO ] Flatten gal took : 24 ms
[2026-06-10 16:14:30] [INFO ] Flatten gal took : 24 ms
[2026-06-10 16:14:30] [INFO ] Input system was already deterministic with 635 transitions.
[2026-06-10 16:14:30] [INFO ] Flatten gal took : 24 ms
[2026-06-10 16:14:30] [INFO ] Flatten gal took : 24 ms
[2026-06-10 16:14:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality934201145128389694.gal : 7 ms
[2026-06-10 16:14:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality5489545536613992601.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/CTLCardinality934201145128389694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5489545536613992601.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.18886e+06,1.3341,28224,2,13992,5,80816,6,0,2707,46158,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,1.57925,28224,1,0,6,80816,7,1,3872,46158,1
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 688/688 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 585 transition count 688
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 77 place count 534 transition count 637
Iterating global reduction 1 with 51 rules applied. Total rules applied 128 place count 534 transition count 637
Applied a total of 128 rules in 30 ms. Remains 534 /611 variables (removed 77) and now considering 637/688 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10243348577990683959.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18301956174772829631.kers'
[2026-06-10 16:14:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10243348577990683959.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18301956174772829631.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 637 rows 519 cols 1752 entries
Finished phase 1 with 502 SingleSign rule and 0 generalized
[2026-06-10 16:14:31] [INFO ] Computed 32 invariants in 12 ms
Computed 32 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-18301956174772829631.kers
Total runtime 14 ms.
[2026-06-10 16:14:32] [INFO ] Implicit Places using invariants in 763 ms returned []
[2026-06-10 16:14:32] [INFO ] Invariant cache hit.
[2026-06-10 16:14:33] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-10 16:14:36] [INFO ] Implicit Places using invariants and state equation in 4023 ms returned []
Implicit Place search using SMT with State Equation took 4788 ms to find 0 implicit places.
Running 627 sub problems to find dead transitions.
[2026-06-10 16:14:36] [INFO ] Invariant cache hit.
[2026-06-10 16:14:36] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (OVERLAPS) 11/533 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 627 unsolved
SMT process timed out in 30312ms, After SMT, problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 30316ms
Starting structural reductions in LTL mode, iteration 1 : 534/611 places, 637/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35137 ms. Remains : 534/611 places, 637/688 transitions.
[2026-06-10 16:15:07] [INFO ] Flatten gal took : 25 ms
[2026-06-10 16:15:07] [INFO ] Flatten gal took : 25 ms
[2026-06-10 16:15:07] [INFO ] Input system was already deterministic with 637 transitions.
[2026-06-10 16:15:07] [INFO ] Flatten gal took : 24 ms
[2026-06-10 16:15:07] [INFO ] Flatten gal took : 24 ms
[2026-06-10 16:15:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality11592375040208487248.gal : 7 ms
[2026-06-10 16:15:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality3267535514187285697.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/CTLCardinality11592375040208487248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3267535514187285697.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.18886e+06,1.4135,31632,2,15348,5,90454,6,0,2718,54934,0


Converting to forward existential form...Done !
original formula: EX(EF((inode_5_19>endloop_2_23)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (inode_5_19>endloop_2_23))] != FALSE
(forward)formula 0,1,2.36674,35552,1,0,9,96401,9,1,4759,61395,4
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 688/688 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 584 transition count 688
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 80 place count 531 transition count 635
Iterating global reduction 1 with 53 rules applied. Total rules applied 133 place count 531 transition count 635
Applied a total of 133 rules in 29 ms. Remains 531 /611 variables (removed 80) and now considering 635/688 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3497701888010332881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14632741801012064868.kers'
[2026-06-10 16:15:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3497701888010332881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14632741801012064868.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 635 rows 516 cols 1745 entries
Finished phase 1 with 499 SingleSign rule and 0 generalized
[2026-06-10 16:15:09] [INFO ] Computed 32 invariants in 12 ms
Computed 32 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-14632741801012064868.kers
Total runtime 13 ms.
[2026-06-10 16:15:10] [INFO ] Implicit Places using invariants in 763 ms returned []
[2026-06-10 16:15:10] [INFO ] Invariant cache hit.
[2026-06-10 16:15:10] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-06-10 16:15:15] [INFO ] Implicit Places using invariants and state equation in 5440 ms returned []
Implicit Place search using SMT with State Equation took 6206 ms to find 0 implicit places.
Running 625 sub problems to find dead transitions.
[2026-06-10 16:15:15] [INFO ] Invariant cache hit.
[2026-06-10 16:15:15] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 11/531 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1166 variables, and 32 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 0/531 constraints, ReadFeed: 0/150 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 11/531 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 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 TDEAD22 is UNSAT
Problem TDEAD23 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 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 TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 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 TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 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 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 TDEAD84 is UNSAT
Problem TDEAD85 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 TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 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 TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 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 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 TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 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 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 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 TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 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 TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 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 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 TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 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 TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 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 TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 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 TDEAD392 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 TDEAD404 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 TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 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 TDEAD22 is UNSAT
Problem TDEAD23 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 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 TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 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 TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 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 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 TDEAD84 is UNSAT
Problem TDEAD85 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 TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 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 TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 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 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 TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 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 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 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 TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/52 constraints. Problems are: Problem set: 582 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1166 variables, and 52 constraints, problems are : Problem set: 582 solved, 43 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 0/531 constraints, ReadFeed: 0/150 constraints, PredecessorRefiner: 0/625 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60190ms problems are : Problem set: 582 solved, 43 unsolved
Search for dead transitions found 582 dead transitions in 60196ms
Found 582 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 582 transitions
Dead transitions reduction (with SMT) removed 582 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/611 places, 53/688 transitions.
Reduce places removed 460 places and 3 transitions.
Iterating post reduction 0 with 460 rules applied. Total rules applied 460 place count 71 transition count 50
Applied a total of 460 rules in 4 ms. Remains 71 /531 variables (removed 460) and now considering 50/53 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8023517091203153290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2591519042145213768.kers'
[2026-06-10 16:16:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8023517091203153290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2591519042145213768.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 50 rows 71 cols 140 entries
Finished phase 1 with 40 SingleSign rule and 10 generalized
[2026-06-10 16:16:16] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2591519042145213768.kers
Total runtime 2 ms.
[2026-06-10 16:16:16] [INFO ] Implicit Places using invariants in 134 ms returned [10, 11, 12, 13, 14, 15, 16, 17, 18, 19]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 141 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 61/611 places, 50/688 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 66580 ms. Remains : 61/611 places, 50/688 transitions.
[2026-06-10 16:16:16] [INFO ] Flatten gal took : 3 ms
[2026-06-10 16:16:16] [INFO ] Flatten gal took : 2 ms
[2026-06-10 16:16:16] [INFO ] Input system was already deterministic with 50 transitions.
[2026-06-10 16:16:16] [INFO ] Flatten gal took : 2 ms
[2026-06-10 16:16:16] [INFO ] Flatten gal took : 1 ms
[2026-06-10 16:16:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality282747246654893108.gal : 1 ms
[2026-06-10 16:16:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality9827497375243177328.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/CTLCardinality282747246654893108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9827497375243177328.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.18886e+06,0.07078,5256,2,734,5,7737,6,0,287,5841,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.073163,5256,1,0,6,7737,7,1,390,5841,1
FORMULA FileSystem-PT-N03I10B15-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-06-10 16:16:16] [INFO ] Flatten gal took : 34 ms
[2026-06-10 16:16:16] [INFO ] Flatten gal took : 25 ms
Total runtime 307017 ms.

BK_STOP 1781108176399

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

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