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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1008.859 321083.00 403870.00 1050.50 TFFFFTFFFFTTTTFT 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-178021499300441.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-N03I10B10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.2K May 27 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 27 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 49K May 27 10:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 165K May 27 10:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 27 10:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 27 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 27 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 27 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K May 27 10:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K 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 236K Jun 10 11:57 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-00
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-01
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-02
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-03
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-04
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-05
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-06
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-07
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-08
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-09
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-10
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-11
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-12
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-13
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-14
FORMULA_NAME FileSystem-PT-N03I10B10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781107352549

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-N03I10B10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 16:02:34] [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:02:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 16:02:34] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2026-06-10 16:02:34] [INFO ] Transformed 561 places.
[2026-06-10 16:02:34] [INFO ] Transformed 520 transitions.
[2026-06-10 16:02:34] [INFO ] Parsed PT model containing 561 places and 520 transitions and 1850 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Reduce places removed 10 places and 0 transitions.
Support contains 113 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 520/520 transitions.
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 472 transition count 520
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 130 place count 421 transition count 469
Iterating global reduction 1 with 51 rules applied. Total rules applied 181 place count 421 transition count 469
Applied a total of 181 rules in 113 ms. Remains 421 /551 variables (removed 130) and now considering 469/520 (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-8475790733630777447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12412408762462282898.kers'
[2026-06-10 16:02:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8475790733630777447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12412408762462282898.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 469 rows 411 cols 1318 entries
Finished phase 1 with 399 SingleSign rule and 0 generalized
[2026-06-10 16:02:35] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12412408762462282898.kers
Total runtime 8 ms.
[2026-06-10 16:02:36] [INFO ] Implicit Places using invariants in 901 ms returned []
[2026-06-10 16:02:36] [INFO ] Invariant cache hit.
[2026-06-10 16:02:36] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:02:39] [INFO ] Implicit Places using invariants and state equation in 3725 ms returned []
Implicit Place search using SMT with State Equation took 4690 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2026-06-10 16:02:39] [INFO ] Invariant cache hit.
[2026-06-10 16:02:39] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (OVERLAPS) 11/400 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 459 unsolved
SMT process timed out in 30458ms, After SMT, problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 30488ms
Starting structural reductions in LTL mode, iteration 1 : 421/551 places, 469/520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35357 ms. Remains : 421/551 places, 469/520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 469/469 transitions.
Applied a total of 0 rules in 11 ms. Remains 421 /421 variables (removed 0) and now considering 469/469 (removed 0) transitions.
[2026-06-10 16:03:10] [INFO ] Invariant cache hit.
[2026-06-10 16:03:10] [INFO ] Implicit Places using invariants in 388 ms returned []
[2026-06-10 16:03:10] [INFO ] Invariant cache hit.
[2026-06-10 16:03:11] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:03:13] [INFO ] Implicit Places using invariants and state equation in 3223 ms returned []
Implicit Place search using SMT with State Equation took 3615 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3627 ms. Remains : 421/421 places, 469/469 transitions.
Support contains 113 out of 421 places after structural reductions.
[2026-06-10 16:03:14] [INFO ] Flatten gal took : 152 ms
[2026-06-10 16:03:14] [INFO ] Flatten gal took : 78 ms
[2026-06-10 16:03:14] [INFO ] Input system was already deterministic with 469 transitions.
RANDOM walk for 40000 steps (604 resets) in 2850 ms. (14 steps per ms) remains 70/79 properties
BEST_FIRST walk for 4003 steps (12 resets) in 47 ms. (83 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (12 resets) in 49 ms. (80 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (12 resets) in 36 ms. (108 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 63 ms. (62 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 54 ms. (72 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 75 ms. (52 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 51 ms. (76 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 45 ms. (87 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (12 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (13 resets) in 31 ms. (125 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (12 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (12 resets) in 23 ms. (166 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 35 ms. (111 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (12 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (12 resets) in 21 ms. (181 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (12 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 31 ms. (125 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 41 ms. (95 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 30 ms. (129 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (12 resets) in 25 ms. (153 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (12 resets) in 22 ms. (174 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
[2026-06-10 16:03:16] [INFO ] Invariant cache hit.
[2026-06-10 16:03:16] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 1 (OVERLAPS) 314/413 variables, 15/15 constraints. Problems are: Problem set: 28 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/15 constraints. Problems are: Problem set: 28 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 7/420 variables, 7/22 constraints. Problems are: Problem set: 28 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/22 constraints. Problems are: Problem set: 28 solved, 42 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 5 (OVERLAPS) 469/889 variables, 420/442 constraints. Problems are: Problem set: 41 solved, 29 unsolved
Problem AtomicPropp50 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 100/542 constraints. Problems are: Problem set: 42 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 0/542 constraints. Problems are: Problem set: 42 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/890 variables, 1/543 constraints. Problems are: Problem set: 42 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 890/890 variables, and 543 constraints, problems are : Problem set: 42 solved, 28 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 421/421 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 42 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 355/401 variables, 11/11 constraints. Problems are: Problem set: 42 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 17/28 constraints. Problems are: Problem set: 42 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/890 variables, and 29 constraints, problems are : Problem set: 42 solved, 28 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 11/22 constraints, State Equation: 0/421 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/70 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10057ms problems are : Problem set: 42 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 469/469 transitions.
Graph (complete) has 1008 edges and 421 vertex of which 412 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 412 transition count 459
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 402 transition count 459
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 42 place count 381 transition count 438
Iterating global reduction 2 with 21 rules applied. Total rules applied 63 place count 381 transition count 438
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 253 place count 286 transition count 343
Free-agglomeration rule (complex) applied 85 times.
Iterating global reduction 2 with 85 rules applied. Total rules applied 338 place count 286 transition count 258
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 2 with 85 rules applied. Total rules applied 423 place count 201 transition count 258
Applied a total of 423 rules in 119 ms. Remains 201 /421 variables (removed 220) and now considering 258/469 (removed 211) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 201/421 places, 258/469 transitions.
RANDOM walk for 40000 steps (1402 resets) in 837 ms. (47 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (24 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (24 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (24 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (24 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (24 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (24 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (24 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (24 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (24 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (24 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (24 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (24 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (24 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (24 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 384753 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 28
Probabilistic random walk after 384753 steps, saw 80689 distinct states, run finished after 3007 ms. (steps per millisecond=127 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5557181251556336667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14190813268432202822.kers'
[2026-06-10 16:03:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5557181251556336667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14190813268432202822.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 258 rows 191 cols 737 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-06-10 16:03:29] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14190813268432202822.kers
Total runtime 2 ms.
[2026-06-10 16:03:29] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 144/190 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 11/201 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 258/459 variables, 201/223 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 100/323 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/459 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 323 constraints, problems are : Problem set: 0 solved, 28 unsolved in 2791 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 201/201 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 144/190 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 11/201 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 258/459 variables, 201/268 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 100/368 constraints. Problems are: Problem set: 15 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 13/381 constraints. Problems are: Problem set: 15 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/459 variables, 0/381 constraints. Problems are: Problem set: 15 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/459 variables, 0/381 constraints. Problems are: Problem set: 15 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 381 constraints, problems are : Problem set: 15 solved, 13 unsolved in 12788 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 201/201 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 13/28 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15601ms problems are : Problem set: 15 solved, 13 unsolved
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 4086 ms.
Support contains 21 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 258/258 transitions.
Graph (complete) has 713 edges and 201 vertex of which 199 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 198 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 198 transition count 257
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 33 place count 183 transition count 242
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 45 place count 183 transition count 230
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 59 place count 169 transition count 230
Applied a total of 59 rules in 47 ms. Remains 169 /201 variables (removed 32) and now considering 230/258 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 169/201 places, 230/258 transitions.
RANDOM walk for 40000 steps (1480 resets) in 300 ms. (132 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (271 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (272 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (272 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (272 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (272 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (271 resets) in 140 ms. (283 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (273 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (272 resets) in 100 ms. (396 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (272 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (276 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (267 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (272 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (271 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
Probably explored full state space saw : 86271 states, properties seen :0
Probabilistic random walk after 438524 steps, saw 86271 distinct states, run finished after 2801 ms. (steps per millisecond=156 ) properties seen :0
Explored full state space saw : 86272 states, properties seen :0
Exhaustive walk after 438528 steps, saw 86272 distinct states, run finished after 2846 ms. (steps per millisecond=154 ) properties seen :0
Successfully simplified 70 atomic propositions for a total of 16 simplifications.
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 16:03:55] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-06-10 16:03:55] [INFO ] Flatten gal took : 54 ms
[2026-06-10 16:03:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 16:03:55] [INFO ] Flatten gal took : 51 ms
[2026-06-10 16:03:56] [INFO ] Input system was already deterministic with 469 transitions.
Support contains 6 out of 421 places (down from 12) after GAL structural reductions.
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 169 stable transitions
Graph (complete) has 1018 edges and 421 vertex of which 400 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 469/469 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 400 transition count 469
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 60 place count 361 transition count 430
Iterating global reduction 1 with 39 rules applied. Total rules applied 99 place count 361 transition count 430
Applied a total of 99 rules in 18 ms. Remains 361 /421 variables (removed 60) and now considering 430/469 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11120686855260237587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10210944096975306808.kers'
[2026-06-10 16:03:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11120686855260237587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10210944096975306808.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 430 rows 351 cols 1180 entries
Finished phase 1 with 339 SingleSign rule and 0 generalized
[2026-06-10 16:03:56] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10210944096975306808.kers
Total runtime 5 ms.
[2026-06-10 16:03:56] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-06-10 16:03:56] [INFO ] Invariant cache hit.
[2026-06-10 16:03:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:03:58] [INFO ] Implicit Places using invariants and state equation in 2242 ms returned []
Implicit Place search using SMT with State Equation took 2508 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-06-10 16:03:58] [INFO ] Invariant cache hit.
[2026-06-10 16:03:58] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 11/361 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/791 variables, and 46 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/361 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 11/361 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/791 variables, and 65 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/361 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/420 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 361/421 places, 430/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62726 ms. Remains : 361/421 places, 430/469 transitions.
[2026-06-10 16:04:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-06-10 16:04:58] [INFO ] Flatten gal took : 37 ms
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 16:04:58] [INFO ] Flatten gal took : 36 ms
[2026-06-10 16:04:58] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 469/469 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 400 transition count 469
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 60 place count 361 transition count 430
Iterating global reduction 1 with 39 rules applied. Total rules applied 99 place count 361 transition count 430
Applied a total of 99 rules in 11 ms. Remains 361 /421 variables (removed 60) and now considering 430/469 (removed 39) transitions.
[2026-06-10 16:04:58] [INFO ] Invariant cache hit.
[2026-06-10 16:04:59] [INFO ] Implicit Places using invariants in 458 ms returned []
[2026-06-10 16:04:59] [INFO ] Invariant cache hit.
[2026-06-10 16:04:59] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:05:02] [INFO ] Implicit Places using invariants and state equation in 2986 ms returned []
Implicit Place search using SMT with State Equation took 3459 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 361/421 places, 430/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3470 ms. Remains : 361/421 places, 430/469 transitions.
[2026-06-10 16:05:02] [INFO ] Flatten gal took : 31 ms
[2026-06-10 16:05:02] [INFO ] Flatten gal took : 25 ms
[2026-06-10 16:05:02] [INFO ] Input system was already deterministic with 430 transitions.
[2026-06-10 16:05:02] [INFO ] Flatten gal took : 23 ms
[2026-06-10 16:05:02] [INFO ] Flatten gal took : 21 ms
[2026-06-10 16:05:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality17518049036819090884.gal : 24 ms
[2026-06-10 16:05:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality13873819450657119895.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/CTLCardinality17518049036819090884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13873819450657119895.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t221, t226, t242, t247, t263, t268, t284, t289, t300, t305, t420, t421, t422, t423, t424, t42...283
(forward)formula 0,1,21.2241,557884,1,0,231,1.72751e+06,540,96,7716,1.27921e+06,593
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 421/421 places, 469/469 transitions.
Graph (complete) has 1018 edges and 421 vertex of which 401 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 401 transition count 459
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 391 transition count 459
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 59 place count 353 transition count 421
Iterating global reduction 2 with 38 rules applied. Total rules applied 97 place count 353 transition count 421
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 295 place count 254 transition count 322
Applied a total of 295 rules in 52 ms. Remains 254 /421 variables (removed 167) and now considering 322/469 (removed 147) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14599421683313863540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2129384417319736091.kers'
[2026-06-10 16:05:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14599421683313863540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2129384417319736091.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 322 rows 244 cols 1046 entries
Finished phase 1 with 232 SingleSign rule and 0 generalized
[2026-06-10 16:05:24] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2129384417319736091.kers
Total runtime 3 ms.
[2026-06-10 16:05:24] [INFO ] Implicit Places using invariants in 619 ms returned []
[2026-06-10 16:05:24] [INFO ] Invariant cache hit.
[2026-06-10 16:05:25] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:05:27] [INFO ] Implicit Places using invariants and state equation in 2417 ms returned []
Implicit Place search using SMT with State Equation took 3039 ms to find 0 implicit places.
[2026-06-10 16:05:27] [INFO ] Redundant transitions in 22 ms returned []
Running 312 sub problems to find dead transitions.
[2026-06-10 16:05:27] [INFO ] Invariant cache hit.
[2026-06-10 16:05:27] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 11/253 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 312 unsolved
SMT process timed out in 30061ms, After SMT, problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 30063ms
Starting structural reductions in SI_CTL mode, iteration 1 : 254/421 places, 322/469 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33183 ms. Remains : 254/421 places, 322/469 transitions.
[2026-06-10 16:05:57] [INFO ] Flatten gal took : 11 ms
[2026-06-10 16:05:57] [INFO ] Flatten gal took : 12 ms
[2026-06-10 16:05:57] [INFO ] Input system was already deterministic with 322 transitions.
RANDOM walk for 101 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-10 16:05:57] [INFO ] Flatten gal took : 17 ms
[2026-06-10 16:05:57] [INFO ] Flatten gal took : 13 ms
[2026-06-10 16:05:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17351162049186164360.gal : 6 ms
[2026-06-10 16:05:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11509195599860391573.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17351162049186164360.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11509195599860391573.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 421/421 places, 469/469 transitions.
Graph (complete) has 1018 edges and 421 vertex of which 400 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 400 transition count 459
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 390 transition count 459
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 59 place count 352 transition count 421
Iterating global reduction 2 with 38 rules applied. Total rules applied 97 place count 352 transition count 421
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 315 place count 243 transition count 312
Applied a total of 315 rules in 40 ms. Remains 243 /421 variables (removed 178) and now considering 312/469 (removed 157) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16561363655480739751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5632097014544659472.kers'
[2026-06-10 16:05:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16561363655480739751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5632097014544659472.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 312 rows 233 cols 1034 entries
Finished phase 1 with 221 SingleSign rule and 0 generalized
[2026-06-10 16:05:57] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5632097014544659472.kers
Total runtime 3 ms.
[2026-06-10 16:05:57] [INFO ] Implicit Places using invariants in 434 ms returned []
[2026-06-10 16:05:57] [INFO ] Invariant cache hit.
[2026-06-10 16:05:58] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:05:59] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
[2026-06-10 16:05:59] [INFO ] Redundant transitions in 9 ms returned []
Running 302 sub problems to find dead transitions.
[2026-06-10 16:05:59] [INFO ] Invariant cache hit.
[2026-06-10 16:05:59] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 11/243 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 302 unsolved
SMT process timed out in 30173ms, After SMT, problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 30176ms
Starting structural reductions in SI_CTL mode, iteration 1 : 243/421 places, 312/469 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31924 ms. Remains : 243/421 places, 312/469 transitions.
[2026-06-10 16:06:29] [INFO ] Flatten gal took : 33 ms
[2026-06-10 16:06:29] [INFO ] Flatten gal took : 18 ms
[2026-06-10 16:06:29] [INFO ] Input system was already deterministic with 312 transitions.
[2026-06-10 16:06:29] [INFO ] Flatten gal took : 16 ms
[2026-06-10 16:06:29] [INFO ] Flatten gal took : 16 ms
[2026-06-10 16:06:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality5044595807921174088.gal : 5 ms
[2026-06-10 16:06:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality1521903956805759181.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/CTLCardinality5044595807921174088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1521903956805759181.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,452864,0.550496,15104,2,4469,5,28779,6,0,1247,15136,0


Converting to forward existential form...Done !
original formula: EG(((endloop_5_20<=loop_6_17)||(testbusy_4_17<=busy_12_22)))
=> equivalent forward existential formula: [FwdG(Init,((endloop_5_20<=loop_6_17)||(testbusy_4_17<=busy_12_22)))] != FALSE
Hit Full ! (commute/partial/dont) 295/0/17
(forward)formula 0,1,4.98737,119120,1,0,48,342996,18,3,4367,196622,48
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 469/469 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 400 transition count 469
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 60 place count 361 transition count 430
Iterating global reduction 1 with 39 rules applied. Total rules applied 99 place count 361 transition count 430
Applied a total of 99 rules in 20 ms. Remains 361 /421 variables (removed 60) and now considering 430/469 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14217509315549481682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6565640889472837076.kers'
[2026-06-10 16:06:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14217509315549481682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6565640889472837076.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 1 ms.
// Phase 1: matrix 430 rows 351 cols 1180 entries
Finished phase 1 with 339 SingleSign rule and 0 generalized
[2026-06-10 16:06:34] [INFO ] Computed 22 invariants in 7 ms
Computed 22 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6565640889472837076.kers
Total runtime 8 ms.
[2026-06-10 16:06:35] [INFO ] Implicit Places using invariants in 498 ms returned []
[2026-06-10 16:06:35] [INFO ] Invariant cache hit.
[2026-06-10 16:06:35] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:06:37] [INFO ] Implicit Places using invariants and state equation in 2198 ms returned []
Implicit Place search using SMT with State Equation took 2717 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-06-10 16:06:37] [INFO ] Invariant cache hit.
[2026-06-10 16:06:37] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 11/361 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/791 variables, and 42 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/361 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 11/361 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/791 variables, and 63 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/361 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/420 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 361/421 places, 430/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62867 ms. Remains : 361/421 places, 430/469 transitions.
[2026-06-10 16:07:37] [INFO ] Flatten gal took : 22 ms
[2026-06-10 16:07:37] [INFO ] Flatten gal took : 20 ms
[2026-06-10 16:07:37] [INFO ] Input system was already deterministic with 430 transitions.
[2026-06-10 16:07:37] [INFO ] Flatten gal took : 20 ms
[2026-06-10 16:07:37] [INFO ] Flatten gal took : 19 ms
[2026-06-10 16:07:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2442200679401303006.gal : 6 ms
[2026-06-10 16:07:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality17295220762015977434.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/CTLCardinality2442200679401303006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17295220762015977434.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.798467,19040,1,0,6,50520,7,1,2613,31328,1
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 469/469 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 400 transition count 469
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 60 place count 361 transition count 430
Iterating global reduction 1 with 39 rules applied. Total rules applied 99 place count 361 transition count 430
Applied a total of 99 rules in 11 ms. Remains 361 /421 variables (removed 60) and now considering 430/469 (removed 39) transitions.
[2026-06-10 16:07:38] [INFO ] Invariant cache hit.
[2026-06-10 16:07:38] [INFO ] Implicit Places using invariants in 360 ms returned []
[2026-06-10 16:07:38] [INFO ] Invariant cache hit.
[2026-06-10 16:07:39] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:07:41] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned []
Implicit Place search using SMT with State Equation took 2614 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 361/421 places, 430/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2625 ms. Remains : 361/421 places, 430/469 transitions.
[2026-06-10 16:07:41] [INFO ] Flatten gal took : 10 ms
[2026-06-10 16:07:41] [INFO ] Flatten gal took : 11 ms
[2026-06-10 16:07:41] [INFO ] Input system was already deterministic with 430 transitions.
[2026-06-10 16:07:41] [INFO ] Flatten gal took : 11 ms
[2026-06-10 16:07:41] [INFO ] Flatten gal took : 11 ms
[2026-06-10 16:07:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality8968930197303370391.gal : 3 ms
[2026-06-10 16:07:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5137464892556428989.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/CTLCardinality8968930197303370391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5137464892556428989.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12982e+06,0.865789,18988,2,11811,5,50520,6,0,1837,31328,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 t221, t226, t242, t247, t263, t268, t284, t289, t300, t305, t420, t421, t422, t423, t424, t42...283
(forward)formula 0,1,12.1863,279168,1,0,167,967149,535,95,7444,626359,526
FORMULA FileSystem-PT-N03I10B10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-06-10 16:07:53] [INFO ] Flatten gal took : 21 ms
[2026-06-10 16:07:53] [INFO ] Flatten gal took : 21 ms
Total runtime 319142 ms.

BK_STOP 1781107673632

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

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