fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
784.911 697505.00 803940.00 2211.00 FTTFTFFTFFTTFTTF 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-178021499300458.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is FileSystem-PT-N05I10B10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 7.8K May 27 10:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 27 10:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 27 10:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 27 10:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 43K May 27 10:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 150K May 27 10:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 27 10:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 27 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 27 10:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 27 10:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K May 27 10:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K May 27 10:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 236K Jun 10 11:57 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1781108314014

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N05I10B10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-06-10 16:18:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 16:18:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 16:18:37] [INFO ] Load time of PNML (sax parser for PT used): 289 ms
[2026-06-10 16:18:37] [INFO ] Transformed 561 places.
[2026-06-10 16:18:37] [INFO ] Transformed 520 transitions.
[2026-06-10 16:18:37] [INFO ] Parsed PT model containing 561 places and 520 transitions and 1850 arcs in 526 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Reduce places removed 10 places and 0 transitions.
Support contains 110 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 520/520 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 451 transition count 520
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 171 place count 380 transition count 449
Iterating global reduction 1 with 71 rules applied. Total rules applied 242 place count 380 transition count 449
Applied a total of 242 rules in 196 ms. Remains 380 /551 variables (removed 171) and now considering 449/520 (removed 71) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8940122026013390468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4312808429914771664.kers'
[2026-06-10 16:18:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8940122026013390468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4312808429914771664.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 449 rows 370 cols 1237 entries
Finished phase 1 with 358 SingleSign rule and 0 generalized
[2026-06-10 16:18:37] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4312808429914771664.kers
Total runtime 7 ms.
[2026-06-10 16:18:38] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2026-06-10 16:18:38] [INFO ] Invariant cache hit.
[2026-06-10 16:18:39] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:18:42] [INFO ] Implicit Places using invariants and state equation in 4310 ms returned []
Implicit Place search using SMT with State Equation took 5387 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2026-06-10 16:18:43] [INFO ] Invariant cache hit.
[2026-06-10 16:18:43] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 11/380 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/829 variables, and 38 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/380 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 11/380 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/829 variables, and 65 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/380 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/439 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 60483ms
Starting structural reductions in LTL mode, iteration 1 : 380/551 places, 449/520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66148 ms. Remains : 380/551 places, 449/520 transitions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 449/449 transitions.
Applied a total of 0 rules in 15 ms. Remains 380 /380 variables (removed 0) and now considering 449/449 (removed 0) transitions.
[2026-06-10 16:19:43] [INFO ] Invariant cache hit.
[2026-06-10 16:19:43] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-06-10 16:19:43] [INFO ] Invariant cache hit.
[2026-06-10 16:19:44] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:19:48] [INFO ] Implicit Places using invariants and state equation in 4183 ms returned []
Implicit Place search using SMT with State Equation took 4570 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4588 ms. Remains : 380/380 places, 449/449 transitions.
Support contains 110 out of 380 places after structural reductions.
[2026-06-10 16:19:48] [INFO ] Flatten gal took : 127 ms
[2026-06-10 16:19:48] [INFO ] Flatten gal took : 68 ms
[2026-06-10 16:19:48] [INFO ] Input system was already deterministic with 449 transitions.
RANDOM walk for 40000 steps (604 resets) in 2948 ms. (13 steps per ms) remains 55/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (10 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (9 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (9 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
[2026-06-10 16:19:50] [INFO ] Invariant cache hit.
[2026-06-10 16:19:50] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 290/380 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 55 unsolved
SMT process timed out in 5149ms, After SMT, problems are : Problem set: 0 solved, 55 unsolved
Fused 55 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 90 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 449/449 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 10 place count 380 transition count 439
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 370 transition count 439
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 363 transition count 432
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 363 transition count 432
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 66 place count 347 transition count 416
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 80 place count 347 transition count 402
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 94 place count 333 transition count 402
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 333 transition count 402
Applied a total of 100 rules in 122 ms. Remains 333 /380 variables (removed 47) and now considering 402/449 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 333/380 places, 402/449 transitions.
RANDOM walk for 40000 steps (952 resets) in 801 ms. (49 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 42 ms. (93 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 48 ms. (81 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (15 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (16 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 38 ms. (102 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (15 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (16 resets) in 39 ms. (100 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (16 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 51 ms. (76 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 35 ms. (111 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (15 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (15 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
Interrupted probabilistic random walk after 299313 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 55
Probabilistic random walk after 299313 steps, saw 52998 distinct states, run finished after 3008 ms. (steps per millisecond=99 ) 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-18070066580605444209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5410040813780220322.kers'
[2026-06-10 16:19:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18070066580605444209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5410040813780220322.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 402 rows 323 cols 1126 entries
Finished phase 1 with 311 SingleSign rule and 0 generalized
[2026-06-10 16:19:59] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5410040813780220322.kers
Total runtime 4 ms.
[2026-06-10 16:19:59] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 243/333 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 9 (OVERLAPS) 402/735 variables, 333/407 constraints. Problems are: Problem set: 2 solved, 53 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/735 variables, 100/507 constraints. Problems are: Problem set: 11 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/735 variables, 0/507 constraints. Problems are: Problem set: 11 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/735 variables, 0/507 constraints. Problems are: Problem set: 11 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 735/735 variables, and 507 constraints, problems are : Problem set: 11 solved, 44 unsolved in 39505 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 333/333 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 11 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 262/332 variables, 17/21 constraints. Problems are: Problem set: 11 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 52/73 constraints. Problems are: Problem set: 11 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 0/73 constraints. Problems are: Problem set: 11 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 1/333 variables, 1/74 constraints. Problems are: Problem set: 11 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/74 constraints. Problems are: Problem set: 11 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 402/735 variables, 333/407 constraints. Problems are: Problem set: 11 solved, 44 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 100/507 constraints. Problems are: Problem set: 47 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/735 variables, 8/515 constraints. Problems are: Problem set: 47 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/735 variables, 0/515 constraints. Problems are: Problem set: 47 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/735 variables, 0/515 constraints. Problems are: Problem set: 47 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 735/735 variables, and 515 constraints, problems are : Problem set: 47 solved, 8 unsolved in 9628 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 333/333 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 8/55 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49166ms problems are : Problem set: 47 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2444 ms.
Support contains 14 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 402/402 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 329 transition count 398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 329 transition count 398
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 0 with 184 rules applied. Total rules applied 192 place count 237 transition count 306
Free-agglomeration rule (complex) applied 84 times.
Iterating global reduction 0 with 84 rules applied. Total rules applied 276 place count 237 transition count 228
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 0 with 87 rules applied. Total rules applied 363 place count 150 transition count 228
Applied a total of 363 rules in 87 ms. Remains 150 /333 variables (removed 183) and now considering 228/402 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 150/333 places, 228/402 transitions.
RANDOM walk for 40000 steps (1951 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (316 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (316 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (316 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (317 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (317 resets) in 72 ms. (547 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (316 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (314 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (316 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
Probably explored full state space saw : 30272 states, properties seen :0
Probabilistic random walk after 196288 steps, saw 30272 distinct states, run finished after 1250 ms. (steps per millisecond=157 ) properties seen :0
Explored full state space saw : 30272 states, properties seen :0
Exhaustive walk after 196288 steps, saw 30272 distinct states, run finished after 1237 ms. (steps per millisecond=158 ) properties seen :0
Successfully simplified 55 atomic propositions for a total of 16 simplifications.
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 16:20:54] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-06-10 16:20:54] [INFO ] Flatten gal took : 33 ms
[2026-06-10 16:20:54] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 16:20:54] [INFO ] Flatten gal took : 32 ms
[2026-06-10 16:20:54] [INFO ] Input system was already deterministic with 449 transitions.
Support contains 16 out of 380 places (down from 24) after GAL structural reductions.
Computed a total of 70 stabilizing places and 149 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 449/449 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 431
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 431
Applied a total of 36 rules in 15 ms. Remains 362 /380 variables (removed 18) and now considering 431/449 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12061345688678492604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7338781567012368713.kers'
[2026-06-10 16:20:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12061345688678492604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7338781567012368713.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 431 rows 352 cols 1183 entries
Finished phase 1 with 340 SingleSign rule and 0 generalized
[2026-06-10 16:20:54] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7338781567012368713.kers
Total runtime 6 ms.
[2026-06-10 16:20:54] [INFO ] Implicit Places using invariants in 268 ms returned []
[2026-06-10 16:20:54] [INFO ] Invariant cache hit.
[2026-06-10 16:20:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:20:56] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2150 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2026-06-10 16:20:56] [INFO ] Invariant cache hit.
[2026-06-10 16:20:56] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 11/362 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/793 variables, and 40 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/362 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 11/362 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (OVERLAPS) 431/793 variables, 362/402 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 100/502 constraints. Problems are: Problem set: 340 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/793 variables, 81/583 constraints. Problems are: Problem set: 340 solved, 81 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/793 variables, and 583 constraints, problems are : Problem set: 340 solved, 81 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 362/362 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 81/421 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 340 solved, 81 unsolved
Search for dead transitions found 340 dead transitions in 60118ms
Found 340 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 340 transitions
Dead transitions reduction (with SMT) removed 340 transitions
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 91/449 transitions.
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 0 with 255 rules applied. Total rules applied 255 place count 107 transition count 91
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 259 place count 103 transition count 87
Iterating global reduction 1 with 4 rules applied. Total rules applied 263 place count 103 transition count 87
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 267 place count 99 transition count 83
Iterating global reduction 1 with 4 rules applied. Total rules applied 271 place count 99 transition count 83
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 275 place count 95 transition count 79
Iterating global reduction 1 with 4 rules applied. Total rules applied 279 place count 95 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 283 place count 91 transition count 71
Iterating global reduction 1 with 4 rules applied. Total rules applied 287 place count 91 transition count 71
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 291 place count 87 transition count 67
Iterating global reduction 1 with 4 rules applied. Total rules applied 295 place count 87 transition count 67
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 298 place count 84 transition count 64
Iterating global reduction 1 with 3 rules applied. Total rules applied 301 place count 84 transition count 64
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 304 place count 81 transition count 61
Iterating global reduction 1 with 3 rules applied. Total rules applied 307 place count 81 transition count 61
Applied a total of 307 rules in 20 ms. Remains 81 /362 variables (removed 281) and now considering 61/91 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3415268483668234167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-401054266131816806.kers'
[2026-06-10 16:21:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3415268483668234167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-401054266131816806.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 61 rows 76 cols 170 entries
Finished phase 1 with 55 SingleSign rule and 5 generalized
[2026-06-10 16:21:56] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-401054266131816806.kers
Total runtime 1 ms.
[2026-06-10 16:21:56] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-06-10 16:21:56] [INFO ] Invariant cache hit.
[2026-06-10 16:21:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-06-10 16:21:56] [INFO ] Implicit Places using invariants and state equation in 180 ms returned [14, 17, 20, 23, 26, 54, 56, 58, 60, 62]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 313 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 71/380 places, 61/449 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 57
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 57
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 63 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 63 transition count 53
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 59 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 59 transition count 49
Applied a total of 24 rules in 12 ms. Remains 59 /71 variables (removed 12) and now considering 49/61 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12436892159272931951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1562133312561034925.kers'
[2026-06-10 16:21:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12436892159272931951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1562133312561034925.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 49 rows 54 cols 128 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-06-10 16:21:56] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1562133312561034925.kers
Total runtime 0 ms.
[2026-06-10 16:21:56] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-06-10 16:21:56] [INFO ] Invariant cache hit.
[2026-06-10 16:21:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-06-10 16:21:57] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 59/380 places, 49/449 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62821 ms. Remains : 59/380 places, 49/449 transitions.
[2026-06-10 16:21:57] [INFO ] Flatten gal took : 6 ms
[2026-06-10 16:21:57] [INFO ] Flatten gal took : 5 ms
[2026-06-10 16:21:57] [INFO ] Input system was already deterministic with 49 transitions.
[2026-06-10 16:21:57] [INFO ] Flatten gal took : 5 ms
[2026-06-10 16:21:57] [INFO ] Flatten gal took : 4 ms
[2026-06-10 16:21:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2634487650679190714.gal : 3 ms
[2026-06-10 16:21:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6046042015554324511.ctl : 6 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/CTLFireability2634487650679190714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6046042015554324511.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AG(((initblock_2<1) + EX((endloop_5_20<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((initblock_2<1) + EX((endloop_5_20<1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t32, t33, t36, t37, t38, t39, t40, t42, t43, t44, t45, t46, t47, t48, Intersection...240
(forward)formula 0,1,3.90912,104268,1,0,118,610462,118,53,1534,635308,106
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(!(((endloop_7_14>=1) * AG((endloop_4_17>=1)))) U AX(AG(AF(((busy_13_22>=1)&&(testbusy_2_13>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,!(((endloop_7_14>=1) * !(E(TRUE U !((endloop_4_17>=1))))))) * !(EX(!(!(E(TRUE U !(!(EG(!(((busy_13_2...201
Reverse transition relation is NOT exact ! Due to transitions t32, t33, t41, t42, t43, t44, t47, t48, t49, t50, t51, t52, t53, t54, t55, Intersection with...235
(forward)formula 0,1,11.4137,289628,1,0,560,1.91361e+06,143,263,1944,1.94166e+06,596
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EX(TRUE) * AX(((EG(EX(TRUE)) + (beginloop_3_15<1)) + (lockb_15<1))))
=> equivalent forward existential formula: ([(Init * !(EX(TRUE)))] = FALSE * [(((EY(Init) * !((lockb_15<1))) * !((beginloop_3_15<1))) * !(EG(EX(TRUE))))] =...162
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, Intersection with reachable a...223
(forward)formula 0,1,9.58842,222396,1,0,168,1.2529e+06,106,52,1370,1.37183e+06,158
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AF(AX(FALSE)) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(!(EG(!(!(EX(!(FALSE))))))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, Intersection with reachable at each s...215
(forward)formula 0,1,7.77902,177428,1,0,157,997771,96,43,1282,1.10398e+06,149
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 380/380 places, 449/449 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 10 place count 380 transition count 439
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 370 transition count 439
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 38 place count 352 transition count 421
Iterating global reduction 2 with 18 rules applied. Total rules applied 56 place count 352 transition count 421
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 252 place count 254 transition count 323
Applied a total of 252 rules in 49 ms. Remains 254 /380 variables (removed 126) and now considering 323/449 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8181482446272005213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5048085042067136402.kers'
[2026-06-10 16:25:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8181482446272005213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5048085042067136402.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 323 rows 244 cols 1048 entries
Finished phase 1 with 232 SingleSign rule and 0 generalized
[2026-06-10 16:25:39] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5048085042067136402.kers
Total runtime 3 ms.
[2026-06-10 16:25:39] [INFO ] Implicit Places using invariants in 455 ms returned []
[2026-06-10 16:25:39] [INFO ] Invariant cache hit.
[2026-06-10 16:25:40] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:25:42] [INFO ] Implicit Places using invariants and state equation in 2518 ms returned []
Implicit Place search using SMT with State Equation took 2979 ms to find 0 implicit places.
[2026-06-10 16:25:42] [INFO ] Redundant transitions in 21 ms returned []
Running 313 sub problems to find dead transitions.
[2026-06-10 16:25:42] [INFO ] Invariant cache hit.
[2026-06-10 16:25:42] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 11/254 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (OVERLAPS) 323/577 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD274 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 100/389 constraints. Problems are: Problem set: 18 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/577 variables, and 389 constraints, problems are : Problem set: 18 solved, 295 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 254/254 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 19/19 constraints. Problems are: Problem set: 18 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 1/20 constraints. Problems are: Problem set: 18 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/20 constraints. Problems are: Problem set: 18 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 13/254 variables, 3/23 constraints. Problems are: Problem set: 18 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 12/35 constraints. Problems are: Problem set: 18 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 18 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 323/577 variables, 254/289 constraints. Problems are: Problem set: 18 solved, 295 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 100/389 constraints. Problems are: Problem set: 261 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 52/441 constraints. Problems are: Problem set: 261 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 0/441 constraints. Problems are: Problem set: 261 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/577 variables, 0/441 constraints. Problems are: Problem set: 261 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 577/577 variables, and 441 constraints, problems are : Problem set: 261 solved, 52 unsolved in 28556 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 254/254 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 52/313 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58620ms problems are : Problem set: 261 solved, 52 unsolved
Search for dead transitions found 261 dead transitions in 58622ms
Found 261 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 261 transitions
Dead transitions reduction (with SMT) removed 261 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 254/380 places, 62/449 transitions.
Graph (complete) has 181 edges and 254 vertex of which 79 are kept as prefixes of interest. Removing 175 places using SCC suffix rule.2 ms
Discarding 175 places :
Also discarding 0 output transitions
Reduce places removed 0 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 74 transition count 56
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 74 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 74 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 73 transition count 55
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 68 transition count 50
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 68 transition count 50
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 23 place count 68 transition count 46
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 35 place count 60 transition count 46
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 39 place count 56 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 43 place count 56 transition count 38
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 47 place count 52 transition count 34
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 51 place count 52 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 51 place count 52 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 63 place count 44 transition count 30
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 67 place count 40 transition count 26
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 71 place count 40 transition count 26
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 71 rules in 27 ms. Remains 40 /254 variables (removed 214) and now considering 26/62 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-723797781667417029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-338619505300352664.kers'
[2026-06-10 16:26:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-723797781667417029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-338619505300352664.kers]
Culling trivial invariants: removing 2 columns.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 26 rows 32 cols 75 entries
Finished phase 1 with 19 SingleSign rule and 6 generalized
[2026-06-10 16:26:41] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-338619505300352664.kers
Total runtime 0 ms.
[2026-06-10 16:26:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-06-10 16:26:41] [INFO ] Invariant cache hit.
[2026-06-10 16:26:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-06-10 16:26:41] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [14, 20, 23, 26]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 124 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 36/380 places, 26/449 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 34 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 34 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 33 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 6 rules in 3 ms. Remains 33 /36 variables (removed 3) and now considering 23/26 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7288705216308443928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10612931020170176619.kers'
[2026-06-10 16:26:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7288705216308443928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10612931020170176619.kers]
Culling trivial invariants: removing 2 columns.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 23 rows 25 cols 65 entries
Finished phase 1 with 19 SingleSign rule and 3 generalized
[2026-06-10 16:26:41] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10612931020170176619.kers
Total runtime 1 ms.
[2026-06-10 16:26:41] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-06-10 16:26:41] [INFO ] Invariant cache hit.
[2026-06-10 16:26:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-06-10 16:26:41] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 33/380 places, 23/449 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 61958 ms. Remains : 33/380 places, 23/449 transitions.
[2026-06-10 16:26:41] [INFO ] Found a total of 2 fixed domain variables (out of 33 variables) in GAL type petri
[2026-06-10 16:26:41] [INFO ] Found a total of 2 constant array cells/variables (out of 33 variables) in type petri
[2026-06-10 16:26:41] [INFO ] beginloop_1_18,endloop_7_18,
[2026-06-10 16:26:41] [INFO ] Removed 2 constant variables :beginloop_1_18=0, endloop_7_18=0
[2026-06-10 16:26:41] [INFO ] Simplified 2 expressions due to constant valuations.
[2026-06-10 16:26:41] [INFO ] Flatten gal took : 7 ms
[2026-06-10 16:26:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 16:26:41] [INFO ] Input system was already deterministic with 23 transitions.
Support contains 2 out of 31 places (down from 5) after GAL structural reductions.
[2026-06-10 16:26:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 16:26:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 16:26:41] [INFO ] Time to serialize gal into /tmp/CTLFireability8933272310833508215.gal : 0 ms
[2026-06-10 16:26:41] [INFO ] Time to serialize properties into /tmp/CTLFireability7529907361367374340.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/CTLFireability8933272310833508215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7529907361367374340.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,24046,0.016416,4228,2,233,5,2059,6,0,128,1504,0


Converting to forward existential form...Done !
original formula: AG(EF(((busy_13_21>=1)&&(testbusy_2_13>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((busy_13_21>=1)&&(testbusy_2_13>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t13, t15, t16, t17, t18, t20, t21, t22, Intersection with reachable at each step en...209
(forward)formula 0,0,0.075601,5996,1,0,70,13825,67,31,805,11291,64
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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


Converting to forward existential form...Done !
original formula: AF(EG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, Intersection with reachable at each s...215
dead was empty
(forward)formula 0,1,8.04337,177460,1,0,159,997989,96,47,1281,1.10429e+06,155
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 380/380 places, 449/449 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 380 transition count 440
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 371 transition count 440
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 37 place count 352 transition count 421
Iterating global reduction 2 with 19 rules applied. Total rules applied 56 place count 352 transition count 421
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 252 place count 254 transition count 323
Applied a total of 252 rules in 35 ms. Remains 254 /380 variables (removed 126) and now considering 323/449 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4938659021474861699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14453423087783520815.kers'
[2026-06-10 16:27:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4938659021474861699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14453423087783520815.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 323 rows 244 cols 1047 entries
Finished phase 1 with 232 SingleSign rule and 0 generalized
[2026-06-10 16:27:52] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14453423087783520815.kers
Total runtime 3 ms.
[2026-06-10 16:27:52] [INFO ] Implicit Places using invariants in 547 ms returned []
[2026-06-10 16:27:52] [INFO ] Invariant cache hit.
[2026-06-10 16:27:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-06-10 16:27:55] [INFO ] Implicit Places using invariants and state equation in 2453 ms returned []
Implicit Place search using SMT with State Equation took 3002 ms to find 0 implicit places.
[2026-06-10 16:27:55] [INFO ] Redundant transitions in 7 ms returned []
Running 313 sub problems to find dead transitions.
[2026-06-10 16:27:55] [INFO ] Invariant cache hit.
[2026-06-10 16:27:55] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 11/254 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 323/577 variables, 254/287 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD318 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 100/387 constraints. Problems are: Problem set: 21 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/577 variables, and 387 constraints, problems are : Problem set: 21 solved, 292 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 254/254 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 19/19 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 1/20 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/20 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 12/254 variables, 3/23 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 10/33 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/33 constraints. Problems are: Problem set: 21 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 323/577 variables, 254/287 constraints. Problems are: Problem set: 21 solved, 292 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 100/387 constraints. Problems are: Problem set: 259 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 54/441 constraints. Problems are: Problem set: 259 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 0/441 constraints. Problems are: Problem set: 259 solved, 54 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/577 variables, and 441 constraints, problems are : Problem set: 259 solved, 54 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 254/254 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 54/313 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 259 solved, 54 unsolved
Search for dead transitions found 259 dead transitions in 60088ms
Found 259 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 259 transitions
Dead transitions reduction (with SMT) removed 259 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 254/380 places, 64/449 transitions.
Graph (complete) has 183 edges and 254 vertex of which 80 are kept as prefixes of interest. Removing 174 places using SCC suffix rule.1 ms
Discarding 174 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 75 transition count 59
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 75 transition count 59
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 70 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 70 transition count 54
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 21 place count 70 transition count 49
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 36 place count 60 transition count 49
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 55 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 55 transition count 40
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 50 transition count 34
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 50 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 56 place count 50 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 42 transition count 30
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 38 transition count 26
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 38 transition count 26
Applied a total of 76 rules in 12 ms. Remains 38 /254 variables (removed 216) and now considering 26/64 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15827973780579794646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7278916193279020639.kers'
[2026-06-10 16:28:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15827973780579794646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7278916193279020639.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 26 rows 33 cols 72 entries
Finished phase 1 with 20 SingleSign rule and 6 generalized
[2026-06-10 16:28:55] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7278916193279020639.kers
Total runtime 1 ms.
[2026-06-10 16:28:55] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-06-10 16:28:55] [INFO ] Invariant cache hit.
[2026-06-10 16:28:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:28:55] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [13, 16, 19, 22, 25]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 133 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 33/380 places, 26/449 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 29 transition count 22
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 29 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 28 transition count 21
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 27 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 27 transition count 20
Applied a total of 12 rules in 2 ms. Remains 27 /33 variables (removed 6) and now considering 20/26 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-639748034311215553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9111189299713598404.kers'
[2026-06-10 16:28:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-639748034311215553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9111189299713598404.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 20 rows 22 cols 54 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-06-10 16:28:55] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9111189299713598404.kers
Total runtime 0 ms.
[2026-06-10 16:28:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-06-10 16:28:55] [INFO ] Invariant cache hit.
[2026-06-10 16:28:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-10 16:28:55] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 27/380 places, 20/449 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 63389 ms. Remains : 27/380 places, 20/449 transitions.
[2026-06-10 16:28:55] [INFO ] Flatten gal took : 2 ms
[2026-06-10 16:28:55] [INFO ] Flatten gal took : 1 ms
[2026-06-10 16:28:55] [INFO ] Input system was already deterministic with 20 transitions.
[2026-06-10 16:28:55] [INFO ] Flatten gal took : 2 ms
[2026-06-10 16:28:55] [INFO ] Flatten gal took : 1 ms
[2026-06-10 16:28:55] [INFO ] Time to serialize gal into /tmp/CTLFireability7798202096943113275.gal : 1 ms
[2026-06-10 16:28:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3766989399000510131.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/CTLFireability7798202096943113275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3766989399000510131.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,26232,0.09649,6952,2,2119,5,17276,6,0,110,19462,0


Converting to forward existential form...Done !
original formula: EG(((beginloop_1_11<1)||(lockb_11<1)))
=> equivalent forward existential formula: [FwdG(Init,((beginloop_1_11<1)||(lockb_11<1)))] != FALSE
Hit Full ! (commute/partial/dont) 16/0/4
(forward)formula 0,0,1.28379,33680,1,0,33,161195,18,4,594,178262,32
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(!(A(!(AX(FALSE)) U AG(((idle>=1)&&(inodelist_7>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(!(E(TRUE U !(((idle>=1)&&(inodelist_7>=1)))))) U (!(!(!(EX(!(FALSE))))) * !(!(E(TRUE U !(((i...256
Reverse transition relation is NOT exact ! Due to transitions t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, Intersection with reachable at each s...215
(forward)formula 0,1,11.5496,279824,1,0,218,1.60107e+06,103,77,1414,1.79971e+06,234
FORMULA FileSystem-PT-N05I10B10-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-06-10 16:30:11] [INFO ] Flatten gal took : 22 ms
[2026-06-10 16:30:11] [INFO ] Flatten gal took : 20 ms
Total runtime 694849 ms.

BK_STOP 1781109011519

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FileSystem-PT-N05I10B10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FileSystem-PT-N05I10B10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499300458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N05I10B10.tgz
mv FileSystem-PT-N05I10B10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;