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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 27 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 27 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 27 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 45K May 27 10:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 157K May 27 10:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 27 10:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 27 10:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 4.5K May 27 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 27 10:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K May 27 10:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 39K May 27 10:48 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 524K 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-N02I15B15-CTLFireability-2024-00
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-01
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-02
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-03
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-04
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-05
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-06
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-07
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-08
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-09
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-10
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-11
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-12
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-13
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-14
FORMULA_NAME FileSystem-PT-N02I15B15-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1781104389948

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-N02I15B15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-06-10 15:13:12] [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 15:13:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 15:13:13] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2026-06-10 15:13:13] [INFO ] Transformed 1216 places.
[2026-06-10 15:13:13] [INFO ] Transformed 1155 transitions.
[2026-06-10 15:13:13] [INFO ] Parsed PT model containing 1216 places and 1155 transitions and 4125 arcs in 560 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Reduce places removed 15 places and 0 transitions.
Support contains 138 out of 1201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1201/1201 places, 1155/1155 transitions.
Reduce places removed 225 places and 0 transitions.
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 976 transition count 1155
Discarding 184 places :
Symmetric choice reduction at 1 with 184 rule applications. Total rules 409 place count 792 transition count 971
Iterating global reduction 1 with 184 rules applied. Total rules applied 593 place count 792 transition count 971
Applied a total of 593 rules in 294 ms. Remains 792 /1201 variables (removed 409) and now considering 971/1155 (removed 184) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2886743962868467978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6961448680976637549.kers'
[2026-06-10 15:13:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2886743962868467978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6961448680976637549.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 971 rows 777 cols 2673 entries
Finished phase 1 with 760 SingleSign rule and 0 generalized
[2026-06-10 15:13:13] [INFO ] Computed 32 invariants in 23 ms
Computed 32 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-6961448680976637549.kers
Total runtime 31 ms.
[2026-06-10 15:13:14] [INFO ] Implicit Places using invariants in 1309 ms returned []
[2026-06-10 15:13:14] [INFO ] Invariant cache hit.
[2026-06-10 15:13:16] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:13:18] [INFO ] Implicit Places using invariants and state equation in 3853 ms returned []
Implicit Place search using SMT with State Equation took 5231 ms to find 0 implicit places.
Running 956 sub problems to find dead transitions.
[2026-06-10 15:13:18] [INFO ] Invariant cache hit.
[2026-06-10 15:13:18] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 776/1763 variables, and 30 constraints, problems are : Problem set: 0 solved, 956 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/792 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 956/956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 956 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/776 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 776/1763 variables, and 30 constraints, problems are : Problem set: 0 solved, 956 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/792 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 0/956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60909ms problems are : Problem set: 0 solved, 956 unsolved
Search for dead transitions found 0 dead transitions in 60956ms
Starting structural reductions in LTL mode, iteration 1 : 792/1201 places, 971/1155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66573 ms. Remains : 792/1201 places, 971/1155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 971/971 transitions.
Applied a total of 0 rules in 32 ms. Remains 792 /792 variables (removed 0) and now considering 971/971 (removed 0) transitions.
[2026-06-10 15:14:19] [INFO ] Invariant cache hit.
[2026-06-10 15:14:20] [INFO ] Implicit Places using invariants in 797 ms returned []
[2026-06-10 15:14:20] [INFO ] Invariant cache hit.
[2026-06-10 15:14:21] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:14:24] [INFO ] Implicit Places using invariants and state equation in 3464 ms returned []
Implicit Place search using SMT with State Equation took 4265 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4297 ms. Remains : 792/792 places, 971/971 transitions.
Support contains 138 out of 792 places after structural reductions.
[2026-06-10 15:14:24] [INFO ] Flatten gal took : 142 ms
[2026-06-10 15:14:24] [INFO ] Flatten gal took : 137 ms
[2026-06-10 15:14:25] [INFO ] Input system was already deterministic with 971 transitions.
Support contains 133 out of 792 places (down from 138) after GAL structural reductions.
RANDOM walk for 40000 steps (524 resets) in 3045 ms. (13 steps per ms) remains 78/83 properties
BEST_FIRST walk for 4003 steps (11 resets) in 74 ms. (53 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (11 resets) in 70 ms. (56 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (12 resets) in 80 ms. (49 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (12 resets) in 93 ms. (42 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (12 resets) in 104 ms. (38 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (11 resets) in 106 ms. (37 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (11 resets) in 57 ms. (69 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (12 resets) in 37 ms. (105 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (11 resets) in 52 ms. (75 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (10 resets) in 37 ms. (105 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (11 resets) in 42 ms. (93 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (11 resets) in 47 ms. (83 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (10 resets) in 39 ms. (100 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (12 resets) in 40 ms. (97 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (11 resets) in 95 ms. (41 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (10 resets) in 44 ms. (88 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (12 resets) in 45 ms. (87 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (12 resets) in 39 ms. (100 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (12 resets) in 40 ms. (97 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (12 resets) in 53 ms. (74 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (10 resets) in 40 ms. (97 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (12 resets) in 37 ms. (105 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (12 resets) in 36 ms. (108 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (11 resets) in 36 ms. (108 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (10 resets) in 35 ms. (111 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (11 resets) in 39 ms. (100 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (12 resets) in 39 ms. (100 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (9 resets) in 36 ms. (108 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (11 resets) in 38 ms. (102 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (12 resets) in 34 ms. (114 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (10 resets) in 51 ms. (76 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (10 resets) in 23 ms. (166 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (11 resets) in 35 ms. (111 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (12 resets) in 37 ms. (105 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (11 resets) in 36 ms. (108 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (12 resets) in 35 ms. (111 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (11 resets) in 35 ms. (111 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (12 resets) in 34 ms. (114 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (9 resets) in 32 ms. (121 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (9 resets) in 35 ms. (111 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (11 resets) in 37 ms. (105 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (10 resets) in 35 ms. (111 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (10 resets) in 34 ms. (114 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (11 resets) in 69 ms. (57 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (10 resets) in 28 ms. (138 steps per ms) remains 78/78 properties
Interrupted probabilistic random walk after 131452 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 78
Probabilistic random walk after 131452 steps, saw 40521 distinct states, run finished after 3007 ms. (steps per millisecond=43 ) properties seen :0
[2026-06-10 15:14:29] [INFO ] Invariant cache hit.
[2026-06-10 15:14:29] [INFO ] State equation strengthened by 225 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (OVERLAPS) 664/791 variables, 24/31 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/791 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 1/792 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/792 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 76 unsolved
SMT process timed out in 5056ms, After SMT, problems are : Problem set: 2 solved, 76 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 123 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 971/971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 792 transition count 956
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 777 transition count 956
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 773 transition count 952
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 773 transition count 952
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 5 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 184 place count 700 transition count 879
Free-agglomeration rule (complex) applied 64 times.
Iterating global reduction 2 with 64 rules applied. Total rules applied 248 place count 700 transition count 815
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 312 place count 636 transition count 815
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 324 place count 636 transition count 815
Applied a total of 324 rules in 419 ms. Remains 636 /792 variables (removed 156) and now considering 815/971 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 420 ms. Remains : 636/792 places, 815/971 transitions.
RANDOM walk for 40000 steps (972 resets) in 1823 ms. (21 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 22 ms. (174 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 43 ms. (90 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 26 ms. (148 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 21 ms. (182 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 33 ms. (117 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 25 ms. (154 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 33 ms. (117 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 34 ms. (114 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 26 ms. (148 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 24 ms. (160 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 24 ms. (160 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (16 resets) in 23 ms. (166 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 30 ms. (129 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 21 ms. (182 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 24 ms. (160 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (16 resets) in 15 ms. (250 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 40 ms. (97 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 21 ms. (182 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (16 resets) in 18 ms. (210 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 76/76 properties
Interrupted probabilistic random walk after 186893 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 76
Probabilistic random walk after 186893 steps, saw 51291 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) 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-6457237593594839593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11942144633905296238.kers'
[2026-06-10 15:14:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6457237593594839593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11942144633905296238.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 815 rows 621 cols 2267 entries
Finished phase 1 with 604 SingleSign rule and 0 generalized
[2026-06-10 15:14:39] [INFO ] Computed 32 invariants in 9 ms
Computed 32 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-11942144633905296238.kers
Total runtime 10 ms.
[2026-06-10 15:14:39] [INFO ] State equation strengthened by 225 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 512/635 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/635 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 1/636 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/636 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 815/1451 variables, 636/668 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1451 variables, 225/893 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1451 variables, 0/893 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/1451 variables, 0/893 constraints. Problems are: Problem set: 6 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1451/1451 variables, and 893 constraints, problems are : Problem set: 6 solved, 70 unsolved in 38679 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 636/636 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 519/635 variables, 24/31 constraints. Problems are: Problem set: 6 solved, 70 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/635 variables, 20/51 constraints. Problems are: Problem set: 59 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 20/71 constraints. Problems are: Problem set: 59 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 9/80 constraints. Problems are: Problem set: 59 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/80 constraints. Problems are: Problem set: 59 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/636 variables, 1/81 constraints. Problems are: Problem set: 59 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/636 variables, 10/91 constraints. Problems are: Problem set: 59 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/636 variables, 3/94 constraints. Problems are: Problem set: 59 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 3/97 constraints. Problems are: Problem set: 59 solved, 17 unsolved
SMT process timed out in 84046ms, After SMT, problems are : Problem set: 59 solved, 17 unsolved
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 636/636 places, 815/815 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 633 transition count 812
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 633 transition count 812
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 1 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 0 with 330 rules applied. Total rules applied 336 place count 468 transition count 647
Free-agglomeration rule (complex) applied 158 times.
Iterating global reduction 0 with 158 rules applied. Total rules applied 494 place count 468 transition count 500
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 0 with 160 rules applied. Total rules applied 654 place count 308 transition count 500
Applied a total of 654 rules in 244 ms. Remains 308 /636 variables (removed 328) and now considering 500/815 (removed 315) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 308/636 places, 500/815 transitions.
RANDOM walk for 40000 steps (2000 resets) in 1118 ms. (35 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (24 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (24 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (24 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (24 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (24 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 517061 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 17
Probabilistic random walk after 517061 steps, saw 80494 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) 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-5007972215182870986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7437694518112130477.kers'
[2026-06-10 15:16:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5007972215182870986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7437694518112130477.kers]
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 0 ms.
// Phase 1: matrix 500 rows 286 cols 1276 entries
Finished phase 1 with 278 SingleSign rule and 0 generalized
[2026-06-10 15:16:07] [INFO ] Computed 30 invariants in 3 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7437694518112130477.kers
Total runtime 5 ms.
[2026-06-10 15:16:07] [INFO ] State equation strengthened by 236 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 269/295 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 13/308 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 500/808 variables, 308/338 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 236/574 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/808 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 574 constraints, problems are : Problem set: 0 solved, 17 unsolved in 8055 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 308/308 constraints, ReadFeed: 236/236 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 269/295 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 20/237 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 17 unsolved
SMT process timed out in 83201ms, After SMT, problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 500/500 transitions.
Applied a total of 0 rules in 30 ms. Remains 308 /308 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 308/308 places, 500/500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 500/500 transitions.
Applied a total of 0 rules in 32 ms. Remains 308 /308 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2026-06-10 15:17:30] [INFO ] Invariant cache hit.
[2026-06-10 15:17:31] [INFO ] Implicit Places using invariants in 865 ms returned []
[2026-06-10 15:17:31] [INFO ] Invariant cache hit.
[2026-06-10 15:17:31] [INFO ] State equation strengthened by 236 read => feed constraints.
[2026-06-10 15:17:37] [INFO ] Implicit Places using invariants and state equation in 6736 ms returned []
Implicit Place search using SMT with State Equation took 7603 ms to find 0 implicit places.
[2026-06-10 15:17:37] [INFO ] Redundant transitions in 34 ms returned []
Running 485 sub problems to find dead transitions.
[2026-06-10 15:17:37] [INFO ] Invariant cache hit.
[2026-06-10 15:17:37] [INFO ] State equation strengthened by 236 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 485 unsolved
SMT process timed out in 30364ms, After SMT, problems are : Problem set: 0 solved, 485 unsolved
Search for dead transitions found 0 dead transitions in 30369ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38048 ms. Remains : 308/308 places, 500/500 transitions.
Successfully simplified 61 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 15:18:08] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2026-06-10 15:18:08] [INFO ] Flatten gal took : 89 ms
[2026-06-10 15:18:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 15:18:08] [INFO ] Flatten gal took : 85 ms
[2026-06-10 15:18:08] [INFO ] Input system was already deterministic with 971 transitions.
Support contains 14 out of 792 places (down from 23) after GAL structural reductions.
Computed a total of 102 stabilizing places and 296 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 971/971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 792 transition count 956
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 777 transition count 956
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 56 place count 751 transition count 930
Iterating global reduction 2 with 26 rules applied. Total rules applied 82 place count 751 transition count 930
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Deduced a syphon composed of 240 places in 0 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 2 with 480 rules applied. Total rules applied 562 place count 511 transition count 690
Applied a total of 562 rules in 148 ms. Remains 511 /792 variables (removed 281) and now considering 690/971 (removed 281) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18267056455975918174.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2372166053882799966.kers'
[2026-06-10 15:18:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18267056455975918174.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2372166053882799966.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 690 rows 496 cols 2295 entries
Finished phase 1 with 479 SingleSign rule and 0 generalized
[2026-06-10 15:18:08] [INFO ] Computed 32 invariants in 11 ms
Computed 32 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-2372166053882799966.kers
Total runtime 13 ms.
[2026-06-10 15:18:09] [INFO ] Implicit Places using invariants in 561 ms returned []
[2026-06-10 15:18:09] [INFO ] Invariant cache hit.
[2026-06-10 15:18:10] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:18:19] [INFO ] Implicit Places using invariants and state equation in 10039 ms returned []
Implicit Place search using SMT with State Equation took 10603 ms to find 0 implicit places.
[2026-06-10 15:18:19] [INFO ] Redundant transitions in 22 ms returned []
Running 675 sub problems to find dead transitions.
[2026-06-10 15:18:19] [INFO ] Invariant cache hit.
[2026-06-10 15:18:19] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (OVERLAPS) 16/511 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem 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 TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem 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 TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem 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 TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 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 TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem 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 TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem 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 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 TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 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 TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem 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 TDEAD380 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 TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 15/47 constraints. Problems are: Problem set: 645 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/1201 variables, and 47 constraints, problems are : Problem set: 645 solved, 30 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 0/511 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 645 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 645 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 451/511 variables, 32/32 constraints. Problems are: Problem set: 645 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 15/47 constraints. Problems are: Problem set: 645 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/47 constraints. Problems are: Problem set: 645 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 690/1201 variables, 511/558 constraints. Problems are: Problem set: 645 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 225/783 constraints. Problems are: Problem set: 645 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1201 variables, 30/813 constraints. Problems are: Problem set: 645 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1201 variables, 0/813 constraints. Problems are: Problem set: 645 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/1201 variables, 0/813 constraints. Problems are: Problem set: 645 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1201/1201 variables, and 813 constraints, problems are : Problem set: 645 solved, 30 unsolved in 11419 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, State Equation: 511/511 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 30/675 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41714ms problems are : Problem set: 645 solved, 30 unsolved
Search for dead transitions found 645 dead transitions in 41718ms
Found 645 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 645 transitions
Dead transitions reduction (with SMT) removed 645 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 511/792 places, 45/971 transitions.
Graph (complete) has 150 edges and 511 vertex of which 76 are kept as prefixes of interest. Removing 435 places using SCC suffix rule.3 ms
Discarding 435 places :
Also discarding 0 output transitions
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 1 place count 76 transition count 31
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 43 place count 48 transition count 31
Applied a total of 43 rules in 17 ms. Remains 48 /511 variables (removed 463) and now considering 31/45 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4854065487946669853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16872075879902789721.kers'
[2026-06-10 15:19:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4854065487946669853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16872075879902789721.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 31 rows 47 cols 92 entries
Finished phase 1 with 16 SingleSign rule and 15 generalized
[2026-06-10 15:19:01] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16872075879902789721.kers
Total runtime 0 ms.
[2026-06-10 15:19:01] [INFO ] Implicit Places using invariants in 71 ms returned [15, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 75 ms to find 14 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 34/792 places, 31/971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 34 transition count 17
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 20 transition count 17
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 41 place count 7 transition count 4
Iterating global reduction 2 with 13 rules applied. Total rules applied 54 place count 7 transition count 4
Applied a total of 54 rules in 3 ms. Remains 7 /34 variables (removed 27) and now considering 4/31 (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-6411390263465091622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11103694785421259929.kers'
[2026-06-10 15:19:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6411390263465091622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11103694785421259929.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 4 rows 6 cols 9 entries
Finished phase 1 with 3 SingleSign rule and 1 generalized
[2026-06-10 15:19:01] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11103694785421259929.kers
Total runtime 0 ms.
[2026-06-10 15:19:01] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-06-10 15:19:01] [INFO ] Invariant cache hit.
[2026-06-10 15:19:01] [INFO ] Implicit Places using invariants and state equation in 23 ms returned [2, 5]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 47 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 5/792 places, 4/971 transitions.
Graph (complete) has 2 edges and 5 vertex of which 4 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 3 /5 variables (removed 2) and now considering 2/4 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7168622315121397699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-826399486783647995.kers'
[2026-06-10 15:19:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7168622315121397699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-826399486783647995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 2 rows 3 cols 4 entries
Finished phase 1 with 1 SingleSign rule and 1 generalized
[2026-06-10 15:19:01] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-826399486783647995.kers
Total runtime 0 ms.
[2026-06-10 15:19:01] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-06-10 15:19:01] [INFO ] Invariant cache hit.
[2026-06-10 15:19:01] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 4 : 3/792 places, 2/971 transitions.
Finished structural reductions in SI_CTL mode , in 4 iterations and 52679 ms. Remains : 3/792 places, 2/971 transitions.
[2026-06-10 15:19:01] [INFO ] Flatten gal took : 1 ms
[2026-06-10 15:19:01] [INFO ] Flatten gal took : 1 ms
[2026-06-10 15:19:01] [INFO ] Input system was already deterministic with 2 transitions.
[2026-06-10 15:19:01] [INFO ] Flatten gal took : 0 ms
[2026-06-10 15:19:01] [INFO ] Flatten gal took : 0 ms
[2026-06-10 15:19:01] [INFO ] Time to serialize gal into /tmp/CTLFireability4033743349664986236.gal : 1 ms
[2026-06-10 15:19:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1831608291606989521.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4033743349664986236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1831608291606989521.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,0.013357,3636,2,6,5,19,6,0,15,12,0


Converting to forward existential form...Done !
original formula: AG(EF(((busy_17_32>=1)&&(testbusy_9_17>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((busy_17_32>=1)&&(testbusy_9_17>=1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.01455,3956,1,0,8,33,14,3,56,20,5
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 971/971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 767 transition count 946
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 767 transition count 946
Applied a total of 50 rules in 37 ms. Remains 767 /792 variables (removed 25) and now considering 946/971 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10658973019676868797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11185619043016211966.kers'
[2026-06-10 15:19:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10658973019676868797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11185619043016211966.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 946 rows 752 cols 2598 entries
Finished phase 1 with 735 SingleSign rule and 0 generalized
[2026-06-10 15:19:01] [INFO ] Computed 32 invariants in 13 ms
Computed 32 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-11185619043016211966.kers
Total runtime 14 ms.
[2026-06-10 15:19:02] [INFO ] Implicit Places using invariants in 765 ms returned []
[2026-06-10 15:19:02] [INFO ] Invariant cache hit.
[2026-06-10 15:19:02] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:19:11] [INFO ] Implicit Places using invariants and state equation in 9370 ms returned []
Implicit Place search using SMT with State Equation took 10137 ms to find 0 implicit places.
Running 931 sub problems to find dead transitions.
[2026-06-10 15:19:11] [INFO ] Invariant cache hit.
[2026-06-10 15:19:11] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/751 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 931 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/1713 variables, and 30 constraints, problems are : Problem set: 0 solved, 931 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/767 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 931/931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/751 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 931 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/1713 variables, and 30 constraints, problems are : Problem set: 0 solved, 931 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/767 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 0/931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 931 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Starting structural reductions in LTL mode, iteration 1 : 767/792 places, 946/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70453 ms. Remains : 767/792 places, 946/971 transitions.
[2026-06-10 15:20:12] [INFO ] Flatten gal took : 56 ms
[2026-06-10 15:20:12] [INFO ] Flatten gal took : 61 ms
[2026-06-10 15:20:12] [INFO ] Input system was already deterministic with 946 transitions.
[2026-06-10 15:20:12] [INFO ] Flatten gal took : 50 ms
[2026-06-10 15:20:12] [INFO ] Flatten gal took : 44 ms
[2026-06-10 15:20:12] [INFO ] Time to serialize gal into /tmp/CTLFireability16329449227890497457.gal : 32 ms
[2026-06-10 15:20:12] [INFO ] Time to serialize properties into /tmp/CTLFireability5995920978391082697.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/CTLFireability16329449227890497457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5995920978391082697.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.47784e+07,3.72443,89044,2,56246,5,245926,6,0,3957,107878,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:20:42] [INFO ] Flatten gal took : 26 ms
[2026-06-10 15:20:42] [INFO ] Applying decomposition
[2026-06-10 15:20:42] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6200143843334412921.txt' '-o' '/tmp/graph6200143843334412921.bin' '-w' '/tmp/graph6200143843334412921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6200143843334412921.bin' '-l' '-1' '-v' '-w' '/tmp/graph6200143843334412921.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:20:42] [INFO ] Decomposing Gal with order
[2026-06-10 15:20:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:20:43] [INFO ] Removed a total of 999 redundant transitions.
[2026-06-10 15:20:43] [INFO ] Flatten gal took : 239 ms
[2026-06-10 15:20:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 51 ms.
[2026-06-10 15:20:43] [INFO ] Time to serialize gal into /tmp/CTLFireability18198378106166912074.gal : 22 ms
[2026-06-10 15:20:43] [INFO ] Time to serialize properties into /tmp/CTLFireability834486570392434591.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/CTLFireability18198378106166912074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability834486570392434591.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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.47784e+07,1.30124,46572,5059,18,93279,476,2110,80027,27,648,0


Converting to forward existential form...Done !
original formula: EF(EX(AG(AX((i0.u167.endloop_7_24>=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(!(EX(!((i0.u167.endloop_7_24>=1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t930, t931, t932, t933, t934, t935, t936, t937, t938, t939, t940, t941, t942, t943, t944, In...253
(forward)formula 0,1,4.17919,127844,1,0,246638,476,7838,495084,113,648,777191
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 971/971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 767 transition count 946
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 767 transition count 946
Applied a total of 50 rules in 37 ms. Remains 767 /792 variables (removed 25) and now considering 946/971 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12683917820923071811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1814278922877716714.kers'
[2026-06-10 15:20:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12683917820923071811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1814278922877716714.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 946 rows 752 cols 2598 entries
Finished phase 1 with 735 SingleSign rule and 0 generalized
[2026-06-10 15:20:47] [INFO ] Computed 32 invariants in 13 ms
Computed 32 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1814278922877716714.kers
Total runtime 15 ms.
[2026-06-10 15:20:48] [INFO ] Implicit Places using invariants in 784 ms returned []
[2026-06-10 15:20:48] [INFO ] Invariant cache hit.
[2026-06-10 15:20:49] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:20:56] [INFO ] Implicit Places using invariants and state equation in 7986 ms returned []
Implicit Place search using SMT with State Equation took 8774 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 767/792 places, 946/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8813 ms. Remains : 767/792 places, 946/971 transitions.
[2026-06-10 15:20:56] [INFO ] Flatten gal took : 22 ms
[2026-06-10 15:20:56] [INFO ] Flatten gal took : 26 ms
[2026-06-10 15:20:56] [INFO ] Input system was already deterministic with 946 transitions.
[2026-06-10 15:20:56] [INFO ] Flatten gal took : 25 ms
[2026-06-10 15:20:56] [INFO ] Flatten gal took : 26 ms
[2026-06-10 15:20:56] [INFO ] Time to serialize gal into /tmp/CTLFireability1876001601042882223.gal : 11 ms
[2026-06-10 15:20:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9520847143188630793.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/CTLFireability1876001601042882223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9520847143188630793.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47784e+07,3.72273,93312,2,59076,5,255587,6,0,3957,108491,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:21:26] [INFO ] Flatten gal took : 24 ms
[2026-06-10 15:21:26] [INFO ] Applying decomposition
[2026-06-10 15:21:26] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12518185266460400081.txt' '-o' '/tmp/graph12518185266460400081.bin' '-w' '/tmp/graph12518185266460400081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12518185266460400081.bin' '-l' '-1' '-v' '-w' '/tmp/graph12518185266460400081.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:21:27] [INFO ] Decomposing Gal with order
[2026-06-10 15:21:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:21:27] [INFO ] Removed a total of 1002 redundant transitions.
[2026-06-10 15:21:27] [INFO ] Flatten gal took : 68 ms
[2026-06-10 15:21:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 37 ms.
[2026-06-10 15:21:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7979123292123128024.gal : 12 ms
[2026-06-10 15:21:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2468664067967218746.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/CTLFireability7979123292123128024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2468664067967218746.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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.47784e+07,1.27507,46800,927,18,90524,400,1973,94302,26,698,0


Converting to forward existential form...Done !
original formula: AF(AX((i3.i1.u159.endloop_9_19>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((i3.i1.u159.endloop_9_19>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t930, t931, t934, t935, t936, t937, t938, t939, t940, t941, t942, t943, t944, i3.t932, i3.i1....262
dead was empty
(forward)formula 0,1,3.03152,87804,1,0,249082,400,7623,216623,112,698,351306
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 971/971 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 766 transition count 945
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 766 transition count 945
Applied a total of 52 rules in 40 ms. Remains 766 /792 variables (removed 26) and now considering 945/971 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12262755711040245004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10159491006845321882.kers'
[2026-06-10 15:21:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12262755711040245004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10159491006845321882.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 945 rows 751 cols 2595 entries
Finished phase 1 with 734 SingleSign rule and 0 generalized
[2026-06-10 15:21:30] [INFO ] Computed 32 invariants in 13 ms
Computed 32 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-10159491006845321882.kers
Total runtime 14 ms.
[2026-06-10 15:21:31] [INFO ] Implicit Places using invariants in 880 ms returned []
[2026-06-10 15:21:31] [INFO ] Invariant cache hit.
[2026-06-10 15:21:32] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:21:40] [INFO ] Implicit Places using invariants and state equation in 8999 ms returned []
Implicit Place search using SMT with State Equation took 9882 ms to find 0 implicit places.
Running 930 sub problems to find dead transitions.
[2026-06-10 15:21:40] [INFO ] Invariant cache hit.
[2026-06-10 15:21:40] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/1711 variables, and 30 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/766 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 930/930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/1711 variables, and 30 constraints, problems are : Problem set: 0 solved, 930 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/766 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 0/930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Starting structural reductions in LTL mode, iteration 1 : 766/792 places, 945/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70203 ms. Remains : 766/792 places, 945/971 transitions.
[2026-06-10 15:22:40] [INFO ] Flatten gal took : 27 ms
[2026-06-10 15:22:40] [INFO ] Flatten gal took : 31 ms
[2026-06-10 15:22:40] [INFO ] Input system was already deterministic with 945 transitions.
[2026-06-10 15:22:40] [INFO ] Flatten gal took : 30 ms
[2026-06-10 15:22:40] [INFO ] Flatten gal took : 43 ms
[2026-06-10 15:22:40] [INFO ] Time to serialize gal into /tmp/CTLFireability13469023194414654769.gal : 10 ms
[2026-06-10 15:22:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14127493304546784018.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/CTLFireability13469023194414654769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14127493304546784018.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.47784e+07,3.99202,89892,2,57031,5,248512,6,0,3952,107427,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:23:10] [INFO ] Flatten gal took : 19 ms
[2026-06-10 15:23:10] [INFO ] Applying decomposition
[2026-06-10 15:23:10] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9574987735849549427.txt' '-o' '/tmp/graph9574987735849549427.bin' '-w' '/tmp/graph9574987735849549427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9574987735849549427.bin' '-l' '-1' '-v' '-w' '/tmp/graph9574987735849549427.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:23:11] [INFO ] Decomposing Gal with order
[2026-06-10 15:23:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:23:11] [INFO ] Removed a total of 1001 redundant transitions.
[2026-06-10 15:23:11] [INFO ] Flatten gal took : 96 ms
[2026-06-10 15:23:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 38 ms.
[2026-06-10 15:23:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15973850048562561387.gal : 19 ms
[2026-06-10 15:23:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9466711115468307035.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/CTLFireability15973850048562561387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9466711115468307035.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47784e+07,1.75466,49280,2659,23,75024,510,2096,219556,30,688,0


Converting to forward existential form...Done !
original formula: AF(EG(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(TRUE))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t930, t931, t932, t933, t934, t935, t936, t937, t938, t939, t940, t941, t942, t943, t944, In...253
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,12.169,338128,1,0,458336,510,9203,2.63642e+06,139,727,862592
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 792/792 places, 971/971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 792 transition count 956
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 777 transition count 956
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 55 place count 752 transition count 931
Iterating global reduction 2 with 25 rules applied. Total rules applied 80 place count 752 transition count 931
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 556 place count 514 transition count 693
Applied a total of 556 rules in 83 ms. Remains 514 /792 variables (removed 278) and now considering 693/971 (removed 278) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4439216932277505257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16753378657550565632.kers'
[2026-06-10 15:23:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4439216932277505257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16753378657550565632.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 693 rows 499 cols 2301 entries
Finished phase 1 with 482 SingleSign rule and 0 generalized
[2026-06-10 15:23:23] [INFO ] Computed 32 invariants in 7 ms
Computed 32 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16753378657550565632.kers
Total runtime 9 ms.
[2026-06-10 15:23:24] [INFO ] Implicit Places using invariants in 684 ms returned []
[2026-06-10 15:23:24] [INFO ] Invariant cache hit.
[2026-06-10 15:23:24] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:23:36] [INFO ] Implicit Places using invariants and state equation in 11969 ms returned []
Implicit Place search using SMT with State Equation took 12656 ms to find 0 implicit places.
[2026-06-10 15:23:36] [INFO ] Redundant transitions in 10 ms returned []
Running 678 sub problems to find dead transitions.
[2026-06-10 15:23:36] [INFO ] Invariant cache hit.
[2026-06-10 15:23:36] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 678 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 678 unsolved
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 0 solved, 678 unsolved
Search for dead transitions found 0 dead transitions in 30185ms
Starting structural reductions in SI_CTL mode, iteration 1 : 514/792 places, 693/971 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42943 ms. Remains : 514/792 places, 693/971 transitions.
[2026-06-10 15:24:06] [INFO ] Flatten gal took : 23 ms
[2026-06-10 15:24:06] [INFO ] Flatten gal took : 27 ms
[2026-06-10 15:24:06] [INFO ] Input system was already deterministic with 693 transitions.
[2026-06-10 15:24:06] [INFO ] Flatten gal took : 90 ms
RANDOM walk for 40000 steps (868 resets) in 468 ms. (85 steps per ms) remains 1/1 properties
[2026-06-10 15:24:06] [INFO ] Flatten gal took : 38 ms
[2026-06-10 15:24:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7309246306745682769.gal : 23 ms
[2026-06-10 15:24:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10079804199803186429.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7309246306745682769.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10079804199803186429.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (162 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10079804199803186429.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 16
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :16 after 116
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :116 after 121
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :121 after 687
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :687 after 736
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :736 after 2043
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2043 after 9472
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.96493e+06,1.84891,46324,2,11812,16,71376,7,0,2695,35282,0
Total reachable state count : 3964928

Verifying 1 reachability properties.
Invariant property FileSystem-PT-N02I15B15-CTLFireability-2024-09 is true.
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FileSystem-PT-N02I15B15-CTLFireability-2024-09,0,1.85416,46416,1,0,16,71376,7,0,2696,35282,0
Interrupted probabilistic random walk after 346150 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 346150 steps, saw 96780 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 971/971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 768 transition count 947
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 768 transition count 947
Applied a total of 48 rules in 27 ms. Remains 768 /792 variables (removed 24) and now considering 947/971 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1574981655673207659.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7076310082801403596.kers'
[2026-06-10 15:24:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1574981655673207659.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7076310082801403596.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 947 rows 753 cols 2601 entries
Finished phase 1 with 736 SingleSign rule and 0 generalized
[2026-06-10 15:24:09] [INFO ] Computed 32 invariants in 12 ms
Computed 32 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-7076310082801403596.kers
Total runtime 14 ms.
[2026-06-10 15:24:10] [INFO ] Implicit Places using invariants in 607 ms returned []
[2026-06-10 15:24:10] [INFO ] Invariant cache hit.
[2026-06-10 15:24:11] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:24:18] [INFO ] Implicit Places using invariants and state equation in 8125 ms returned []
Implicit Place search using SMT with State Equation took 8737 ms to find 0 implicit places.
Running 932 sub problems to find dead transitions.
[2026-06-10 15:24:18] [INFO ] Invariant cache hit.
[2026-06-10 15:24:18] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 932 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/1715 variables, and 30 constraints, problems are : Problem set: 0 solved, 932 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/768 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 932/932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 932 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/752 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 932 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/1715 variables, and 30 constraints, problems are : Problem set: 0 solved, 932 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/768 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 0/932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 932 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Starting structural reductions in LTL mode, iteration 1 : 768/792 places, 947/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69009 ms. Remains : 768/792 places, 947/971 transitions.
[2026-06-10 15:25:18] [INFO ] Flatten gal took : 25 ms
[2026-06-10 15:25:18] [INFO ] Flatten gal took : 31 ms
[2026-06-10 15:25:19] [INFO ] Input system was already deterministic with 947 transitions.
[2026-06-10 15:25:19] [INFO ] Flatten gal took : 29 ms
[2026-06-10 15:25:19] [INFO ] Flatten gal took : 29 ms
[2026-06-10 15:25:19] [INFO ] Time to serialize gal into /tmp/CTLFireability7379759773050312337.gal : 8 ms
[2026-06-10 15:25:19] [INFO ] Time to serialize properties into /tmp/CTLFireability7009197803053756394.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/CTLFireability7379759773050312337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7009197803053756394.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47784e+07,4.07785,93404,2,58361,5,255778,6,0,3962,108049,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:25:49] [INFO ] Flatten gal took : 17 ms
[2026-06-10 15:25:49] [INFO ] Applying decomposition
[2026-06-10 15:25:49] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4808908408170996051.txt' '-o' '/tmp/graph4808908408170996051.bin' '-w' '/tmp/graph4808908408170996051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4808908408170996051.bin' '-l' '-1' '-v' '-w' '/tmp/graph4808908408170996051.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:25:49] [INFO ] Decomposing Gal with order
[2026-06-10 15:25:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:25:49] [INFO ] Removed a total of 999 redundant transitions.
[2026-06-10 15:25:49] [INFO ] Flatten gal took : 53 ms
[2026-06-10 15:25:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 15 ms.
[2026-06-10 15:25:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17894120121273254153.gal : 17 ms
[2026-06-10 15:25:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14175789836481564213.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/CTLFireability17894120121273254153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14175789836481564213.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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.47784e+07,1.15472,32216,1223,19,54294,421,2025,60433,29,672,0


Converting to forward existential form...Done !
original formula: AF((AX(FALSE) * AX(AG(((i1.i0.u173.endloop_7_29<1)&&(i0.i0.u174.endloop_9_16<1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(FALSE))) * !(EX(!(!(E(TRUE U !(((i1.i0.u173.endloop_7_29<1)&&(i0.i0.u174.endloop_9_16<1))))...171
Reverse transition relation is NOT exact ! Due to transitions t931, t932, t933, t934, t935, t936, t937, t938, t939, t940, t941, t942, t943, i0.t944, i0.i0....262
dead was empty
(forward)formula 0,1,2.2695,66520,1,0,161510,421,7679,224369,118,672,271511
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 971/971 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 769 transition count 948
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 769 transition count 948
Applied a total of 46 rules in 29 ms. Remains 769 /792 variables (removed 23) and now considering 948/971 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5177457523749807160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3162008596796876756.kers'
[2026-06-10 15:25:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5177457523749807160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3162008596796876756.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 948 rows 754 cols 2604 entries
Finished phase 1 with 737 SingleSign rule and 0 generalized
[2026-06-10 15:25:51] [INFO ] Computed 32 invariants in 12 ms
Computed 32 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-3162008596796876756.kers
Total runtime 13 ms.
[2026-06-10 15:25:52] [INFO ] Implicit Places using invariants in 666 ms returned []
[2026-06-10 15:25:52] [INFO ] Invariant cache hit.
[2026-06-10 15:25:53] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:26:07] [INFO ] Implicit Places using invariants and state equation in 14662 ms returned []
Implicit Place search using SMT with State Equation took 15330 ms to find 0 implicit places.
Running 933 sub problems to find dead transitions.
[2026-06-10 15:26:07] [INFO ] Invariant cache hit.
[2026-06-10 15:26:07] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/753 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/1717 variables, and 30 constraints, problems are : Problem set: 0 solved, 933 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/769 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 933/933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 933 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/753 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 933 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/1717 variables, and 30 constraints, problems are : Problem set: 0 solved, 933 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 30/32 constraints, State Equation: 0/769 constraints, ReadFeed: 0/225 constraints, PredecessorRefiner: 0/933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 933 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Starting structural reductions in LTL mode, iteration 1 : 769/792 places, 948/971 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75618 ms. Remains : 769/792 places, 948/971 transitions.
[2026-06-10 15:27:07] [INFO ] Flatten gal took : 25 ms
[2026-06-10 15:27:07] [INFO ] Flatten gal took : 30 ms
[2026-06-10 15:27:07] [INFO ] Input system was already deterministic with 948 transitions.
[2026-06-10 15:27:07] [INFO ] Flatten gal took : 29 ms
[2026-06-10 15:27:07] [INFO ] Flatten gal took : 29 ms
[2026-06-10 15:27:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5488930066960361344.gal : 8 ms
[2026-06-10 15:27:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2004476099458849070.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/CTLFireability5488930066960361344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2004476099458849070.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47784e+07,4.32965,90240,2,56474,5,242647,6,0,3967,105467,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 15:27:37] [INFO ] Flatten gal took : 18 ms
[2026-06-10 15:27:37] [INFO ] Applying decomposition
[2026-06-10 15:27:37] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph783977733518233974.txt' '-o' '/tmp/graph783977733518233974.bin' '-w' '/tmp/graph783977733518233974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph783977733518233974.bin' '-l' '-1' '-v' '-w' '/tmp/graph783977733518233974.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:27:37] [INFO ] Decomposing Gal with order
[2026-06-10 15:27:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:27:37] [INFO ] Removed a total of 1002 redundant transitions.
[2026-06-10 15:27:37] [INFO ] Flatten gal took : 50 ms
[2026-06-10 15:27:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 15 ms.
[2026-06-10 15:27:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8205551312288958637.gal : 13 ms
[2026-06-10 15:27:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14524322683279827191.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/CTLFireability8205551312288958637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14524322683279827191.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47784e+07,7.58379,205708,14475,24,341896,416,2138,1.18444e+06,32,644,0


Converting to forward existential form...Done !
original formula: AF(AX((((i6.i0.u157.endloop_4_19<1)&&(i7.i0.u156.endloop_2_27>=1))&&((i5.i1.u165.endloop_13_17<1)&&((i5.i0.u151.busy_16_31<1)||(i5.i0.u29...178
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((i6.i0.u157.endloop_4_19<1)&&(i7.i0.u156.endloop_2_27>=1))&&((i5.i1.u165.endloop_13_17<1)&...229
Reverse transition relation is NOT exact ! Due to transitions t930, t931, t932, t933, t934, t935, t936, t937, t938, t939, t940, t941, t942, t943, t944, In...253
Detected timeout of ITS tools.
[2026-06-10 15:28:07] [INFO ] Flatten gal took : 18 ms
[2026-06-10 15:28:07] [INFO ] Flatten gal took : 18 ms
[2026-06-10 15:28:07] [INFO ] Applying decomposition
[2026-06-10 15:28:07] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15071684937282483009.txt' '-o' '/tmp/graph15071684937282483009.bin' '-w' '/tmp/graph15071684937282483009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15071684937282483009.bin' '-l' '-1' '-v' '-w' '/tmp/graph15071684937282483009.weights' '-q' '0' '-e' '0.001'
[2026-06-10 15:28:08] [INFO ] Decomposing Gal with order
[2026-06-10 15:28:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 15:28:08] [INFO ] Removed a total of 959 redundant transitions.
[2026-06-10 15:28:08] [INFO ] Flatten gal took : 53 ms
[2026-06-10 15:28:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 21 ms.
[2026-06-10 15:28:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4045725632968135684.gal : 11 ms
[2026-06-10 15:28:08] [INFO ] Time to serialize properties into /tmp/CTLFireability4023167872504994851.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/CTLFireability4045725632968135684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4023167872504994851.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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.47784e+07,1.18498,37564,893,66,64849,1867,2258,73964,137,5469,0


Converting to forward existential form...Done !
original formula: AF(AX((((i1.i1.u167.endloop_4_19<1)&&(i2.i1.u279.endloop_2_27>=1))&&((i3.i1.u165.endloop_13_17<1)&&((i3.i0.u150.busy_16_31<1)||(i3.i0.u23...178
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((i1.i1.u167.endloop_4_19<1)&&(i2.i1.u279.endloop_2_27>=1))&&((i3.i1.u165.endloop_13_17<1)&...229
Reverse transition relation is NOT exact ! Due to transitions t932, t933, t934, t935, t936, t937, t938, t939, t940, t941, t942, t943, t944, i3.t931, i3.i0....262
Using saturation style SCC detection
Using saturation style SCC detection
dead was empty
(forward)formula 0,1,1.99833,50224,1,0,127895,1867,8143,128768,377,5469,209114
FORMULA FileSystem-PT-N02I15B15-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 897781 ms.

BK_STOP 1781105290275

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

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